Abstract:We investigate the problem of scheduling dags with parallel tasks on binarily partitionable systems by analyzing a n ðLLÞ; the average-case performance ratio of the level-by-level (LL) scheduling algorithm, where n is the number of tasks. It is shown that for arbitrary probability distributions of task parallelisms and task execution times, the asymptotic average-case performance ratio of algorithm LL in scheduling parallel computations with wide dags is a 1 ðLLÞ ¼ 1: In particular, for exponential distributio… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.