A heuristic approach to improve a branch and bound based program partitioning algorithm

In this paper, we propose several heuristics that improve the branch and bound based program partitioning algorithm proposed by Girkar et al., and evaluate the effectiveness by experiments. The heuristic depends heavily, on the element order of edges of a given task graph. Therefore, it is necessary to sort the edges carefully to make effective use of the heuristic. Different sorting methods are investigated and experimentally evaluated. Approximate solutions that provide a sufficient practical partitioning were obtained using the accelerated heuristic, and execution times and error compared to the optimal solutions decreased considerably by sorting the edges of the task graph.