Task migration in n-dimensional wormhole-routed mesh multicomputers

Journal of Systems Architecture

Volumn 50, Issue 4, 2004, Pages 177-192

  Yu, Gwo Jong ^a   Chang, Chih Yung ^b   Chen, T S Tzung Shi ^c  

^a ALETHEIA UNIVERSITY   (Taiwan)

^b TAMKANG UNIVERSITY   (Taiwan)

^c CHANG JUNG CHRISTIAN UNIVERSITY   (Taiwan)

Author keywords

Dimension ordered routing; Gather and scatter; Mesh multicomputers; Task migration; Wormhole routing

Indexed keywords

MATHEMATICAL MODELS; PROGRAM PROCESSORS; RESOURCE ALLOCATION; ROUTERS; SCHEDULING; VLSI CIRCUITS;

DIMENSION-ORDERED ROUTING; GATHER-AND-SCATTER; MESH MULTICOMPUTERS; TASK MIGRATION; WORMHOLE ROUTING;

COMPUTER SYSTEMS;

EID: 1842536455     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1383-7621(03)00098-5     Document Type: Article

References (19)

1. R. Alverson, The Tera computer system, in: Proceedings of International Conference on Supercomputing, 1990, pp. 1-6.
2. S. Bhattacharya, W.-T. Tsai, Lookahead processor allocation in mesh-connected massively parallel multicomputer, in: Proceedings of International Parallel Processing Symposium, 1994, pp. 868-875.
3. Chiu G.-M., Chen S.-K. An efficient submesh allocation scheme for two-dimensional meshes with little overhead. IEEE Transactions on Parallel and Distributed Systems. 10(May):1999;471-486.
4. P.-J. Chuang, N.-F. Tzeng, An efficient submesh allocation strategy for mesh computer systems, in: Proceedings of 11th International Conference on Distributed Computing Systems, May 1991, pp. 256-262.
5. Chuang P.-J., Tzeng N.-F. A fast recognition-complete processor allocation strategy for hypercube computers. IEEE Transactions on Computers. 41(4):1992;467-479.
6. J. Ding, L. Bhuyan, An adaptive submesh allocation strategy for two-dimensional mesh connected systems, in: Proceedings of International Conference on Parallel Processing, vol. II, 1993, pp. 193-200.
7. I. Corp., Paragon XP/S product overview, 1994.
8. I. Corp., A touchstone DELTA system description, 1991.
9. Kim J., Das C.R., Lin W. A top-down processor allocation scheme for hypercube computers. IEEE Transactions on Parallel and Distributed Systems. 2(January):1991;20-30.
10. Li K., Cheng K.H. A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system. Journal of Parallel and Distributed Computing. 31(December):1991;79-83.
11. Lo V., Windisch K.J., Liu W., Nitzberg B. Noncontiguous processor allocation algorithms for mesh-connected multicomputers. IEEE Transactions on Parallel and Distributed Systems. 8(July):1997;712-726.
12. Mckinley P.K., Tsai Y.-J., Robinson D.F. Collective communication in wormhole-routed massively parallel computers. IEEE Computers. 28(December):1995;39-50.
13. Ni L.M., Mckinley P.K. A survey of wormhole routing techniques in direct networks. IEEE Computers. 26(February):1993;62-76.
14. Sharma D.D., Pradhan D.K. Submesh allocation in mesh multicomputers using busy-list: a best-fit approach with complete recognition capability. Journal of Parallel and Distributed Systems. 36(January):1998;106-118.
15. Suh Y.-J., Yalamanchili S. Configurable algorithms for complete exchange in 2D meshes. IEEE Transactions on Parallel and Distributed Systems. 11(April):2000;337-356.
16. Y.-C. Tseng, S.-Y. Ni, J.-P. Sheu, Toward optimal complete exchange on wormhole-routed tori, in: Proceedings of the 1997 International Conference on Parallel and Distributed Systems, Seoul, Korea, December 1997, pp. 96-103.
17. Wu F., Hsu C.-C., Chou L. Processor allocation in the mesh multiprocessors using the leapfrog method. IEEE Transactions on Parallel and Distributed Systems. 14(March):2003;276-289.
18. Yoo B.S., Das C.R. A fast and efficient processor allocation scheme for mesh-connected multicomputers. IEEE Transactions on Computers. 51(January):2002;46-60.
19. Zhu Y. Efficient processor allocation strategies for mesh-connected parallel computers. Journal of Parallel and Distributed Computing. 16(December):1992;328-337.