کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
396246 | 666317 | 2006 | 17 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Task migration in all-port wormhole-routed 2D mesh multicomputers Task migration in all-port wormhole-routed 2D mesh multicomputers](/preview/png/396246.png)
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.
Journal: Information Sciences - Volume 176, Issue 22, 22 November 2006, Pages 3409–3425