{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T00:10:26Z","timestamp":1736640626045,"version":"3.32.0"},"reference-count":9,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,25]],"date-time":"2006-10-25T00:00:00Z","timestamp":1161734400000},"content-version":"vor","delay-in-days":4103,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Concurrency: Pract. Exper."],"published-print":{"date-parts":[[1995,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Multiple processor systems are an integral part of today's high\u2010performance computing environment. Such systems are often configured as a two\u2010dimensional grid of processors called a mesh. Tasks compete for rectangular submeshes of this mesh. The choice of submesh allocation strategy can significantly affect the level of processor utilization and a task's waiting time. In addition, the execution speed of various allocation algorithms varies widely, which can further affect system performance. This paper describes and categorizes several submesh allocation strategies, including a previously unreported method that is superior to other methods in terms of execution speed. The paper includes results of simulation studies used to compare the performance characteristics of the most efficient allocation strategies in each category.<\/jats:p>","DOI":"10.1002\/cpe.4330070510","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T15:11:37Z","timestamp":1163776297000},"page":"497-514","source":"Crossref","is-referenced-by-count":1,"title":["A compendium of processor allocation strategies for two\u2010dimensional mesh connected systems"],"prefix":"10.1002","volume":"7","author":[{"given":"Bonnie E.","family":"Melhart","sequence":"first","affiliation":[]},{"given":"Craig A.","family":"Morgenstern","sequence":"additional","affiliation":[]},{"given":"Tom","family":"Nute","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,25]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(91)90032-5"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"D.BabbarandP.Krueger \u2018A performance comparison of processor allocation and job scheduling algorithms for mesh\u2010connected multiprocessors \u2019 inProceedings of the 6th IEEE Symposium on Parallel and Distributed Processing 1994 pp.46\u201353.","DOI":"10.1109\/SPDP.1994.346182"},{"issue":"4","key":"e_1_2_1_4_2","first-page":"353","article-title":"Methods for precise submesh allocation","volume":"3","author":"Morgenstern C. A.","year":"1994","journal-title":"Sci. Program"},{"key":"e_1_2_1_5_2","unstructured":"D. D.SharmaandD. K.Pradhan \u2018A fast and efficient strategy for submesh allocation in mesh\u2010connected parallel computers\u2019 inProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing 1993 pp.682\u2013689."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90016-G"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.265948"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"J.DingandL. N.Bhuyan \u2018An adaptive submesh allocation strategy for two\u2010dimensional mesh connected systems\u2019 inProceedings of the International Conference on Parallel Processing Vol. II 1993 pp.193\u2013200.","DOI":"10.1109\/ICPP.1993.39"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"C. A.MorgensternandP.Fouque \u2018Efficient submesh allocation using interval sets \u2019 inProceedings of the 27th Annual Hawaii International Conference on System Sciences 1994 pp.493\u2013501.","DOI":"10.1109\/HICSS.1994.323234"},{"volume-title":"Simulation Modeling and Analysis","year":"1991","author":"Law A. M.","key":"e_1_2_1_10_2"}],"container-title":["Concurrency: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcpe.4330070510","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.4330070510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T23:50:27Z","timestamp":1736639427000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.4330070510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["10.1002\/cpe.4330070510"],"URL":"https:\/\/doi.org\/10.1002\/cpe.4330070510","archive":["Portico"],"relation":{},"ISSN":["1040-3108","1096-9128"],"issn-type":[{"type":"print","value":"1040-3108"},{"type":"electronic","value":"1096-9128"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}