Task clustering algorithm with improved efficiency

The general problem of scheduling a set of tasks on a given parallel architecture is NP-complete. A scheduling heuristic introduced by Yang and Gerasoulis is considered, and two extensions are proposed which significantly improve efficiency at very low time complexity cost.