T. Hagras and J. Janeček (Czech Republic)
list scheduling, compile time scheduling, task graph scheduling, homogeneous computing.
List-based scheduling is generally accepted as an attractive approach to static task scheduling in homogeneous envi ronment, since it pairs low complexity with good results. This paper presents a static list-scheduling algorithm: Crit ical Path Parent Trees (CPPT) algorithm. The CPPT algo rithm divides the task graph into a set of unlisted parent trees, the root of each parent-tree is a critical-path node. The analysis and experiments have shown that the algo rithm provides very low complexity and comparable re sults.
Important Links:
Go Back
