Task migration in all-port wormhole-routed 2D mesh multicomputers

Author

Wang, Nen-Chung ; Chen, Tzung-Shi

Author_Institution

Dept. of Comput. Sci. & Inf. Eng, Chaoyang Univ. of Technol., Taichung, Taiwan

fYear

2004

fDate

10-12 May 2004

Firstpage

123

Lastpage

128

Abstract

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. We also analyze and discuss the routing phases for task migration. Finally, we compare the proposed task migration schemes via performance analysis.

Keywords

multiprocessor interconnection networks; network routing; parallel architectures; performance evaluation; processor scheduling; resource allocation; all-port communication model; all-port wormhole-routed 2D mesh multicomputers; job assignment; parallel computing; performance analysis; processor allocation schemes; submesh scheduling; task compaction; task migration; wormhole routing; Appropriate technology; Chaotic communication; Compaction; Computer science; Hypercubes; Information management; Parallel processing; Performance analysis; Processor scheduling; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

ISSN

1087-4089

Print_ISBN

0-7695-2135-5

Type

conf

DOI

10.1109/ISPAN.2004.1300469

Filename

1300469