loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04)
Task Migration in All-Port Wormhole-Routed 2D Mesh Multicomputers
Hong Kong, SAR, China
May 10-May 12
ISBN: 0-7695-2135-5
ASCII Text
x 
 
Nen-Chung Wang, Tzung-Shi Chen, "Task Migration in All-Port Wormhole-Routed 2D Mesh Multicomputers," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 123, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.2004.1300469,
author = {Nen-Chung Wang and Tzung-Shi Chen},
title = {Task Migration in All-Port Wormhole-Routed 2D Mesh Multicomputers},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {2004},
issn = {1087-4089},
pages = {123},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300469},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - Task Migration in All-Port Wormhole-Routed 2D Mesh Multicomputers
SN - 1087-4089
SP
EP
A1 - Nen-Chung Wang,
A1 - Tzung-Shi Chen,
PY - 2004
KW - Mesh multicomputers
KW - parallel computing
KW - processor allocation
KW - task migration
KW - wormhole routing
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
Nen-Chung Wang, Chaoyang University of Technology, Taiwan
Tzung-Shi Chen, Chang Jung University, Taiwan
In a mesh multicomputer, submeshes are scheduled to perform jobs according to some processor allocation schemes, each job assigned to occupy processors of one submesh with an appropriate size. In order to assign the region for the incoming jobs, a task compaction is needed to produce a larger contiguous free region. The overhead of task compaction is primarily relied on designing an efficient task migration scheme. In this paper, we aim at the 2D mesh multicomputers with supporting wormhole routing in all-port communication model as the target machine. First, a certain and a relieved constraints between two submeshes for task migration are proposed. We next propose two task migration schemes following one of the constraints in 2D mesh multicomputers. Then we will also analyze and discuss the routing phases for task migration. Finally, we will compare the proposed task migration schemes via performance analysis.
Index Terms:
Mesh multicomputers, parallel computing, processor allocation, task migration, wormhole routing
Citation:
Nen-Chung Wang, Tzung-Shi Chen, "Task Migration in All-Port Wormhole-Routed 2D Mesh Multicomputers," ispan, pp.123, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.