Task allocation onto a hypercube by recursive mincut bipartitioning
Date
1990
Authors
Ercal, F.
Ramanujam, J.
Sadayappan, P.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
7
views
views
47
downloads
downloads
Citation Stats
Series
Abstract
An efficient recursive task allocation scheme, based on the Kernighan-Lin mincut bisection heuristic, is proposed for the effective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be effective on a number of large test task graphs-its solution quality is nearly as good as that produced by simulated annealing, and its computation time is several orders of magnitude less
Source Title
Journal of Parallel and Distributed Computing
Publisher
Elsevier
Course
Other identifiers
Book Title
Keywords
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English