{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:23:19Z","timestamp":1742988199145,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953874"},{"type":"electronic","value":"9783030953881"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-95388-1_9","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"123-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Case for Disjoint Job Mapping on High-Radix Networked Parallel Computers"],"prefix":"10.1007","author":[{"given":"Yao","family":"Hu","sequence":"first","affiliation":[]},{"given":"Michihiro","family":"Koibuchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"unstructured":"Top 500 Supercomputer Sites. http:\/\/www.top500.org\/","key":"9_CR1"},{"doi-asserted-by":"crossref","unstructured":"Krevat, E., Casta\u00f1os, J., Moreira, J.: Job scheduling for the bluegene\/l system, pp. 38\u201354, November 2002","key":"9_CR2","DOI":"10.1007\/3-540-36180-4_3"},{"unstructured":"Sensi, D.D., Girolamo, S.D., McMahon, K.H., Roweth, D., Hoefler, T.: An in-depth analysis of the slingshot interconnect (2020)","key":"9_CR3"},{"doi-asserted-by":"crossref","unstructured":"Hu, Y.: Topology mapping of parallel applications onto random allocations. In: The 21st International Conferences on High Performance Computing and Communications (HPCC-2019), pp. 1437\u20131444. China, Zhangjiajie, August 2019","key":"9_CR4","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00199"},{"doi-asserted-by":"crossref","unstructured":"Fathololoumi, S., et al.: 1.6tbps silicon photonics integrated circuit for co-packaged optical-io switch applications. In: Optical Fiber Communication Conference (OFC) 2020. Optical Society of America, 2020, p. T3H.1. http:\/\/www.osapublishing.org\/abstract.cfm?URI=OFC-2020-T3H.1","key":"9_CR5","DOI":"10.1364\/OFC.2020.T3H.1"},{"doi-asserted-by":"crossref","unstructured":"Minkenberg, C., Krishnaswamy, R., Zilkie, A., Nelson, D.: Co-packaged datacenter optics: opportunities and challenges. IET Optoelectronics 15(2), 77\u201391 (2021). https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/abs\/10.1049\/ote2.12020","key":"9_CR6","DOI":"10.1049\/ote2.12020"},{"doi-asserted-by":"crossref","unstructured":"Maniotis, P., Schares, L., Lee, B.G., Taubenblatt, M.A., Kuchta, D.M.: Scaling hpc networks with co-packaged optics. In: Optical Fiber Communication Conference (OFC) 2020. Optical Society of America, 2020, p. T3K.7. http:\/\/www.osapublishing.org\/abstract.cfm?URI=OFC-2020-T3K.7","key":"9_CR7","DOI":"10.1364\/OFC.2020.T3K.7"},{"issue":"10","key":"9_CR8","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"34","author":"CE Leiserson","year":"1985","unstructured":"Leiserson, C.E.: Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans. Comput. 34(10), 892\u2013901 (1985)","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"crossref","unstructured":"Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. In: Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication, pp. 63\u201374 (2008)","key":"9_CR9","DOI":"10.1145\/1402946.1402967"},{"doi-asserted-by":"crossref","unstructured":"Yasudo, R., Nakano, K., Koibuchi, M., Matsutani, H., Amano, H.: Designing low-diameter interconnection networks with multi-ported host-switch graphs. Concurrency Computation Practice and Experience (2020)","key":"9_CR10","DOI":"10.1002\/cpe.6115"},{"doi-asserted-by":"crossref","unstructured":"Kim, J., Dally, W.J., Scott, S., Abts, D.: Technology-driven, highly-scalable dragonfly topology. In: Proceedings of the International Symposium on Computer Architecture (ISCA), pp. 77\u201388 (2008)","key":"9_CR11","DOI":"10.1145\/1394608.1382129"},{"doi-asserted-by":"crossref","unstructured":"Agarwal, T., Sharma, A., Laxmikant, A., Kale, L.V.: Topology-aware task mapping for reducing communication contention on large parallel machines. In: Proceedings 20th IEEE International Parallel Distributed Processing Symposium, p. 10, April 2006","key":"9_CR12","DOI":"10.1109\/IPDPS.2006.1639379"},{"doi-asserted-by":"crossref","unstructured":"Leung, V.J. et al.: Processor allocation on cplant: achieving general processor locality using one-dimensional allocation strategies. In: Proceedings of the IEEE International Conference on Cluster Computing, pp. 296\u2013304 (2002)","key":"9_CR13","DOI":"10.2172\/800975"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-24449-0_9","volume-title":"Recent Advances in the Message Passing Interface","author":"C Albing","year":"2011","unstructured":"Albing, C., Troullier, N., Whalen, S., Olson, R., Glenski, J., Pritchard, H., Mills, H.: Scalable node allocation for improved performance in regular and anisotropic 3D torus supercomputers. In: Cotronis, Y., Danalis, A., Nikolopoulos, D.S., Dongarra, J. (eds.) EuroMPI 2011. LNCS, vol. 6960, pp. 61\u201370. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24449-0_9"},{"doi-asserted-by":"crossref","unstructured":"Albing, C.: Characterizing node orderings for improved performance. In: Proceedings of the 6th International Workshop on Performance Modeling, Benchmarking, and Simulation of High Performance Computing Systems, pp. 1\u201311, November 2015","key":"9_CR15","DOI":"10.1145\/2832087.2832094"},{"doi-asserted-by":"crossref","unstructured":"Lo, V., Windisch, K.J., Liu, W., Nitzberg, B.: Noncontiguous processor allocation algorithms for mesh-connected multicomputers. IEEE Trans. Parallel Distrib. Syst. 8(7), 712\u2013726 (1997)","key":"9_CR16","DOI":"10.1109\/71.598346"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/11534273_16","volume-title":"Algorithms and Data Structures","author":"MA Bender","year":"2005","unstructured":"Bender, M.A., Bunde, D.P., Demaine, E.D., Fekete, S.P., Leung, V.J., Meijer, H., Phillips, C.A.: Communication-aware processor allocation for supercomputers. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 169\u2013181. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11534273_16"},{"doi-asserted-by":"crossref","unstructured":"Yu, H., Chung, I., Moreira, J.: Topology mapping for blue gene\/l supercomputer. In: SC \u201906: Proceedings of the 2006 ACM\/IEEE Conference on Supercomputing, pp. 52\u201352 (2006)","key":"9_CR18","DOI":"10.1145\/1188455.1188576"},{"doi-asserted-by":"crossref","unstructured":"Bhatele, A., Kal\u00e9, L.V.: Application-specific topology-aware mapping for three dimensional topologies. In: 2008 IEEE International Symposium on Parallel and Distributed Processing, pp. 1\u20138 (2008)","key":"9_CR19","DOI":"10.1109\/IPDPS.2008.4536348"},{"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: Proceedings of the 29th ACM on International Conference on Supercomputing, pp. 37\u201346 (2015)","key":"9_CR20","DOI":"10.1145\/2751205.2751225"},{"unstructured":"The sierra advanced technology system (2017).http:\/\/computation.llnl.gov\/computers\/sierra-advanced-technology-system","key":"9_CR21"},{"unstructured":"Summit (olcf) (2017).http:\/\/www.olcf.ornl.gov\/summit","key":"9_CR22"},{"doi-asserted-by":"crossref","unstructured":"Michelogiannakis, G., Ibrahim, K.Z., Shalf, J., Wilke, J.J., Knight, S., Kenny, J.P.: Aphid: hierarchical task placement to enable a tapered fat tree topology for lower power and cost in hpc networks. In: 17th IEEE\/ACM International Symposium on Cluster. Cloud and Grid Computing (CCGRID) 2017, pp. 228\u2013237 (2017)","key":"9_CR23","DOI":"10.1109\/CCGRID.2017.33"},{"doi-asserted-by":"crossref","unstructured":"Jain, N., et al.: Predicting the performance impact of different fat-tree configurations, pp. 1\u201313, November 2017","key":"9_CR24","DOI":"10.1145\/3126908.3126967"},{"doi-asserted-by":"crossref","unstructured":"Zahavi, E.: Fat-trees routing and node ordering providing contention free traffic for mpi global collectives. In: IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum 2011, pp. 761\u2013770 (2011)","key":"9_CR25","DOI":"10.1109\/IPDPS.2011.219"},{"doi-asserted-by":"crossref","unstructured":"Jain, N., Bhatele, A., Ni, X., Gamblin, T., Kale, L.V.: Partitioning low-diameter networks to eliminate inter-job interference. In. IEEE International Parallel and Distributed Processing Symposium (IPDPS) 2017, pp. 439\u2013448 (2017)","key":"9_CR26","DOI":"10.1109\/IPDPS.2017.91"},{"doi-asserted-by":"crossref","unstructured":"Pollard, S.D., Jain, N., Herbein, S., Bhatele, A.: Evaluation of an interference-free node allocation policy on fat-tree clusters. In: SC18: International Conference for High Performance Computing, pp. 333\u2013345. Storage and Analysis, Networking (2018)","key":"9_CR27","DOI":"10.1109\/SC.2018.00029"},{"doi-asserted-by":"crossref","unstructured":"Domke, J., et al.: Hyperx topology: first at-scale implementation and comparison to the fat-tree, pp. 1\u201323, November 2019","key":"9_CR28","DOI":"10.1145\/3295500.3356140"},{"doi-asserted-by":"crossref","unstructured":"Prisacari, B., Rodriguez, G., Heidelberger, P., Chen, D., Minkenberg, C., Hoefler, T.: Efficient task placement and routing of nearest neighbor exchanges in dragonfly networks. In: HPDC 2014 - Proceedings of the 23rd International Symposium on High-Performance Parallel and Distributed Computing, June 2014","key":"9_CR29","DOI":"10.1145\/2600212.2600225"},{"unstructured":"Budiardja, R., Crosby, L., You, H.: Effect of rank placement on cray xc 30 communication cost. In: The Cray User Group Meeting (2013)","key":"9_CR30"},{"unstructured":"Tuncer, O., Zhang, Y., Leung, V., Coskun, A.: Task mapping on a dragonfly supercomputer. In: IEEE High Performance Extreme Computing Conference (HPEC) (2017)","key":"9_CR31"},{"doi-asserted-by":"crossref","unstructured":"Jain, N., Bhatele, A., White, S., Gamblin, T., Kale, L.V.: Evaluating hpc networks via simulation of parallel workloads. In: SC \u201916: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 154\u2013165 (2016)","key":"9_CR32","DOI":"10.1109\/SC.2016.13"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-60153-8_35","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"DA Lifka","year":"1995","unstructured":"Lifka, D.A.: The ANL\/IBM SP scheduling system. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1995. LNCS, vol. 949, pp. 295\u2013303. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60153-8_35"},{"doi-asserted-by":"crossref","unstructured":"Skovira, J., Chan, W., Zhou, H., Lifka, D.: The easy - loadleveler api project. In: Workshop on Job Scheduling Strategies for Parallel Processing, pp. 41\u201347 (1996)","key":"9_CR34","DOI":"10.1007\/BFb0022286"},{"key":"9_CR35","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"AW Mu\u2019alem","year":"2001","unstructured":"Mu\u2019alem, A.W., Feitelson, D.G.: Utilization, predictability, workloads, and user runtime estimates in scheduling the ibm sp2 with backfilling. IEEE Trans. Parallel Distrib. Comput. 12, 529\u2013543 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Comput."},{"unstructured":"Parallel workloads archive. http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/","key":"9_CR36"},{"doi-asserted-by":"crossref","unstructured":"Dror G. Feitelsona, D.K., Tsafrirb, D.: Experience with using the Parallel Workloads Archive. J. Parallel Distrib. Comput. 74(10), 2967\u20132982 (2014)","key":"9_CR37","DOI":"10.1016\/j.jpdc.2014.06.013"},{"doi-asserted-by":"crossref","unstructured":"Casanova, H., Giersch, A., Legrand, A., Quinson, M., Suter, F.: Versatile, scalable, and accurate simulation of distributed applications and platforms. J. Parallel Distrib. Comput. 74(10), 2899\u20132917 (2014). http:\/\/hal.inria.fr\/hal-01017319","key":"9_CR38","DOI":"10.1016\/j.jpdc.2014.06.008"},{"unstructured":"The NAS Parallel Benchmarks. http:\/\/www.nas.nasa.gov\/Software\/NPB\/","key":"9_CR39"},{"unstructured":"Bailey, D., et al.: The NAS parallel benchmarks (1994). https:\/\/www.nas.nasa.gov\/assets\/pdf\/techreports\/1994\/rnr-94-007.pdf","key":"9_CR40"},{"doi-asserted-by":"crossref","unstructured":"Feitelson, D.G.: Workload Modeling for Computer Systems Performance Evaluation. Cambridge University Press, Cambridge (2015)","key":"9_CR41","DOI":"10.1017\/CBO9781139939690"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95388-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:29:00Z","timestamp":1645518540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95388-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953874","9783030953881"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95388-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"403","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.12","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}