{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:06:27Z","timestamp":1648695987881},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2017,4,5]],"date-time":"2017-04-05T00:00:00Z","timestamp":1491350400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s11227-017-2031-9","type":"journal-article","created":{"date-parts":[[2017,4,5]],"date-time":"2017-04-05T15:23:41Z","timestamp":1491405821000},"page":"4158-4189","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Limited contiguous processor allocation mechanism in the mesh-connected multiprocessors using compaction"],"prefix":"10.1007","volume":"73","author":[{"given":"Akram","family":"Reza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahnaz","family":"Rafie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,5]]},"reference":[{"issue":"1","key":"2031_CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.4156\/jdcta.vol5.issue1.6","volume":"5","author":"S Bani-Ahmad","year":"2011","unstructured":"Bani-Ahmad S (2011) Bounded gradual-request-partitioning-based allocation strategies in 2D mesh multicomputers. Int J Digit Content Technol Appl 5(1):43\u201354","journal-title":"Int J Digit Content Technol Appl"},{"key":"2031_CR2","unstructured":"Bani-Mohammad S, Ould-Khaoua M, Ababneh I, Machenzie L (2006) Non-contiguous processor allocation strategy for 2D mesh connected multicomputers based on submeshes available for allocation. In: 12th International Conference on Parallel and Distributed Systems (ICPADS\u201906), vol 2. IEEE Computer Society Press, USA, pp 41\u201348"},{"issue":"8","key":"2031_CR3","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1016\/j.jss.2006.01.019","volume":"79","author":"I Ababneh","year":"2006","unstructured":"Ababneh I (2006) An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers. J Syst Softw 79(8):1168\u20131179","journal-title":"J Syst Softw"},{"key":"2031_CR4","unstructured":"Bani-Mohammad S, Ould-Khaoua M, Ababneh I, Machenzie L (2007) A fast and efficient processor allocation strategy which combines a contiguous and non-contiguous processor allocation algorithms. Technical Report TR-2007-229, DCS Technical Report Series, Department of Computing Science, University of Glasgow"},{"key":"2031_CR5","unstructured":"Windisch K, Lo V, Bose B (1995) Contiguous and non-contiguous processor allocation algorithms for k-ary n-cubes. Technical Report, University of Oregon, Oregon"},{"key":"2031_CR6","unstructured":"Windisch K (1997) ProcSimity V4.3 User\u2019s Manual. University of Oregon"},{"key":"2031_CR7","unstructured":"Bani-Mohammad S (2008) Efficient processor allocation strategies for mesh-connected multicomputers. PhD Thesis, The Faculty of Information and Mathematical Sciences University of Glasgow, Glasgow"},{"issue":"2","key":"2031_CR8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.jss.2008.06.033","volume":"82","author":"S Bani-Mohammad","year":"2009","unstructured":"Bani-Mohammad S, Ould-Khaoua M, Ababneh I, Mackenzie L (2009) Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers. J Syst Softw 82(2):307\u2013318","journal-title":"J Syst Softw"},{"issue":"7","key":"2031_CR9","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/71.598346","volume":"8","author":"KJ Windisch","year":"1997","unstructured":"Windisch KJ, Liu W, Nitzberg B (1997) Non-contiguous processor allocation algorithms for mesh-connected multicomputers. IEEE Trans Parallel Distrib Syst 8(7):712\u2013726","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"9","key":"2031_CR10","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1016\/j.parco.2008.03.009","volume":"34","author":"LK Goh","year":"2008","unstructured":"Goh LK, Veeravalli B (2008) Design and performance evaluation of combined first-fit task allocation and migration strategies in mesh multicomputer systems. J Parallel Comput 34(9):508\u2013520","journal-title":"J Parallel Comput"},{"issue":"3","key":"2031_CR11","first-page":"743","volume":"3","author":"A Reza","year":"2015","unstructured":"Reza A, Rafie M (2015) Improving multi task running time in two column boundary allocation method in mesh-based chip multiprocessors using combined migration mechanisms. Int J Comput Inf Technol 3(3):743\u2013755","journal-title":"Int J Comput Inf Technol"},{"key":"2031_CR12","doi-asserted-by":"crossref","unstructured":"Sharma DD, Pradhan DK (1993) A fast and efficient strategy for submesh allocation in mesh-connected parallel computers. In: Fifth IEEE Symposium on Parallel and Distributed Processing. pp 682\u2013689","DOI":"10.1109\/SPDP.1993.395466"},{"key":"2031_CR13","unstructured":"Chmaj G, Zydek D, Koszalka L (2004) Allocation algorithms problems in mesh-connected systems"},{"issue":"1","key":"2031_CR14","first-page":"14","volume":"123","author":"A Reza","year":"2015","unstructured":"Reza A, Rafie M (2015) Performance improvement in multiprocessors using two row boundary allocation method and online dynamic compaction algorithm. Int J Comput Appl 123(1):14\u201320","journal-title":"Int J Comput Appl"},{"issue":"4","key":"2031_CR15","doi-asserted-by":"crossref","first-page":"1660","DOI":"10.1007\/s11227-016-1692-0","volume":"72","author":"M Rafie","year":"2016","unstructured":"Rafie M, Khademzadeh A, Reza A, Reshadi M (2016) Performance evaluation of task migration in contiguous allocation for mesh interconnection topology. J Supercomput 72(4):1660\u20131677","journal-title":"J Supercomput"},{"issue":"1","key":"2031_CR16","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1166\/jctn.2016.4899","volume":"13","author":"M Rafie","year":"2016","unstructured":"Rafie M, Reza A, Khademzadeh A, Reshadi M (2016) External fragmentation aware dynamic multi task mapping on mesh interconnection. J Comput Theor Nanosci 13(1):958\u2013963","journal-title":"J Comput Theor Nanosci"},{"key":"2031_CR17","doi-asserted-by":"crossref","unstructured":"Bani-Ahmad S (2011) On improved processor allocation in 2D mesh-based multicomputers: controlled splitting of parallel requests. In: International Conference on Communication, Computing and Security (ICCCS\u201911), pp 204\u2013209","DOI":"10.1145\/1947940.1947984"},{"key":"2031_CR18","unstructured":"Kee GL (2005) Design and performance evaluation of migration-based submesh allocation strategies in mesh multicomputers. Master Thesis, National University of Singapore"},{"issue":"5","key":"2031_CR19","first-page":"517","volume":"2","author":"R Zolfaghari","year":"2013","unstructured":"Zolfaghari R (2013) Efficient and quick algorithm for processor allocation in mesh multi-computers network. Int J Eng Adv Technol 2(5):517\u2013523","journal-title":"Int J Eng Adv Technol"},{"key":"2031_CR20","unstructured":"Al-Lami ZM (2011) Communication impact on non-contiguous allocation strategies for 2-D mesh multicomputer systems. Master Thesis, Middle East University, Amman"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-017-2031-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2031-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2031-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T10:36:56Z","timestamp":1502793416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-017-2031-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,5]]},"references-count":20,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["2031"],"URL":"https:\/\/doi.org\/10.1007\/s11227-017-2031-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,5]]}}}