Article

Topology mapping for Blue Gene/L supercomputer

Authors:

Jose MoreiraAuthors Info & Claims

SC '06: Proceedings of the 2006 ACM/IEEE conference on Supercomputing

Pages 116 - es

https://doi.org/10.1145/1188455.1188576

Published: 11 November 2006 Publication History

Abstract

Mapping virtual processes onto physical processos is one of the most important issues in parallel computing. The problem of mapping of processes/tasks onto processors is equivalent to the graph embedding problem which has been studied extensively. Although many techniques have been proposed for embeddings of two-dimensional grids, hypercubes, etc., there are few efforts on embeddings of three-dimensional grids and tori. Motivated for better support of task mapping for Blue Gene/L supercomputer, in this paper, we present embedding and integration techniques for the embeddings of three-dimensional grids and tori. The topology mapping library that based on such techniques generates high-quality embeddings of two/three-dimensional grids/tori. In addition, the library is used in BG/L MPI library for scalable support of MPI topology functions. With extensive empirical studies on large scale systems against popular benchmarks and real applications, we demonstrate that the library can significantly improve the communication performance and the scalability of applications.

References

[1]

IBM Advanced Computing Technology Center MPI tracer/profiler. URL: http://www.research.ibm.com/actc/projects/mpitracer.shtml.

[2]

Adiga, N. R., Et Al. 2002. An overview of the Blue-Gene/L supercomputer. In SC2002 - High Performance Networking and Computing.

Digital Library

[3]

Aleliunas, R., and Rosenberg, A. L. 1982. On embedding rectangular grids in square grids. IEEE Transactions on Computers 31, 9 (September), 907--913.

[4]

Almasi, G., Et Al. 2001. Cellular supercomputing with system-on-a-chip. In IEEE International Solid-state Circuits Conference ISSCC.

[5]

Almasi, G., Archer, C., Castanos, J. G., Erway, C. C., Heidelberger, P., Martorell, X., Moreira, J. E., Pinnow, K., Ratterman, J., Smeds, N., Steinmacher-Burow, B., Gropp, W., and Toonen, B. 2004. Implementing MPI on the BlueGene/L super-computer. In Proc. of Euro-Par Conference.

[6]

Bhanot, G., Gara, A., Heidelberger, P., Lawless, E., Sexton, J. C., and Walkup, R. 2005. Optimizing task layout on the Blue Gene/L supercomputer. IBM Journal of Research and Development 49, 2 (March), 489--500.

Digital Library

[7]

Brian E. Smith, B. B. 2005. Performance effects of node mappings on the IBM Blue Gene/L machine. In Euro-Par.

Digital Library

[8]

Chan, M. J. 1996. Dilation-5 embedding of 3-dimensional grids into hypercubes. Journal of Parallel and Distributed Computing 33, 1 (February).

Digital Library

[9]

Der Wijingaart, R. F. V. 2002. NAS Parallel benchmarks version 2.4. Tech. Rep. NAS-02-007, NASA Ames Research Center, Oct.

[10]

Ellis, J. A. 1991. Embedding rectangular grids into square grids. IEEE Transactions on Computers 40, 1 (Jan.), 46--52.

Digital Library

[11]

Ellis, J. A. 1996. Embedding grids into grids: Techniques for large compression ratios. Networks 27, 1--17.

[12]

Erçal, F., Ramanujam, J., and Sadayappan, P. 1990. Task allocation onto a hypercube by recursive mincut bipartitioning. J. Parallel Distrib. Comput. 10, 1, 35--44.

Digital Library

[13]

Forum, M. P. I., 1997. MPI: A message-passing interface standard. URL: http://www.mpi-forum.org/docs/mpi-11-html/mpi-report.html, August.

Digital Library

[14]

Hatazaki, T. 1998. Rank reordering strategy for MPI topology creation functions. In Proceedings of the 5th EuroPVM/MPI conference, Springer-Verlag, Lecture Notes in Computer Science.

Digital Library

[15]

Kim, S.-Y., and Hur, J. 1999. An approach for torus embedding. In Proceedings of the 1999 International Workshop on Parallel Processing, 301--306.

Digital Library

[16]

Ma, E., and Tao, L. 1993. Embeddings among meshes and tori. Journal of Parallel and Distributed Computing 18, 44--55.

Digital Library

[17]

Melhem, R. G., and Hwang, G.-Y. 1990. Embedding rectangular grids into square grids with dilation two. IEEE Transactions on Computers 39, 12 (December), 1446--1455.

Digital Library

[18]

Moh, S., Yu, C., Han, D., Youn, H. Y., and Lee, B. 2001. Mapping strategies for switch-based cluster systems of irregular topology. In 8th IEEE International Conference on Parallel and Distributed Systems.

Digital Library

[19]

The MPICH and MPICH2 homepage. http://www-unix.mcs.anl.gov/mpi/mpich.

[20]

Ou, C.-W., Ranka, S., and Fox, G. 1996. Fast and parallel mapping algorithms for irregular problems. J. Supercomput. 10, 2, 119--140.

Digital Library

[21]

Rottger, M., and Schroeder, U. 1998. Efficient embeddings of grids into grids. In The 24th International workshop on Graph-Theoretic Concepts in Computer Science, 257--271.

Digital Library

[22]

Rottger, M., Schroeder, U., and Simon, J. 1993. Virtual topology library for parix. Tech. Rep. TR-005-93, Paderborn Center for Parallel Computing, University of Paderborn, Germany, November.

[23]

The asci sweep3d benchmark code. URL: http://www.llnl.gov/asci-benchmarks/scsi/limited/sweep3d/asci_sweep3d.html.

[24]

Träff, J. L. 2002. Implementing the MPI process topology mechanism. In Supercomputing, 1--14.

