Title :
A comparison of the static task graph scheduling algorithms
Author :
J. Brest;V. Zumer
Author_Institution :
Fac. of Electr. Eng. & Comput. Sci., Maribor Univ., Slovenia
fDate :
6/23/1905 12:00:00 AM
Abstract :
In this paper the new algorithm for static task graph scheduling on multiprocessor systems is proposed and a comparison with two algorithms known from the literature is presented. The comparison of the algorithms is made in terms of the completion times of resulting schedules using a prototype standard task graph set.
Keywords :
"Scheduling algorithm","Processor scheduling","Costs","Prototypes","Parallel processing","Computer networks","Computational efficiency","Computer science","Large-scale systems","Concurrent computing"
Conference_Titel :
Information Technology Interfaces, 2001. ITI 2001. Proceedings of the 23rd International Conference on
Print_ISBN :
953-96769-3-2
DOI :
10.1109/ITI.2001.937995
