{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:36:12Z","timestamp":1743125772295,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105488"},{"type":"electronic","value":"9783030105495"}],"license":[{"start":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T00:00:00Z","timestamp":1546214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T00:00:00Z","timestamp":1546214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10549-5_11","type":"book-chapter","created":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T00:03:31Z","timestamp":1546214611000},"page":"134-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Methodology for Handling Data Movements by Anticipation: Position Paper"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6728-2132","authenticated-orcid":false,"given":"Rapha\u00ebl","family":"Bleuse","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7368-355X","authenticated-orcid":false,"given":"Giorgio","family":"Lucarelli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2623-6922","authenticated-orcid":false,"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,31]]},"reference":[{"key":"11_CR1","unstructured":"TGCC Curie Supercomputer. http:\/\/www-hpc.cea.fr\/en\/complexe\/tgcc-curie.htm"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Agelastos, A., et al.: The lightweight distributed metric service: a scalable infrastructure for continuous monitoring of large scale computing systems and applications. In: SC, pp. 154\u2013165. IEEE, November 2014","DOI":"10.1109\/SC.2014.18"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Albing, C.: Characterizing node orderings for improved performance. In: PMBS@SC, pp. 6:1\u20136:11. ACM (2015)","DOI":"10.1145\/2832087.2832094"},{"key":"11_CR4","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"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Billaut, J.C., Moukrim, A., Sanlaville, \u00c9.: Flexibility and Robustness in Scheduling. Control Systems, Robotics and Manufacturing, Wiley (2008)","DOI":"10.1002\/9780470611432"},{"issue":"5","key":"11_CR6","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":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-319-96983-1_15","volume-title":"Euro-Par 2018: Parallel Processing","author":"R Bleuse","year":"2018","unstructured":"Bleuse, R., Dogeas, K., Lucarelli, G., Mouni\u00e9, G., Trystram, D.: Interference-aware scheduling using geometric constraints. In: Aldinucci, M., Padovani, L., Torquati, M. (eds.) Euro-Par 2018. LNCS, vol. 11014, pp. 205\u2013217. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96983-1_15"},{"issue":"8","key":"11_CR8","doi-asserted-by":"publisher","first-page":"2457","DOI":"10.1002\/cpe.3606","volume":"28","author":"FZ Boito","year":"2016","unstructured":"Boito, F.Z., Kassick, R.V., Navaux, P.O.A., Denneulin, Y.: Automatic I\/O scheduling algorithm selection for parallel file systems. Concurr. Comput. Pract. Exp. 28(8), 2457\u20132472 (2016)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"11_CR9","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer, New York (2007)","edition":"5"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2027066.2027068","volume":"7","author":"Philip Carns","year":"2011","unstructured":"Carns, P.H., Harms, K., Allcock, W.E., Bacon, C., Lang, S., Latham, R., Ross, R.B.: Understanding and improving computational science storage access through continuous characterization. ACM Trans. Storage 7(3), 8:1\u20138:26 (2011)","journal-title":"ACM Transactions on Storage"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Chen, N., 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"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Deveci, M., et al.: Exploiting geometric partitioning in task mapping for parallel computers. In: IPDPS, pp. 27\u201336. IEEE, May 2014","DOI":"10.1109\/IPDPS.2014.15"},{"issue":"8","key":"11_CR13","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":"11_CR14","series-title":"Computer Communications and Networks","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-310-5","volume-title":"Scheduling for Parallel Processing","author":"M Drozdowski","year":"2009","unstructured":"Drozdowski, M.: Scheduling for Parallel Processing. Computer Communications and Networks. Springer, London (2009). https:\/\/doi.org\/10.1007\/978-1-84882-310-5"},{"key":"11_CR15","unstructured":"Enos, J., et al.: Topology-aware job scheduling strategies for torus networks. In: Cray User Group, May 2014. https:\/\/cug.org\/proceedings\/cug2014_proceedings\/includes\/files\/pap182.pdf"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Evans, R.T., Browne, J.C., Barth, W.L.: Understanding application and system performance through system-wide monitoring. In: IPDPS Workshops, pp. 1702\u20131710. IEEE, May 2016","DOI":"10.1109\/IPDPSW.2016.145"},{"key":"11_CR17","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":"11_CR18","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":"11_CR19","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"},{"issue":"3","key":"11_CR20","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF01199431","volume":"38","author":"D Hilbert","year":"1891","unstructured":"Hilbert, D.: Ueber die stetige Abbildung einer Line auf ein Fl\u00e4chenst\u00fcck. Math. Ann. 38(3), 459\u2013460 (1891)","journal-title":"Math. Ann."},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Isaila, F., Carretero, J., Ross, R.B.: CLARISSE: a middleware for data-staging coordination and control on large-scale HPC platforms. In: CCGrid, pp. 346\u2013355. IEEE, May 2016","DOI":"10.1109\/CCGrid.2016.24"},{"key":"11_CR22","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":"11_CR23","doi-asserted-by":"crossref","unstructured":"Lucarelli, G., Machado Mendon\u00e7a, F., 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"},{"key":"11_CR24","unstructured":"Morton, G.M.: A computer Oriented Geodetic Data Base; and a New Technique in File Sequencing. Technical report, IBM Ltd., March 1966. https:\/\/domino.research.ibm.com\/library\/cyberdig.nsf\/0\/0dabf9473b9c86d48525779800566a39"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-319-43659-3_29","volume-title":"Euro-Par 2016: Parallel Processing","author":"Y Ngoko","year":"2016","unstructured":"Ngoko, Y.: Heating as a cloud-service, a position paper (industrial presentation). In: Dutot, P.-F., Trystram, D. (eds.) Euro-Par 2016. LNCS, vol. 9833, pp. 389\u2013401. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43659-3_29"},{"issue":"5","key":"11_CR26","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":"11_CR27","unstructured":"Strohmaier, E., Dongarra, J., Simon, H., Meuer, M.: TOP500 list. https:\/\/www.top500.org\/lists\/"},{"key":"11_CR28","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 (Nov 2016)","DOI":"10.1109\/COMHPC.2016.013"},{"key":"11_CR29","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 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10549-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T08:36:51Z","timestamp":1672562211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10549-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,31]]},"ISBN":["9783030105488","9783030105495"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10549-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,31]]},"assertion":[{"value":"31 December 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"}]}}