Skip to main content
Log in

Task migration in three-dimensional meshes

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Parhami B (1999) Introduction to parallel processing, algorithms and architectures. Kluwer Academic, Dordrecht. eBook ISBN:0-306-46964-2

    Google Scholar 

  2. Duato J, Yalamanchili S, Ni L (2003) Interconnection networks: an engineering approach. Morgan Kaufmann, San Mateo. ISBN:1-55860-852-4

    Google Scholar 

  3. Miller R, Prasanna VK, Reisis DI, Stout QF (1993) Parallel computations on reconfigurable meshes. IEEE Trans Comput 42:678–692

    Article  MathSciNet  Google Scholar 

  4. Bhandarkar SM, Arabnia HR, Smith JW (1995) A reconfigurable architecture for image processing and computer vision. Int J Pattern Recognit Artif Intell (IJPRAI) 9:201–229

    Article  Google Scholar 

  5. Bhandarkar SM, Arabnia HR (1995) The hough transform on a reconfigurable multi-ring network. J Parallel Distrib Comput 24:107–114

    Article  Google Scholar 

  6. Arif Wani M, Arabnia HR (2003) Parallel edge-region-based segmentation algorithm targeted at reconfigurable multi-ring network. J Supercomput 25:43–63

    Article  MATH  Google Scholar 

  7. Ababneh I (2006) An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers. J Syst Softw 79:1168–1179

    Article  Google Scholar 

  8. Gabrani G, Mulkar T (2005) A quad-tree based algorithm for processor allocation in 2D mesh-connected multicomputers. Comput Stand Interfaces 27:133–147

    Article  Google Scholar 

  9. Paindaveine Y, Miloji DS (1996) Process vs. task migration. In: Proceedings of the 29th annual Hawaii international conference on system sciences, 1996, p 636

  10. Linder DH, Harden JC (1991) An adaptive and fault-tolerant wormhole routing strategy for k-ary n-cubes. IEEE Trans Comput 40:2–12

    Article  MathSciNet  Google Scholar 

  11. Chuang PJ, Tzeng NF (1991) An efficient submesh allocation strategy for mesh computer systems. In: Proceedings of 11th international, conference distributed computing systems, 1991, pp 256–262

  12. Chen TS (2000) Task migration in 2D wormhole-routed mesh multicomputers. Inf Process Lett 73:103–110

    Article  Google Scholar 

  13. Wang NC, Chen TS (2006) Task migration in all-port wormhole-routed 2D mesh multicomputers. Inf Sci 176:3409–3425

    Article  Google Scholar 

  14. Yu GJ, Chang CY, Chen TS (2004) Task migration in n-dimensional wormhole-routed mesh multicomputers. J Syst Archit 50:177–192

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hamid Sarbazi-Azad.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bargi, A., Sarbazi-Azad, H. Task migration in three-dimensional meshes. J Supercomput 56, 328–352 (2011). https://doi.org/10.1007/s11227-010-0381-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-010-0381-7

Keywords

Navigation