A comparison of the static task graph scheduling algorithms
Janez Brest, Viljem Zumer · 2001
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.