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

  • Authors:

  • Nen-Chung Wang;Tzung-Shi Chen

  • Affiliations:

  • Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung 413, Taiwan, ROC;Department of Information and Learning Technology, National University of Tainan, Tainan 700, Taiwan, ROC

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2006

Quantified Score

Hi-index 0.07

Visualization

Abstract

In a mesh multicomputer, submeshes are allocated to perform jobs according to processor allocation schemes, with each task assigned to occupy processors of one submesh with an appropriate size. To assign regions for incoming tasks, task compaction is needed to produce a large contiguous free region. The overhead of task compaction relies mainly on designing an efficient task migration scheme. This paper investigates task migration schemes in 2D wormhole-routed mesh multicomputers with an all-port communication model. Two constraints are given between two submeshes for task migration. Two task migration schemes that follow one of the constraints in 2D mesh multicomputers are then developed. In addition, the proposed schemes are proven to be deadlock-free and congestion-free. Finally, performance analysis is adopted to compare the proposed task migration schemes.