{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:21:22Z","timestamp":1753438882136,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319969824"},{"type":"electronic","value":"9783319969831"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96983-1_15","type":"book-chapter","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T15:50:06Z","timestamp":1533052206000},"page":"205-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Interference-Aware Scheduling Using Geometric Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6728-2132","authenticated-orcid":false,"given":"Rapha\u00ebl","family":"Bleuse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Dogeas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7368-355X","authenticated-orcid":false,"given":"Giorgio","family":"Lucarelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6757-7432","authenticated-orcid":false,"given":"Gr\u00e9gory","family":"Mouni\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2623-6922","authenticated-orcid":false,"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Bhatele, A., Mohror, K., Langer, S.H., Isaacs, K.E.: There goes the neighborhood: performance degradation due to nearby jobs. In: SC, pp. 41:1\u201341:12. ACM, November 2013","DOI":"10.1145\/2503210.2503247"},{"issue":"5","key":"15_CR2","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10951-015-0427-z","volume":"18","author":"I B\u0142\u0105dek","year":"2015","unstructured":"B\u0142\u0105dek, I., Drozdowski, M., Guinand, F., Schepler, X.: On contiguous and non-contiguous parallel task scheduling. J. Sched. 18(5), 487\u2013495 (2015)","journal-title":"J. Sched."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Chen, N.-C., Poon, S.S., Ramakrishnan, L., Aragon, C.R.: Considering time in designing large-scale systems for scientific computing. In: CSCW, pp. 1533\u20131545. ACM, February 2016","DOI":"10.1145\/2818048.2819988"},{"issue":"8","key":"15_CR4","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.1109\/TPDS.2015.2485980","volume":"27","author":"M Dorier","year":"2016","unstructured":"Dorier, M., Ibrahim, S., Antoniu, G., Ross, R.B.: Using formal grammars to predict I\/O behaviors in HPC: the Omnisc\u2019IO approach. IEEE Trans. Parallel Distrib. Syst. 27(8), 2435\u20132449 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"15_CR5","unstructured":"Enos, J., et al.: Topology-aware job scheduling strategies for torus networks. In: Cray User Group, May 2014"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-63574-2_14","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"DG Feitelson","year":"1997","unstructured":"Feitelson, D.G., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., Wong, P.: Theory and practice in parallel job scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1997. LNCS, vol. 1291, pp. 1\u201334. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63574-2_14"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Gainaru, A., Aupy, G., Benoit, A., Cappello, F., Robert, Y., Snir, M.: Scheduling the I\/O of HPC applications under congestion. In: IPDPS, pp. 1013\u20131022. IEEE, May 2015","DOI":"10.1109\/IPDPS.2015.116"},{"key":"15_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Georgiou, Y., Jeannot, E., Mercier, G. Villiermet, A.: Topology-aware resource management for HPC applications. In: ICDCN, pp. 17:1\u201317:10. ACM (2017)","DOI":"10.1145\/3007748.3007768"},{"key":"15_CR10","unstructured":"Gergov, J.: Algorithms for compile-time memory optimization. In: SODA, pp. 907\u2013908. ACM\/SIAM, January 1999"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34(1), 144\u2013162 (1987)","journal-title":"J. ACM"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Kathareios, G., Minkenberg, C., Prisacari, B., Rodr\u00edguez, G., Hoefler, T.: Cost-effective diameter-two topologies: analysis and evaluation. In: SC, pp. 36:1\u201336:11. ACM, November 2015","DOI":"10.1145\/2807591.2807652"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Kenyon, C., R\u00e9mila, E.: Approximate strip packing. In: FOCS, pp. 31\u201336 (1996)","DOI":"10.1109\/SFCS.1996.548461"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Lucarelli, G., Mendon\u00e7a, F.M., Trystram, D., Wagner, F.: Contiguity and locality in backfilling scheduling. In: CCGRID, pp. 586\u2013595. IEEE Computer Society, May 2015","DOI":"10.1109\/CCGrid.2015.143"},{"issue":"5","key":"15_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.parco.2014.04.006","volume":"40","author":"JA Pascual","year":"2014","unstructured":"Pascual, J.A., Miguel-Alonso, J., Antonio, L.J.: Application-aware metrics for partition selection in cube-shaped topologies. Parallel Comput. 40(5), 129\u2013139 (2014)","journal-title":"Parallel Comput."},{"key":"15_CR16","unstructured":"Strohmaier, E., Dongarra, J., Simon, H., Meuer, M.: TOP500 list, June 2018"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Tessier, F., Malakar, P., Vishwanath, V., Jeannot, E., Isaila, F.: Topology-aware data aggregation for intensive I\/O on large-scale supercomputers. In: COMHPC@SC, pp. 73\u201381. IEEE, November 2016","DOI":"10.1109\/COMHPC.2016.013"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Tuncer, O., Leung, V.J., Coskun, A.K.: PaCMap: topology mapping of unstructured communication patterns onto non-contiguous allocations. In: ICS, pp. 37\u201346. ACM, June 2015","DOI":"10.1145\/2751205.2751225"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2018: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96983-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T04:04:44Z","timestamp":1751774684000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96983-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319969824","9783319969831"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96983-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"1 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/europar2018.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}