Task migration in n-dimensional wormhole-routed mesh multicomputers

Authors:
Gwo-Jong Yu;Chih-Yung Chang;Tzung-Shi Chen
Affiliations:
Department of Computer and Information Science, Aletheia University, Taipei 251, Taiwan;Department of Computer Science and Information Engineering, Tamkang University, Tamsui, Taipei 251, Taiwan;Department of Information Management, Chang Jung University, Tainan 396, Taiwan
Venue:
Journal of Systems Architecture: the EUROMICRO Journal
Year:
2004

Citing 14
Cited 3

A two-dimensional buddy systems for dynamic resource allocation in a partitionable mesh connected system

Journal of Parallel and Distributed Computing
A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers

IEEE Transactions on Computers
Submesh allocation in mesh multicomputers using busy-list: a best-fit approach with complete recognition capability

Journal of Parallel and Distributed Computing
The Tera computer system

ICS '90 Proceedings of the 4th international conference on Supercomputing
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers

IEEE Transactions on Parallel and Distributed Systems
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead

IEEE Transactions on Parallel and Distributed Systems
Configurable Algorithms for Complete Exchange in 2D Meshes

IEEE Transactions on Parallel and Distributed Systems
A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers

IEEE Transactions on Computers
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Collective Communication in Wormhole-Routed Massively Parallel Computers

Computer
A Top-Down Processor Allocation Scheme for Hypercube Computers

IEEE Transactions on Parallel and Distributed Systems
Toward Optimal Complete Exchange on Wormhole-Routed Tori

ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Lookahead Processor Allocation in Mesh-Connected Massively Parallel Multicomputer

Proceedings of the 8th International Symposium on Parallel Processing
Processor Allocation in the Mesh Multiprocessors Using the Leapfrog Method

IEEE Transactions on Parallel and Distributed Systems

Design and performance evaluation of combined first-fit task allocation and migration strategies in mesh multiprocessor systems

Parallel Computing
Task migration in three-dimensional meshes

The Journal of Supercomputing
Task migration in all-port wormhole-routed 2D mesh multicomputers

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a mesh multicomputer, performing jobs needs to schedule submeshes according to some processor allocation scheme. In order to assign the incoming jobs to a free submesh, a task compaction scheme is needed to generate a larger contiguous free region. The overhead of compaction depends on the efficiency of the task migration scheme. In this paper, two simple task migration schemes are first proposed in n-dimensional mesh multicomputers with supporting dimension-ordered wormhole routing in one-port communication model. Then, a hybrid scheme which combines advantages of the two schemes is discussed. Finally, we evaluate the performance of all of these proposed approaches.