Abstract
Efficient scheduling of task graphs for parallel machines is a major issue in parallel computing. Such algorithms are often hard to understand and hard to evaluate. We present a framework for the visualization of scheduling algorithms. Using the LogP cost model for parallel machines, we simulate the effects of scheduling algorithms for specific target machines and task graphs before performing time and resource consumptive measurements in practice.
Cite
CITATION STYLE
Löwe, W., & Liebrich, A. (2001). Vizzscheduler-a framework for the visualization of scheduling algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2150, pp. 62–66). Springer Verlag. https://doi.org/10.1007/3-540-44681-8_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
