Encyclopedia of Parallel Computing

2011 Edition
| Editors: David Padua

Topology Aware Task Mapping

  • Abhinav Bhatele
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-09766-4_275

Synonyms

Graph embedding; MPI process mapping

Definition

Topology aware task mapping refers to the mapping of communicating parallel objects, tasks, or processes in a parallel application on nearby physical processors to minimize network traffic, by considering the communication of the objects or tasks and the interconnect topology of the machine.

Discussion

Introduction

Processors in modern supercomputers are connected together using a variety of interconnect topologies: meshes, tori, fat-trees, and others. Increasing size of the interconnect leads to an increased sharing of resources (network links and switches) among messages and hence network contention. This can potentially lead to significant performance degradation for certain classes of parallel applications. Sharing of links can be avoided by minimizing the distance traveled by messages on the network. This is achieved by mapping communicating objects or tasks on nearby physical processors on the network topology and is...

This is a preview of subscription content, log in to check access.

Bibliography

  1. 1.
    Bokhari SH (1981) On the mapping problem. IEEE Trans Comput 30(3):207–214MathSciNetGoogle Scholar
  2. 2.
    Kasahara H, Narita S (1984) Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Trans Comput 33:1023–1029Google Scholar
  3. 3.
    Arunkumar S, Chockalingam T (1992) Randomized heuristics for the mapping problem. Int J High Speed Comput (IJHSC) 4(4):289–300Google Scholar
  4. 4.
    Fitch BG, Rayshubskiy A, Eleftheriou M, Ward TJC, Giampapa M, Pitman MC (2006) Blue matter: approaching the limits of concurrency for classical molecular dynamics. In: SC’06: Proceedings of the 2006 ACM/IEEE conference on Supercomputing, Tampa, ACM Press, New York, 11–17 Nov 2006Google Scholar
  5. 5.
    Gygi F, Draeger EW, Schulz M, Supinski BRD, Gunnels JA, Austel V, Sexton JC, Franchetti F, Kral S, Ueberhuber C, Lorenz J (2006) Large-scale electronic structure calculations of high-Z metals on the blue gene/L platform. In: SC’06: Proceedings of the 2006 ACM/IEEE conference on Supercomputing, ACM Press, New YorkGoogle Scholar
  6. 6.
    Bhatelé A, Bohm E, Kalé LV (2011) Optimizing communication for Charm++applications by reducing network contention. Concurr Comput 23(2):211–222Google Scholar
  7. 7.
    Lee S-Y, Aggarwal JK (1987) A mapping strategy for parallel processing. IEEE Trans Comput 36(4):433–442Google Scholar
  8. 8.
    Berman F, Snyder L (1987) On mapping parallel algorithms into parallel architectures. J Parallel Distrib Comput 4(5):439–458Google Scholar
  9. 9.
    Ercal F, Ramanujam J, Sadayappan P (1988) Task allocation onto a hypercube by recursive mincut bipartitioning. In: Proceedings of the 3rd conference on Hypercube concurrent computers and applications, ACM Press, New York, pp 210–221Google Scholar
  10. 10.
    Agarwal T, Sharma A, Kalé LV (2006) Topology-aware task mapping for reducing communication contention on large parallel machines, In: Proceedings of IEEE International Parallel and Distributed Processing Symposium 2006, Rhodes Island, 25–29 Apr 2006. IEEE, PiscatawayGoogle Scholar
  11. 11.
    Yu H, Chung I-H, Moreira J (2006) Topology mapping for blue gene/L supercomputer. In: SC’06: Proceedings of the 2006 ACM/IEEE conference on Supercomputing, Tampa, 11–17 Nov 2006. ACM, New York, p 116Google Scholar
  12. 12.
    Bhatele A (2010) Automating topology aware mapping for supercomputers. Ph.D. thesis, Dept. of Computer Science, University of Illinois. http://hdl.handle.net/2142/16578 (August 2010)
  13. 13.
    Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(1):291–307zbMATHGoogle Scholar
  14. 14.
    Bollinger SW, Midkiff SF (1988) Processor and link assignment in multicomputers using simulated annealing. In: 1988 ICPP, vol 1, Aug 1988, pp 1–7Google Scholar
  15. 15.
    Bhanot G, Gara A, Heidelberger P, Lawless E, Sexton JC, Walkup R (2005) Optimizing task layout on the blue gene/L supercomputer. IBM J Res Dev 49(2/3):489–500Google Scholar
  16. 16.
    Bhatele A, Gupta G, Kale LV, Chung I-H (2010) Automated mapping of regular communication graphs on mesh interconnects. In: Proceedings of International Conference on High Performance Computing & Simulation (HiPCS) 2010, Caen, 28 June–2 July 2010. IEEE, PiscatawayGoogle Scholar
  17. 17.
    Mansour N, Ponnusamy R, Choudhary A, Fox GC (1993) Graph contraction for physical optimization methods: a quality-cost tradeoff for mapping data on parallel computers. In: ICS’93: Proceedings of the 7th International Conference on Supercomputing, Tokyo, 19–23 July 1993. ACM, New York, pp 1–10Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Abhinav Bhatele
    • 1
  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUrbanaIL, USA