{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T21:12:07Z","timestamp":1779311527772,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,2,12]],"date-time":"2011-02-12T00:00:00Z","timestamp":1297468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,2,12]]},"DOI":"10.1145\/1947940.1947984","type":"proceedings-article","created":{"date-parts":[[2011,3,4]],"date-time":"2011-03-04T08:14:52Z","timestamp":1299226492000},"page":"204-209","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["On improved processor allocation in 2D mesh-based multicomputers"],"prefix":"10.1145","author":[{"given":"Sulieman","family":"Bani-Ahmad","sequence":"first","affiliation":[{"name":"Al-Balqa Applied University, Salt, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,2,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2006.01.019"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1956846.1957250"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of ADVCOMP 2010","author":"Bani-Ahmad S.","year":"2010","unstructured":"Bani-Ahmad, S. (2010b), \"Submesh Allocation in 2D-Mesh Multicomputer: Partitioning at the Longest Dimension of Requests\". Proceedings of ADVCOMP 2010. October 25--30, 2010, Florence, Italy."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2006.68"},{"key":"e_1_3_2_1_5_1","unstructured":"Bani-Mohammad S.; Ould-Khaoua M.; Ababneh I.; and Machenzie L. (2007) \"A Fast and Efficient Processor Allocation Strategy which Combines a Contiguous and Noncontiguous Processor Allocation Algorithms\" Technical Report; TR-2007-229 Technical Report Series Department of CS Univ. of Glasgow January 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1459"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.770192"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1993.39"},{"key":"e_1_3_2_1_9_1","first-page":"61","volume-title":"Proc. IPCCC 95","author":"Ababneh I.","year":"1995","unstructured":"Ababneh, I. and Davis, J. (1995), \"Program-based static allocation policies for highly parallel computers\", Proc. IPCCC 95, IEEE Computer Society Press, Scottsdale, AZ, USA, 28--31 Mar 1995, pp. 61--68."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.282559"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/600009"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(91)90032-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646422.691809"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. Int. Conf. Parallel Process. II (Aug.","author":"Liu T.","year":"1995","unstructured":"Liu, T.; W. Huang, K.; Lombardi, F. and Bhuyan, L. N. (1995), A submesh allocation scheme for mesh-connected multiprocessor systems, Proc. Int. Conf. Parallel Process. II (Aug. 1995), 159163."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.598346"},{"key":"e_1_3_2_1_16_1","first-page":"262267","volume-title":"Conf. on Parallel and Distributed Computing Systems,\" (Sept.","author":"Min D.","year":"1995","unstructured":"Min, D. and Mutka, M. W. (1995), Effect of job interactions due to scattered processor allocations in 2-D wormhole networks, in \"Proc. of Int. Conf. on Parallel and Distributed Computing Systems,\" (Sept. 1995), pp. 262267."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/645606.757925"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.191995"},{"key":"e_1_3_2_1_19_1","volume-title":"University of Oregon","author":"ProcSimity","year":"1997","unstructured":"ProcSimity V4.3 User's Manual, University of Oregon, 1997."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.265948"}],"event":{"name":"ICCCS '11: International Conference on Communication, Computing & Security","location":"Rourkela Odisha India","acronym":"ICCCS '11"},"container-title":["Proceedings of the 2011 International Conference on Communication, Computing & Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1947940.1947984","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1947940.1947984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T20:31:08Z","timestamp":1779309068000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1947940.1947984"}},"subtitle":["controlled splitting of parallel requests"],"short-title":[],"issued":{"date-parts":[[2011,2,12]]},"references-count":20,"alternative-id":["10.1145\/1947940.1947984","10.1145\/1947940"],"URL":"https:\/\/doi.org\/10.1145\/1947940.1947984","relation":{},"subject":[],"published":{"date-parts":[[2011,2,12]]},"assertion":[{"value":"2011-02-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}