Using random task graphs to investigate the potential benefits of heterogeneity in parallel systems
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Multiprocessor scheduling under precedence constraints: polyhedral results
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Multiprocessor scheduling under precedence constraints: Polyhedral results
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
| Hi-index | 0.01 |
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. The paper presents a systematic way to build static heuristic scheduling algorithms for such environments. Several algorithms are proposed and their performances 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.