{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:43:47Z","timestamp":1740141827192,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2020,12,1]]},"DOI":"10.1587\/transinf.2020pap0006","type":"journal-article","created":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T22:20:01Z","timestamp":1606774801000},"page":"2480-2493","source":"Crossref","is-referenced-by-count":1,"title":["Application Mapping and Scheduling of Uncertain Communication Patterns onto Non-Random and Random Network Topologies"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Yao","family":"HU","sequence":"first","affiliation":[{"name":"Information Systems Architecture Science Research Division, National Institute of Informatics"}]},{"given":"Michihiro","family":"KOIBUCHI","sequence":"additional","affiliation":[{"name":"Information Systems Architecture Science Research Division, National Institute of Informatics"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[2] O. Tuncer, V.J. Leung, and A.K. Coskun, \u201cPacmap: Topology mapping of unstructured communication patterns onto non-contiguous allocations,\u201d Proc. 29th ACM on International Conference on Supercomputing, pp.37-46, 2015. 10.1145\/2751205.2751225","DOI":"10.1145\/2751205.2751225"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[3] A. Bhatele and L.V. Kal\u00e9, \u201cApplication-specific topology-aware mapping for three dimensional topologies,\u201d 2008 IEEE International Symposium on Parallel and Distributed Processing, pp.1-8, 2008. 10.1109\/ipdps.2008.4536348","DOI":"10.1109\/IPDPS.2008.4536348"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[4] T. Hoefler and M. Snir, \u201cGeneric topology mapping strategies for large-scale parallel architectures,\u201d Proc. International Conference on Supercomputing, ser. ICS '11, pp.75-84, New York, NY, USA, ACM, 2011. [Online]. Available: http:\/\/doi.acm.org\/10.1145\/1995896.1995909 10.1145\/1995896.1995909","DOI":"10.1145\/1995896.1995909"},{"key":"4","unstructured":"[5] [Online]. Available: https:\/\/en.wikipedia.org\/wiki\/Cray_XT6"},{"key":"5","unstructured":"[6] [Online]. Available: https:\/\/ja.wikipedia.org\/wiki\/Blue_Gene"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[7] J. Galvez, N. Jain, and L. Kale, \u201cAutomatic topology mapping of diverse large-scale parallel applications,\u201d ICS 2017, ser. Proc. International Conference on Supercomputing, Association for Computing Machinery, June 2017. 10.1145\/3079079.3079104","DOI":"10.1145\/3079079.3079104"},{"key":"7","unstructured":"[8] A. Singla, C.-Y. Hong, L. Popa, and P.B. Godfrey, \u201cJellyfish: Networking Data Centers Randomly,\u201d Proc. USENIX Symposium on Network Design and Implementation (NSDI), pp.225-238, 2012."},{"key":"8","doi-asserted-by":"crossref","unstructured":"[9] M. Koibuchi, H. Matsutani, H. Amano, D.F. Hsu, and H. Casanova, \u201cA Case for Random Shortcut Topologies for HPC Interconnects,\u201d Proc. International Symposium on Computer Architecture (ISCA), pp.177-188, 2012. 10.1109\/isca.2012.6237016","DOI":"10.1145\/2366231.2337179"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[10] M. Koibuchi, I. Fujiwara, H. Matsutani, and H. Casanova, \u201cLayout-conscious random topologies for hpc off-chip interconnects,\u201d 19th International Conference on High-Performance Computer Architecture (HPCA), pp.484-495, Feb. 2013. 10.1109\/hpca.2013.6522343","DOI":"10.1109\/HPCA.2013.6522343"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[11] F. Chaix, I. Fujiwara, and M. Koibuchi, \u201cSuitability of the random topology for hpc applications,\u201d 2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP), pp.301-304, Feb. 2016. 10.1109\/pdp.2016.10","DOI":"10.1109\/PDP.2016.10"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[12] A. Bhatele, T. Gamblin, S.H. Langer, P. Bremer, E.W. Draeger, B. Hamann, K.E. Isaacs, A.G. Landge, J.A. Levine, V. Pascucci, M. Schulz, and C.H. Still, \u201cMapping applications with collectives over sub-communicators on torus networks,\u201d SC '12: Proc. International Conference on High Performance Computing, Networking, Storage and Analysis, pp.1-11, Nov. 2012. 10.1109\/sc.2012.75","DOI":"10.1109\/SC.2012.75"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[13] M. Deveci, S. Rajamanickam, V.J. Leung, K. Pedretti, S.L. Olivier, D.P. Bunde, U.V. \u00c7ataly\u00fcrek, and K. Devine, \u201cExploiting geometric partitioning in task mapping for parallel computers,\u201d 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pp.27-36, May 2014. 10.1109\/ipdps.2014.15","DOI":"10.1109\/IPDPS.2014.15"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[14] H. Subramoni, S. Potluri, K. Kandalla, B. Barth, J. Vienne, J. Keasler, K. Tomko, K. Schulz, A. Moody, and D.K. Panda, \u201cDesign of a scalable infiniband topology service to enable network-topology-aware placement of processes,\u201d SC '12: Proc. International Conference on High Performance Computing, Networking, Storage and Analysis, pp.1-12, Nov. 2012. 10.1109\/sc.2012.47","DOI":"10.1109\/SC.2012.47"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[15] A. Gupta, L.V. Kal\u00e9, D. Milojicic, P. Faraboschi, and S.M. Balle, \u201cHpc-aware vm placement in infrastructure clouds,\u201d 2013 IEEE International Conference on Cloud Engineering (IC2E), pp.11-20, March 2013. 10.1109\/ic2e.2013.38","DOI":"10.1109\/IC2E.2013.38"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[16] Y. Hu, \u201cTopology mapping of parallel applications onto random allocations,\u201d The 21st International Conferences on High Performance Computing and Communications (HPCC-2019), Zhangjiajie, China, pp.1437-1444, Aug. 2019. 10.1109\/hpcc\/smartcity\/dss.2019.00199","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00199"},{"key":"16","unstructured":"[17] The NAS Parallel Benchmarks, http:\/\/www.nas.nasa.gov\/Software\/NPB\/."},{"key":"17","doi-asserted-by":"crossref","unstructured":"[18] Y. Hu and M. Koibuchi, \u201cDiameter\/aspl-based mapping of applications with uncertain communication over random interconnection networks,\u201d Proc. IEEE International Conference on Parallel And Distributed Systems (ICPADS), ser. ICPADS '19, pp.249-258, Piscataway, NJ, USA, IEEE Press, Dec. 2019. 10.1109\/icpads47876.2019.00044","DOI":"10.1109\/ICPADS47876.2019.00044"},{"key":"18","unstructured":"[19] H. Cai, V.W. Zheng, and K.C. Chang, \u201cA comprehensive survey of graph embedding: Problems, techniques and applications,\u201d CoRR, vol.abs\/1709.07604, 2017. [Online]. Available: http:\/\/arxiv.org\/abs\/1709.07604"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[20] S.A. Smith, C.E. Cromey, D.K. Lowenthal, J. Domke, N. Jain, J.J. Thiagarajan, and A. Bhatele, \u201cMitigating inter-job interference using adaptive flow-aware routing,\u201d SC18: International Conference for High Performance Computing, Networking, Storage and Analysis, pp.346-360, Nov. 2018. 10.1109\/sc.2018.00030","DOI":"10.1109\/SC.2018.00030"},{"key":"20","unstructured":"[21] [Online]. Available: https:\/\/bluewaters.ncsa.illinois.edu\/torus-viewer"},{"key":"21","unstructured":"[22] G. Fox, V. Getov, L. Grandinetti, G. Joubert, and T. Sterling, New Frontiers in High Performance Computing and Big Data, Advances in Parallel Computing, vol.30, IOS Press, 2017."},{"key":"22","doi-asserted-by":"crossref","unstructured":"[23] M.J. Rashti, J. Green, P. Balaji, A. Afsahi, and W. Gropp, \u201cMulti-core and network aware mpi topology functions,\u201d Proc. 18th European MPI Users' Group Conference on Recent Advances in the Message Passing Interface, ser. EuroMPI'11, pp.50-60, Berlin, Heidelberg, Springer-Verlag, 2011. [Online]. Available: http:\/\/dl.acm.org\/citation.cfm?id=2042476.2042484","DOI":"10.1007\/978-3-642-24449-0_8"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[24] J. Wu, X. Xiong, and Z. Lan, \u201cHierarchical task mapping for parallel applications on supercomputers,\u201d J. Supercomput., vol.71, no.5, pp.1776-1802, May 2015. [Online]. Available: http:\/\/dx.doi.org\/10.1007\/s11227-014-1324-5 10.1007\/s11227-014-1324-5","DOI":"10.1007\/s11227-014-1324-5"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[25] X. Yang, Z. Zhou, W. Tang, X. Zheng, J. Wang, and Z. Lan, \u201cBalancing job performance with system performance via locality-aware scheduling on torus-connected systems,\u201d 2014 IEEE International Conference on Cluster Computing (CLUSTER), pp.140-148, Sept. 2014. 10.1109\/cluster.2014.6968751","DOI":"10.1109\/CLUSTER.2014.6968751"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[26] C. Albing, N. Troullier, S. Whalen, R. Olson, J. Glenski, H. Pritchard, and H. Mills, \u201cScalable node allocation for improved performance in regular and anisotropic 3d torus supercomputers,\u201d Recent Advances in the Message Passing Interface, Y. Cotronis, A. Danalis, D.S. Nikolopoulos, and J. Dongarra, Eds., pp.61-70, Berlin, Heidelberg, Springer Berlin Heidelberg, 2011. 10.1007\/978-3-642-24449-0_9","DOI":"10.1007\/978-3-642-24449-0_9"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[27] J.T. Vogelstein, J.M. Conroy, V. Lyzinski, L.J. Podrazik, S.G. Kratzer, E.T. Harley, D.E. Fishkind, R.J. Vogelstein, and C.E. Priebe, \u201cFast approximate quadratic programming for graph matching,\u201d PLOS ONE, vol.10, no.4, pp.1-17, 04 2015. [Online]. Available: https:\/\/doi.org\/10.1371\/journal.pone.0121002 10.1371\/journal.pone.0121002","DOI":"10.1371\/journal.pone.0121002"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[28] T. Agarwal, A. Sharma, A. Laxmikant, and L.V. Kale, \u201cTopology-aware task mapping for reducing communication contention on large parallel machines,\u201d Proc. 20th IEEE International Parallel Distributed Processing Symposium, pp.10, April 2006. 10.1109\/ipdps.2006.1639379","DOI":"10.1109\/IPDPS.2006.1639379"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[29] G. Lee, N. Tolia, P. Ranganathan, and R.H. Katz, \u201cTopology-aware resource allocation for data-intensive workloads,\u201d SIGCOMM Comput. Commun. Rev., vol.41, no.1, pp.120-124, Jan. 2011. [Online]. Available: http:\/\/doi.acm.org\/10.1145\/1925861.1925881 10.1145\/1925861.1925881","DOI":"10.1145\/1925861.1925881"},{"key":"29","unstructured":"[30] M. Miller and J. vSirvn, \u201cMoore graphs and beyond: A survey of the degree\/diameter problem,\u201d Electronic Journal of Combinatorics, Dynamic survey, vol.14, pp.1-61, 12 2005."},{"key":"30","doi-asserted-by":"crossref","unstructured":"[31] V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton, \u201cA lower bound on the average shortest path length in regular graphs,\u201d Networks, vol.4, no.4, pp.335-342, 1974. 10.1002\/net.3230040405","DOI":"10.1002\/net.3230040405"},{"key":"31","unstructured":"[32] \u201cParallel workloads archive,\u201d http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/."},{"key":"32","doi-asserted-by":"crossref","unstructured":"[33] H. Casanova, A. Giersch, A. Legrand, M. Quinson, and F. Suter, \u201cVersatile, scalable, and accurate simulation of distributed applications and platforms,\u201d Journal of Parallel and Distributed Computing, vol.74, no.10, pp.2899-2917, June 2014. [Online]. Available: http:\/\/hal.inria.fr\/hal-01017319","DOI":"10.1016\/j.jpdc.2014.06.008"},{"key":"33","unstructured":"[34] D. Bailey, E. Barszcz, J. Barton, D. Browning, R. Carter, L. Dagum, R. Fatoohi, S. Fineberg, P. Frederickson, T. Lasinski, R. Schreiber, H. Simon, V. Venkatakrishnan, and S. Weeratunga, \u201cThe nas parallel benchmarks,\u201d https:\/\/www.nas.nasa.gov\/assets\/pdf\/techreports\/1994\/rnr-94-007.pdf, March 1994."},{"key":"34","doi-asserted-by":"crossref","unstructured":"[35] S.J. Chapin, W. Cirne, D.G. Feitelson, J.P. Jones, S.T. Leutenegger, U. Schwiegelshohn, W. Smith, and D. Talby, \u201cBenchmarks and Standards for the Evaluation of Parallel Job Schedulers,\u201d Job Scheduling Strategies for Parallel Processing, vol.1659, pp.66-89, 1999. 10.1007\/3-540-47954-6_4","DOI":"10.1007\/3-540-47954-6_4"},{"key":"35","unstructured":"[36] D.K. Dror, G. Feitelsona, and D. Tsafrirb, \u201cExperience with using the Parallel Workloads Archive,\u201d Journal of Parallel and Distributed Computing, vol.74, no.10, pp.2967-2982, Oct. 2014."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/12\/E103.D_2020PAP0006\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T04:31:32Z","timestamp":1607142692000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/12\/E103.D_2020PAP0006\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,1]]},"references-count":35,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2020pap0006","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2020,12,1]]}}}