Digital Library

Cited By

Salimi Beni MHunold SCosenza B(2024)Analysis and prediction of performance variability in large-scale computing systemsThe Journal of Supercomputing10.1007/s11227-024-06040-wOnline publication date: 28-Mar-2024
https://doi.org/10.1007/s11227-024-06040-w
Gan XGuo JGuo PWu GSi JMei SLiu CLi TEl Saddik AMei TCucchiara RBertini MTobon Vallejo DAtrey PHossain M(2023)GraphMedia: Communication-balanced Graph Searching for Billion-scale Social Media AccessProceedings of the 31st ACM International Conference on Multimedia10.1145/3581783.3613828(8984-8993)Online publication date: 26-Oct-2023
https://dl.acm.org/doi/10.1145/3581783.3613828
Jeannot E(2022)Process mapping on any topology with TopoMatchJournal of Parallel and Distributed Computing10.1016/j.jpdc.2022.08.002170(39-52)Online publication date: Dec-2022
https://doi.org/10.1016/j.jpdc.2022.08.002
Show More Cited By

Recommendations

Optimization of MPI collective operations on the IBM Blue Gene/Q supercomputer

The Blue Gene/Q (BG/Q) machine is the latest in the line of IBM massively parallel supercomputers, designed to scale to 262,144 nodes and 16 million threads. Each BG/Q node has 68 hardware threads. Hybrid programming paradigms, which use message passing ...
Design and implementation of message-passing services for the Blue Gene/L supercomputer

The Blue Gene®/L (BG/L) supercomputer, with 65,536 dual-processor compute nodes, was designed from the ground up to support efficient execution of massively parallel message-passing programs. Part of this support is an optimized implementation of the ...
Optimization of MPI_Allreduce on the blue Gene/Q supercomputer
EuroMPI '13: Proceedings of the 20th European MPI Users' Group Meeting

The IBM Blue Gene/Q supercomputer has a 5D torus network where each node is connected to ten bi-directional links. In this paper we present techniques to optimize the MPI_Allreduce collective operation by building ten different edge disjoint spanning ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SC '06: Proceedings of the 2006 ACM/IEEE conference on Supercomputing

November 2006

746 pages

ISBN:0769527000

DOI:10.1145/1188455

Conference Chair:
Barbara Horner-Miller
Arctic Region Supercomputing Center

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IEEE-CS: Computer Society

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 November 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '06

Sponsor:

SIGARCH
IEEE-CS

SC '06: International Conference for High Performance Computing, Networking, Storage and Analysis

November 11 - 17, 2006

Florida, Tampa

Acceptance Rates

SC '06 Paper Acceptance Rate 54 of 239 submissions, 23%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

43
Total Citations
View Citations
731
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)3

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Salimi Beni MHunold SCosenza B(2024)Analysis and prediction of performance variability in large-scale computing systemsThe Journal of Supercomputing10.1007/s11227-024-06040-wOnline publication date: 28-Mar-2024
https://doi.org/10.1007/s11227-024-06040-w
Gan XGuo JGuo PWu GSi JMei SLiu CLi TEl Saddik AMei TCucchiara RBertini MTobon Vallejo DAtrey PHossain M(2023)GraphMedia: Communication-balanced Graph Searching for Billion-scale Social Media AccessProceedings of the 31st ACM International Conference on Multimedia10.1145/3581783.3613828(8984-8993)Online publication date: 26-Oct-2023
https://dl.acm.org/doi/10.1145/3581783.3613828
Jeannot E(2022)Process mapping on any topology with TopoMatchJournal of Parallel and Distributed Computing10.1016/j.jpdc.2022.08.002170(39-52)Online publication date: Dec-2022
https://doi.org/10.1016/j.jpdc.2022.08.002
Hu YKoibuchi M(2022)The Case for Disjoint Job Mapping on High-Radix Networked Parallel ComputersAlgorithms and Architectures for Parallel Processing10.1007/978-3-030-95388-1_9(123-143)Online publication date: 23-Feb-2022
https://doi.org/10.1007/978-3-030-95388-1_9
Georgiou YJeannot EMercier GVilliermet A(2018)Topology-aware job mappingInternational Journal of High Performance Computing Applications10.5555/3195474.319547632:1(14-27)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.5555/3195474.3195476
Glantz RPredari MMeyerhenke H(2018)Topology-induced Enhancement of MappingsProceedings of the 47th International Conference on Parallel Processing10.1145/3225058.3225117(1-10)Online publication date: 13-Aug-2018
https://dl.acm.org/doi/10.1145/3225058.3225117
Bordage CJeannot EEl-Araby EEl-Ghazawi TPanda D(2018)Process affinity, metrics and impact on performanceProceedings of the 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing10.1109/CCGRID.2018.00079(523-532)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1109/CCGRID.2018.00079
Georgiou YMercier GVilliermet A(2018)Large-Scale Experiment for Topology-Aware Resource ManagementEuro-Par 2017: Parallel Processing Workshops10.1007/978-3-319-75178-8_15(179-186)Online publication date: 8-Feb-2018
https://doi.org/10.1007/978-3-319-75178-8_15
Chen XLiu JLi SXie PChi LWang Q(2018)TAMM: A New Topology-Aware Mapping Method for Parallel Applications on the Tianhe-2A SupercomputerAlgorithms and Architectures for Parallel Processing10.1007/978-3-030-05051-1_17(242-256)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-3-030-05051-1_17
Kirmani SPark JRaghavan P(2017)An embedded sectioning scheme for multiprocessor topology-aware mapping of irregular applicationsInternational Journal of High Performance Computing Applications10.1177/109434201559708231:1(91-103)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1177/1094342015597082
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Media

Figures

Other

Tables

View Table of Contents