A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors

✍ Scribed by A.K. Amoura; E. Bampis; Y. Manoussakis; Zs. Tuza

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 266 KB
• Volume: 25
• Category: Article
• ISSN: 0167-8191
• DOI: 10.1016/s0167-8191(98)00102-1

✦ Synopsis

We consider the problem of scheduling a set of independent multiprocessor tasks on three dedicated processors in order to minimize the makespan. We propose a new heuristic, called Divide Uniprocessor Tasks (DUT), and we provide simulation results comparing the eectiveness of DUT with previously known heuristics.