{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:27:34Z","timestamp":1761323254772},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems Architecture"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s1383-7621(03)00098-5","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T16:09:00Z","timestamp":1063382940000},"page":"177-192","source":"Crossref","is-referenced-by-count":4,"title":["Task migration in n-dimensional wormhole-routed mesh multicomputers"],"prefix":"10.1016","volume":"50","author":[{"given":"Gwo-Jong","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chih-Yung","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzung-Shi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1383-7621(03)00098-5_BIB1","doi-asserted-by":"crossref","unstructured":"R. Alverson, The Tera computer system, in: Proceedings of International Conference on Supercomputing, 1990, pp. 1\u20136","DOI":"10.1145\/77726.255132"},{"key":"10.1016\/S1383-7621(03)00098-5_BIB2","doi-asserted-by":"crossref","unstructured":"S. Bhattacharya, W.-T. Tsai, Lookahead processor allocation in mesh-connected massively parallel multicomputer, in: Proceedings of International Parallel Processing Symposium, 1994, pp. 868\u2013875","DOI":"10.1109\/IPPS.1994.288204"},{"issue":"May","key":"10.1016\/S1383-7621(03)00098-5_BIB3","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/71.770192","article-title":"An efficient submesh allocation scheme for two-dimensional meshes with little overhead","volume":"10","author":"Chiu","year":"1999","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S1383-7621(03)00098-5_BIB4","doi-asserted-by":"crossref","unstructured":"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\u2013262","DOI":"10.1109\/ICDCS.1991.148674"},{"issue":"4","key":"10.1016\/S1383-7621(03)00098-5_BIB5","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1109\/12.135559","article-title":"A fast recognition-complete processor allocation strategy for hypercube computers","volume":"41","author":"Chuang","year":"1992","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1383-7621(03)00098-5_BIB6","doi-asserted-by":"crossref","unstructured":"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\u2013200","DOI":"10.1109\/ICPP.1993.39"},{"key":"10.1016\/S1383-7621(03)00098-5_BIB7","unstructured":"I. Corp., Paragon XP\/S product overview, 1994"},{"key":"10.1016\/S1383-7621(03)00098-5_BIB8","unstructured":"I. Corp., A touchstone DELTA system description, 1991"},{"issue":"January","key":"10.1016\/S1383-7621(03)00098-5_BIB9","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/71.80186","article-title":"A top\u2013down processor allocation scheme for hypercube computers","volume":"2","author":"Kim","year":"1991","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"December","key":"10.1016\/S1383-7621(03)00098-5_BIB10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-7315(91)90032-5","article-title":"A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system","volume":"31","author":"Li","year":"1991","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"July","key":"10.1016\/S1383-7621(03)00098-5_BIB11","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/71.598346","article-title":"Noncontiguous processor allocation algorithms for mesh-connected multicomputers","volume":"8","author":"Lo","year":"1997","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"December","key":"10.1016\/S1383-7621(03)00098-5_BIB12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/2.476198","article-title":"Collective communication in wormhole-routed massively parallel computers","volume":"28","author":"Mckinley","year":"1995","journal-title":"IEEE Computers"},{"issue":"February","key":"10.1016\/S1383-7621(03)00098-5_BIB13","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/2.191995","article-title":"A survey of wormhole routing techniques in direct networks","volume":"26","author":"Ni","year":"1993","journal-title":"IEEE Computers"},{"issue":"January","key":"10.1016\/S1383-7621(03)00098-5_BIB14","first-page":"106","article-title":"Submesh allocation in mesh multicomputers using busy-list: a best-fit approach with complete recognition capability","volume":"36","author":"Sharma","year":"1998","journal-title":"Journal of Parallel and Distributed Systems"},{"issue":"April","key":"10.1016\/S1383-7621(03)00098-5_BIB15","first-page":"337","article-title":"Configurable algorithms for complete exchange in 2D meshes","volume":"11","author":"Suh","year":"2000","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S1383-7621(03)00098-5_BIB16","unstructured":"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\u2013103"},{"issue":"March","key":"10.1016\/S1383-7621(03)00098-5_BIB17","first-page":"276","article-title":"Processor allocation in the mesh multiprocessors using the leapfrog method","volume":"14","author":"Wu","year":"2003","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"January","key":"10.1016\/S1383-7621(03)00098-5_BIB18","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/12.980016","article-title":"A fast and efficient processor allocation scheme for mesh-connected multicomputers","volume":"51","author":"Yoo","year":"2002","journal-title":"IEEE Transactions on Computers"},{"issue":"December","key":"10.1016\/S1383-7621(03)00098-5_BIB19","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0743-7315(92)90016-G","article-title":"Efficient processor allocation strategies for mesh-connected parallel computers","volume":"16","author":"Zhu","year":"1992","journal-title":"Journal of Parallel and Distributed Computing"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000985?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000985?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T11:26:42Z","timestamp":1551007602000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762103000985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S1383762103000985"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(03)00098-5","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}