Sequential and Parallel Algorithms for Partitioning Tree Task Graphs on Shared Memory Architecture


The problem of partitioning task graphs in its general form is known to be NP-complete and it is extremely difficult to come up with simple but effective and fast heuristics too. In this paper, the tree task graphs are considered which arise from many important programming paradigms such as divide and conquer branch and bound, etc. The target architecture… (More)
DOI: 10.1109/ICPP.1994.181


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics