{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:47:29Z","timestamp":1781110049025,"version":"3.54.1"},"reference-count":34,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,4]]},"abstract":"<jats:p>\u201cPartitionable parallel machine\u201d is an efficient computing system for executing parallel applications. In this paper, the problem of processors sharing among multiple users is addressed where users' requests are executed in a 2D mesh-connected multicomputer simultaneously. The problem is formulated as an oligopoly market where users compete to rent free processors. The system consists of self-interested users with different needs and utility functions. Each user engages in an auction with others to achieve their needs of processors. The most significant challenge for the users is how to select the optimal number of requested processors for winning the auction. A noncooperative game is used to obtain the optimal processors allocation for users. Game theory is employed to address this challenge for competing users. Nash equilibrium is considered as the solution of this game. The numerical results reveal the dynamics of distributed dynamic adaptation of processors sharing strategies.<\/jats:p>","DOI":"10.4018\/ijghpc.2017040104","type":"journal-article","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T10:22:47Z","timestamp":1495534967000},"page":"53-69","source":"Crossref","is-referenced-by-count":0,"title":["Competitive Processors Allocation in 2D Mesh Connected Multicomputer Networks"],"prefix":"10.4018","volume":"9","author":[{"given":"Ayoub","family":"Alsarhan","sequence":"first","affiliation":[{"name":"Faculty of Prince Al-Hussein bin Abdullah II for Information Technology, Hashemite University, Zarqa, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emad Eddien Awad","family":"Abdallah","sequence":"additional","affiliation":[{"name":"Hashemite University, Zarqa, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashraf H.","family":"Aljammal","sequence":"additional","affiliation":[{"name":"Hashemite University, Zarqa, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJGHPC.2017040104-0","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2008.10.001"},{"key":"IJGHPC.2017040104-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2010.08.007"},{"key":"IJGHPC.2017040104-2","doi-asserted-by":"publisher","DOI":"10.1080\/17445760903546188"},{"key":"IJGHPC.2017040104-3","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2015.1057589"},{"key":"IJGHPC.2017040104-4","doi-asserted-by":"publisher","DOI":"10.1504\/IJAIP.2014.065218"},{"key":"IJGHPC.2017040104-5","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cdt.2011.0065"},{"key":"IJGHPC.2017040104-6","doi-asserted-by":"crossref","unstructured":"Bani-Ahmad, S. (2011). Bounded Gradual-Request-Partitioning-Based Allocation Strategies in 2D-Mesh Multicomputers. International Journal of Digital Content Technology and its Applications, 5(1), 42-56.","DOI":"10.4156\/jdcta.vol5.issue1.6"},{"key":"IJGHPC.2017040104-7","doi-asserted-by":"publisher","DOI":"10.5120\/3113-4275"},{"key":"IJGHPC.2017040104-8","doi-asserted-by":"publisher","DOI":"10.3923\/jas.2011.943.952"},{"key":"IJGHPC.2017040104-9","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1459"},{"key":"IJGHPC.2017040104-10","doi-asserted-by":"publisher","DOI":"10.1109\/71.770192"},{"key":"IJGHPC.2017040104-11","doi-asserted-by":"publisher","DOI":"10.1109\/71.265948"},{"key":"IJGHPC.2017040104-12","doi-asserted-by":"publisher","DOI":"10.1109\/71.265948"},{"key":"IJGHPC.2017040104-13","doi-asserted-by":"publisher","DOI":"10.4018\/IJGHPC.2016010101"},{"key":"IJGHPC.2017040104-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2004.05.007"},{"key":"IJGHPC.2017040104-15","author":"G.Herbert","year":"2009","journal-title":"Game Theory Evolving: A Problem-Centered Introduction to Modeling Strategic Interaction"},{"key":"IJGHPC.2017040104-16","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-010-0463-6"},{"key":"IJGHPC.2017040104-17","doi-asserted-by":"publisher","DOI":"10.4018\/jghpc.2009010102"},{"key":"IJGHPC.2017040104-18","doi-asserted-by":"publisher","DOI":"10.1109\/71.282559"},{"key":"IJGHPC.2017040104-19","author":"V.Kumar","year":"2003","journal-title":"Introduction To Parallel Computing"},{"key":"IJGHPC.2017040104-20","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(91)90032-5"},{"key":"IJGHPC.2017040104-21","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIS.2010.032938"},{"key":"IJGHPC.2017040104-22","doi-asserted-by":"publisher","DOI":"10.1109\/71.598346"},{"key":"IJGHPC.2017040104-23","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIS.2010.034007"},{"key":"IJGHPC.2017040104-24","first-page":"123","article-title":"Effects of Allocation Request Shape Changes on Performance in 2D Mesh-Connected Multicomputers","author":"W.Mardini","year":"2010","journal-title":"Proceedings of CIT"},{"key":"IJGHPC.2017040104-25","year":"1997","journal-title":"3 User\u2019s Manual"},{"key":"IJGHPC.2017040104-26","doi-asserted-by":"publisher","DOI":"10.4018\/IJGHPC.2014100103"},{"key":"IJGHPC.2017040104-27","doi-asserted-by":"publisher","DOI":"10.4018\/IJGHPC.2015040101"},{"key":"IJGHPC.2017040104-28","unstructured":"Srinivasan, T., Seshadri, J., Chandrasekhar, A., & Jonathan, J. (2004). A Minimal Fragmentation Algorithm for Task Allocation in Mesh-Connected Multicomputers. Proceedings of the AISTA, Luxembourg (pp. 15-18)."},{"key":"IJGHPC.2017040104-29","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIS.2013.052449"},{"key":"IJGHPC.2017040104-30","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1189585"},{"issue":"1","key":"IJGHPC.2017040104-31","first-page":"46","article-title":"A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers","volume":"51","author":"B.-S.Yoo","year":"2002","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"IJGHPC.2017040104-32","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.585"},{"key":"IJGHPC.2017040104-33","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90016-G"}],"container-title":["International Journal of Grid and High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=182341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T02:01:32Z","timestamp":1651802492000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJGHPC.2017040104"}},"subtitle":["A Dynamic Game Approach"],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":34,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.4018\/ijghpc.2017040104","relation":{},"ISSN":["1938-0259","1938-0267"],"issn-type":[{"value":"1938-0259","type":"print"},{"value":"1938-0267","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}