• DocumentCode
    2571935
  • Title

    Adjacency-Based Mesh Process Mapping for Irregular Cluster Systems

  • Author

    Moh, Sangman

  • Author_Institution
    Sch. of Comput. Eng., Chosun Univ., Gwangju, South Korea
  • fYear
    2009
  • fDate
    25-27 June 2009
  • Firstpage
    500
  • Lastpage
    505
  • Abstract
    This paper proposes a new process mapping scheme called adjacency-based mapping (AM) for irregular cluster systems assuming that the two-dimensional mesh process topology is specified as an interprocess communication pattern. The proposed AM tries to map neighboring processes in virtual process topology to adjacent processors in physical processor topology. Simulation study shows that the proposed AM results in better mapping quality and shorter interprocess latency compared to the conventional approaches.
  • Keywords
    computational complexity; graph theory; multiprocessor interconnection networks; network topology; parallel programming; adjacency-based mesh process mapping scheme; computational graph; interprocess communication pattern; interprocess latency; irregular cluster system; parallel programming; physical processor topology; switch-based irregular network; time complexity; two-dimensional mesh process topology; virtual process topology; Bandwidth; Communication switching; Delay; High performance computing; Information technology; Network topology; Routing; Samarium; Scalability; System recovery; Cluster system; MPI; irregular network; process mapping; process topology; switch-based network;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High Performance Computing and Communications, 2009. HPCC '09. 11th IEEE International Conference on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-4600-1
  • Electronic_ISBN
    978-0-7695-3738-2
  • Type

    conf

  • DOI
    10.1109/HPCC.2009.72
  • Filename
    5167035