A Comparison of Clustering Heuristics for Scheduling Directed Acycle Graphs on Multiprocessors


Clustering of task graphs has been used as an intermediate step toward scheduling parallel architectures. In this paper, we identify important characteristics of clustering algorithms and propose a general framework for analyzing and evaluating such algorithms. Using this framework, we present an analytic performance comparison of four algorithms: Dominant… (More)
DOI: 10.1016/0743-7315(92)90012-C


18 Figures and Tables


Citations per Year

338 Citations

Semantic Scholar estimates that this publication has 338 citations based on the available data.

See our FAQ for additional information.