Task allocation onto a hypercube by recursive mincut bipartitioning

dc.citation.epage	44
dc.citation.issueNumber	1
dc.citation.spage	35
dc.citation.volumeNumber	10
dc.contributor.author	Ercal, F.	en_US
dc.contributor.author	Ramanujam, J.	en_US
dc.contributor.author	Sadayappan, P.	en_US
dc.date.accessioned	2019-02-19T08:22:40Z
dc.date.available	2019-02-19T08:22:40Z
dc.date.issued	1990
dc.department	Department of Computer Engineering
dc.department	Computer Technology and Information Systems
dc.description.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
dc.identifier.doi	10.1016/0743-7315(90)90004-9
dc.identifier.issn	0743-7315
dc.identifier.uri	http://hdl.handle.net/11693/49586
dc.language.iso	English
dc.publisher	Elsevier
dc.relation.isversionof	http://doi.org/10.1016/0743-7315(90)90004-9
dc.source.title	Journal of Parallel and Distributed Computing
dc.title	Task allocation onto a hypercube by recursive mincut bipartitioning
dc.type	Article

Files

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1