Optimizing task layout on the Blue Gene/L supercomputer

IBM Journal of Research and Development

Volumn 49, Issue 2-3, 2005, Pages 489-500

  Bhanot, Gyan ^a   Gara, Alan ^a   Heidelberger, Philip ^a   Lawless, Eoin ^b   Sexton, James C ^a   Walkup, Robert ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b TRINITY COLLEGE DUBLIN   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; HEURISTIC METHODS; INTERFACES (COMPUTER); MARKOV PROCESSES; MONTE CARLO METHODS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

BLUE GENE/L SUPERCOMPUTER; MESSAGE PASSING INTERFACE (MPI);

SUPERCOMPUTERS;

EID: 19344371749     PISSN: 00188646     EISSN: None     Source Type: Journal    
DOI: 10.1147/rd.492.0489     Document Type: Article

References (15)

1. G. Bhanot, D. Chen, A. Gara, and P. Vranas, "The Blue Gene/L Supercomputer," Nucl. Phys. B (Proc. Suppl.) 119, 114-121 (2003).
2. V. A. Dixit-Radiya and D. K. Panda, "Task Assignment on Distributed-Memory Systems with Adaptive Wormhole Routing," Proceedings of the Symposium on Parallel and Distributed Processing (SPDP), 1993, pp. 674-681.
3. A. Billionnet, M. C. Costa, and A. Sutter, "An Efficient Algorithm for a Task Allocation Problem," J. ACM 39, No. 3, 502-518 (July 1992).
4. J. L. Träff, "Implementing the MPI Process Topology Mechanism," Proceedings of the ACM/IEEE Conference on Supercomputing, 2002, pp. 1-14; see http://sc-2OO2.org/paperpdfs/ pap.pap122.pdf.
5. F. Ercal, J. Ramanujam, and P. Sadayappan, "Task Allocation onto a Hypercube by Recursive Mincut Bipartitioning," J. Parallel & Distr. Computing 10, No. 1, 35-44 (September 1990).
6. T. Bultan and C. Aykanat, "A New Mapping Heuristic Based on Mean Field Annealing," J. Parallel & Distr. Computing 16, No. 4, 292-305 (December 1992).
7. D. Nicol, "Rectilinear Partitioning of Irregular Data Parallel Computations," J. Parallel & Distr. Computing 23, No. 2, 119-134 (November 1994).
8. D. Nicol and W. Mao, "On Bottleneck Partitioning of k-ary n-cubes," Parallel Process. Lett. 6, No. 6, 389-399 (June 1996).
9. P. J. M. van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications, D. Reidel Publishing Co., Dordrecht, Netherlands, 1987; ISBN: 9027725136.
10. P. Brémaud, Markov Chains: Gibbs Fields, Monte Cario Stimulation, and Queues, Springer-Verlag, New York, 1999; ISBN: 0387985093.
11. Markov Chain Monte Carlo in Practice, W. R. Gilks, S. Richardson, and D. J. Spiegelhalter, Eds., Chapman and Hall/CRC, Boca Raton, FL, 1996; ISBN: 0412055511. I. Manno, Introduction to the Monte-Cario Method, Akademiai Kiado, Budapest, Hungary, 1999; ISBN: 9630576155.
12. See http://www-users.cs.umn.edu/~karypis/metis.
13. D. J. Kerbyson, H. J. Alme, A. Hoisie, F. Petrini, H. J. Wasserman, and M. Gittings, "Predictive Performance and Scalability Modeling of a Large-Scale Application," Proceedings of the ACM/IEEE Conference on Supercomputing, 2001, pp. 37-37; see http://www.sc2001.org/ papers/pap.pap255.pdf.
14. ASCI Purple Benchmark Web page; see http://www.llnl.gov/asci/purple/ benchmarks/.
15. See http://www.openmp.org.