Optimizing task layout on the Blue Gene/L supercomputer

@article{Bhanot2005OptimizingTL,
  title={Optimizing task layout on the Blue Gene/L supercomputer},
  author={Gyan Bhanot and Alan Gara and Philip Heidelberger and Eoin Lawless and James C. Sexton and Robert Walkup},
  journal={IBM Journal of Research and Development},
  year={2005},
  volume={49},
  pages={489-500}
}
A general method for optimizing problem layout on the Blue Genet/L (BG/L) supercomputer is described. The method takes as input the communication matrix of an arbitrary problem as an array with entries C(i, j), which represents the data communicated from domain i to domain j. Given C(i, j), we implement a heuristic map that attempts to sequentially map a domain and its communication neighbors either to the same BG/L node or to nearneighbor nodes on the BG/L torus, while keeping the number of… CONTINUE READING
Highly Cited
This paper has 66 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 42 extracted citations

Task mapping on supercomputers with cellular networks

Computer Physics Communications • 2008
View 8 Excerpts
Highly Influenced

Mapping applications with collectives over sub-communicators on torus networks

2012 International Conference for High Performance Computing, Networking, Storage and Analysis • 2012
View 8 Excerpts
Highly Influenced

Optimizing communication for Charm++ applications by reducing network contention

Concurrency and Computation: Practice and Experience • 2011
View 14 Excerpts
Highly Influenced

Optimization of the hop-byte metric for effective topology aware mapping

2012 19th International Conference on High Performance Computing • 2012
View 1 Excerpt

SaPM: Switch-aware process mapping model for parallel computing

2012 6th International Conference on Application of Information and Communication Technologies (AICT) • 2012
View 1 Excerpt

66 Citations

051015'07'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 66 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Implementing the MPI Process Topology Mechanism

ACM/IEEE SC 2002 Conference (SC'02) • 2002
View 1 Excerpt

and M

D. J. Kerbyson, H. J. Alme, A. Hoisie, F. Petrini, H. J. Wasserman
Gittings, ‘‘Predictive Performance and Scalability Modeling of a Large-Scale Application,’’ Proceedings of the ACM/IEEE Conference on Supercomputing, • 2001
View 1 Excerpt

Introduction to the Monte-Carlo Method

I. Manno
Markov Chain Monte Carlo in Practice, • 1996
View 1 Excerpt

On Bottleneck Partitioning of k-Ary n-Cubes

Parallel Processing Letters • 1996
View 1 Excerpt

and D

V. A. Dixit-Radiy
K. Panda, ‘‘Task Assignment on Distributed-Memory Systems with Adaptive Wormhole Routing,’’ Proceedings of the Symposium on Parallel and Distributed Processing (SPDP), • 1993
View 1 Excerpt

A New Mapping Heuristic Based on Mean Field Annealing

J. Parallel Distrib. Comput. • 1992
View 3 Excerpts

Similar Papers

Loading similar papers…