Task Allocation Algorithm for Heterogeneous Multiprocessor Systems Using Heuristic Technique


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 4, pp. 890-900, Apr. 1999
10.3745/KIPSTE.1999.6.4.890,   PDF Download:

Abstract

In homogeneous multiprocessor systems, the task allocation algorithm which equally assigns tasks to processors if possible, is generally used. But this algorithm is not suitable to accomplish effective task allocation in heterogeneous multiprocessor systems. JSQ (Join the Shortest Queue) algorithm is often used in heterogeneous multiprocessor systems. Unfortunately, JSQ algorithm is not efficient when the differences of capabilities of processors are far large. To solve this problem, we suggest a heuristic task allocation algorithm that makes use of dynamic information such as task arrival time, task service time, and number of finished tasks. The results of simulation show that the proposed heuristic allocation algorithm improves the system performance.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. S. Ho, L. J. Sung, C. S. Hoan, "Task Allocation Algorithm for Heterogeneous Multiprocessor Systems Using Heuristic Technique," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 4, pp. 890-900, 1999. DOI: 10.3745/KIPSTE.1999.6.4.890.

[ACM Style]
Lim Sun Ho, Lee Jong Sung, and Chae Soo Hoan. 1999. Task Allocation Algorithm for Heterogeneous Multiprocessor Systems Using Heuristic Technique. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 4, (1999), 890-900. DOI: 10.3745/KIPSTE.1999.6.4.890.