Task Migration in 3D Wormhole-Routed Mesh Multicomputers

Abstract

In a mesh multicomputer, to perform jobs needs to schedule submeshes according to some processor allocation scheme. In order to assign the incoming jobs, 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 3D mesh multicomputers with supporting dimension-ordered wormhole routing in one port communication models. Then, a hybrid scheme which combine advantages of the two task migration schemes is discussed. Finally, we compare the performance of all of these proposed approachs.