STATIC HEURISTIC PROCESSOR ASSIGNMENT IN HETEROGENEOUS MULTIPROCESSORS
Daniel A. Menascé, STELLA C. DA SILVA PORTO, Satish Kumar Tripathi · International Journal of High Speed Computing · 1994
It has been already demonstrated that cost-effective multiprocessor designs may be obtained by combining in the same architecture processors of different speeds (heterogeneous architecture) so that the serial and critical portions of the application may benefit from a fast single processor. In such an environment, the problem of assigning tasks to processors becomes a very important one. This papers presents a systematic way to build static heuristic scheduling algorithms. Using this strategy, several algorithms are proposed and their performance are compared through simulation. One of the proposed algorithms is shown to achieve substantial performance gains as the degree of heterogeneity of the architecture increases. Keywords: Heterogeneity, Scheduling, Task Graph, Multiprocessor and Heuristic. 1.