{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T22:43:43Z","timestamp":1777675423597,"version":"3.51.4"},"reference-count":30,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2017,9,22]],"date-time":"2017-09-22T00:00:00Z","timestamp":1506038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>A Resource and Job Management System (RJMS) is a crucial system software part of the HPC stack. It is responsible for efficiently delivering computing power to applications in supercomputing environments. Its main intelligence relies on resource selection techniques to find the most adapted resources to schedule the users\u2019 jobs. This article introduces a new method that takes into account the topology of the machine and the application characteristics to determine the best choice among the available nodes of the platform, based upon the network topology and taking into account the application communication pattern. To validate our approach, we integrate this algorithm as a plugin for Simple Linux Utility for Resource Management (SLURM), a well-known and widespread RJMS. We assess our plugin with different optimization schemes by comparing with the default topology-aware Slurm algorithm, using both emulation and simulation of a large-scale platform and by carrying out experiments in a real cluster. We show that transparently taking into account a job communication pattern and the topology allows for relevant performance gains.<\/jats:p>","DOI":"10.1177\/1094342017727061","type":"journal-article","created":{"date-parts":[[2017,9,22]],"date-time":"2017-09-22T05:19:29Z","timestamp":1506057569000},"page":"14-27","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":15,"title":["Topology-aware job mapping"],"prefix":"10.1177","volume":"32","author":[{"given":"Yiannis","family":"Georgiou","sequence":"first","affiliation":[{"name":"ATOS\/Bull, Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Jeannot","sequence":"additional","affiliation":[{"name":"Inria, LaBRI, University of Bordeaux, CNRS, Bordeaux-INP, Talence, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Mercier","sequence":"additional","affiliation":[{"name":"Bordeaux-INP, Inria, LaBRI, University of Bordeaux, CNRS, Talence, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ad\u00e8le","family":"Villiermet","sequence":"additional","affiliation":[{"name":"Inria, LaBRI, University of Bordeaux, CNRS, Bordeaux-INP, Talence, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2017,9,22]]},"reference":[{"key":"bibr2-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24449-0_9"},{"key":"bibr3-1094342017727061","first-page":"37","volume-title":"JSSPP Job Scheduling Strategies for Parallel Processing 2007","author":"Balle SM","year":"2007"},{"key":"bibr4-1094342017727061","doi-asserted-by":"crossref","unstructured":"Barrett RF, Vaughan CT, Heroux MA (2011) Minighost: A Miniapp for exploring boundary exchange strategies using stencil computations in scientific parallel computing. In: Sandia National Laboratories, Tech. Rep. SAND2011-5294832.","DOI":"10.2172\/1039405"},{"key":"bibr5-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1145\/1594835.1504225"},{"key":"bibr6-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64203-1_4"},{"key":"bibr7-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2010.67"},{"key":"bibr8-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2005.1558641"},{"key":"bibr9-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2015.25"},{"key":"bibr10-1094342017727061","unstructured":"Fujitsu. Interconnect topology-aware resource assignment. Available at: www.fujitsu.com\/global\/Images\/technical-computing-suite-bp-sc12.pdf."},{"key":"bibr11-1094342017727061","first-page":"134","volume-title":"Job Scheduling Strategies for Parallel Processing: 16th International Workshop, JSSPP 2012","author":"Georgiou Y","year":"2012"},{"key":"bibr12-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1145\/1995896.1995909"},{"key":"bibr13-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15291-7_20"},{"key":"bibr14-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.104"},{"key":"bibr15-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1145\/1925861.1925881"},{"key":"bibr16-1094342017727061","first-page":"63","volume-title":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","author":"Liu C","year":"2002"},{"key":"bibr17-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03770-2_17"},{"key":"bibr18-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24449-0_7"},{"key":"bibr19-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2009.12.004"},{"key":"bibr20-1094342017727061","unstructured":"Oracle Grid engine. Available at: www.univa.com\/oracle."},{"key":"bibr21-1094342017727061","unstructured":"PBSWorks. Available at: www.pbsworks.com."},{"key":"bibr22-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1109\/HPDC.1998.709966"},{"key":"bibr23-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24449-0_8"},{"key":"bibr24-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30184-4_9"},{"key":"bibr25-1094342017727061","volume-title":"Proceedings of the Cray User Group Meeting","author":"Smith C","year":"2001"},{"key":"bibr26-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1109\/E-SCIENCE.2006.261163"},{"key":"bibr31-1094342017727061","unstructured":"Torque resource manager. Available at: http:\/\/docs.adaptivecomputing.com\/torque\/6-0-0\/Content\/topics\/torque\/2-jobs\/monitoringJobs.htm."},{"key":"bibr27-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-014-1324-5"},{"key":"bibr28-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2014.6968751"},{"key":"bibr29-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1007\/10968987_3"},{"key":"bibr30-1094342017727061","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2006.63"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342017727061","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1094342017727061","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342017727061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:15:31Z","timestamp":1777450531000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342017727061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,22]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1177\/1094342017727061"],"URL":"https:\/\/doi.org\/10.1177\/1094342017727061","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,22]]}}}