Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: Article
- DOI: 10.1007/s11227-010-0381-7
- Abstract:
- As a result of the emerging use of mesh-based multicomputers (and recently mesh-based multiprocessor systems-on-chip), issues related to processor management have attracted much attention. In a mesh-based multiprocessor, after repeated submesh allocations and de-allocations, the system network may be fragmented, i.e. there might be unallocated nodes in the network. As a result, in a system with contiguous processor allocation, no new tasks can start running due to the lack of enough free adjacent processors to form a suitable submesh. Although there might be enough free processors available, they remain idle until the allocator can find a set of adjacent free nodes forming a submesh to be used for the new task. This can lead to low system performance. Task migration was introduced as a solution to this problem through migration of tasks running on some submeshes to other free areas in order to reduce fragmentation by chaining the newly freed areas and disengaging nodes to form larger submeshes. In this paper, we propose a novel structured and formulated way to code task migration, which is helpful for congestion detection in different steps of task migration algorithms. Moreover, considering the fact that the 3D mesh-based multicomputers are now very popular, a new task migration algorithm in 3D meshes is proposed. We also address the special case of the 2D migration in a 3D mesh multicomputer
- Keywords:
- Interconnection networks ; 2D Meshes ; 3D Meshes ; Allocators ; Congestion detection ; Contiguous processor allocation ; Multicomputers ; Multiprocessor systems on chips ; Task migration ; Algorithms ; Fault tolerance ; Multiprocessing systems ; Three dimensional
- Source: Journal of Supercomputing ; Vol. 56, issue. 3 , 2011 , p. 328-352 ; ISSN: 09208542
- URL: http://link.springer.com/article/10.1007/s11227-010-0381-7