By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Takata, M. ; Graduate Sch. of Human Culture, Nara Women''s Univ., Japan ; Kunieda, Yoshitoshi ; Joe, K.

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

Published in:

Innovative Architecture for Future Generation High-Performance Processors and Systems, 1999. International Workshop

Date of Conference:

Dec 2000