Task allocation onto a hypercube by recursive mincut bipartitioning
dc.citation.epage | 44 | en_US |
dc.citation.issueNumber | 1 | en_US |
dc.citation.spage | 35 | en_US |
dc.citation.volumeNumber | 10 | en_US |
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 | en_US |
dc.date.available | 2019-02-19T08:22:40Z | en_US |
dc.date.issued | 1990 | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.department | Computer Technology and Information Systems | en_US |
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 | en_US |
dc.description.provenance | Submitted by Mandana Moftakhari (mandana.mir@bilkent.edu.tr) on 2019-02-19T08:22:40Z No. of bitstreams: 1 Task -Allocation- onto.pdf: 1125675 bytes, checksum: 383be9f83c96d92352d97669d51cf0ac (MD5) | en_US |
dc.description.provenance | Made available in DSpace on 2019-02-19T08:22:40Z (GMT). No. of bitstreams: 1 Task -Allocation- onto.pdf: 1125675 bytes, checksum: 383be9f83c96d92352d97669d51cf0ac (MD5) Previous issue date: 1990 | en_US |
dc.identifier.doi | 10.1016/0743-7315(90)90004-9 | en_US |
dc.identifier.issn | 0743-7315 | |
dc.identifier.uri | http://hdl.handle.net/11693/49586 | en_US |
dc.language.iso | English | en_US |
dc.publisher | Elsevier | en_US |
dc.relation.isversionof | 10.1016/0743-7315(90)90004-9 | en_US |
dc.source.title | Journal of Parallel and Distributed Computing | en_US |
dc.title | Task allocation onto a hypercube by recursive mincut bipartitioning | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Task -Allocation- onto.pdf
- Size:
- 1.07 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: