Task allocation onto a hypercube by recursive mincut bipartitioning
Author
Ercal, F.
Ramanujam, J.
Sadayappan, P.
Date
1990Source Title
Journal of Parallel and Distributed Computing
Print ISSN
0743-7315
Publisher
Elsevier
Volume
10
Issue
1
Pages
35 - 44
Language
English
Type
ArticleItem Usage Stats
116
views
views
122
downloads
downloads
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