Genetic Node-Mapping Methods for Rapid Collective Communications

DOI Web Site 36 References Open Access
  • YOKOTA Takashi
    Department of Fundamental Engineering, School of Engineering, Utsunomiya University
  • OOTSU Kanemitsu
    Department of Fundamental Engineering, School of Engineering, Utsunomiya University
  • OHKAWA Takeshi
    Department of Fundamental Engineering, School of Engineering, Utsunomiya University

Abstract

<p>Inter-node communication is essential in parallel computation. The performance of parallel processing depends on the efficiencies in both computation and communication, thus, the communication cost is not negligible. A parallel application program involves a logical communication structure that is determined by the interchange of data between computation nodes. Sometimes the logical communication structure mismatches to that in a real parallel machine. This mismatch results in large communication costs. This paper addresses the node-mapping problem that rearranges logical position of node so that the degree of mismatch is decreased. This paper assumes that parallel programs execute one or more collective communications that follow specific traffic patterns. An appropriate node-mapping achieves high communication performance. This paper proposes a strong heuristic method for solving the node-mapping problem and adapts the method to a genetic algorithm. Evaluation results reveal that the proposed method achieves considerably high performance; it achieves 8.9 (4.9) times speed-up on average in single-(two-)traffic-pattern cases in 32×32 torus networks. Specifically, for some traffic patterns in small-scale networks, the proposed method finds theoretically optimized solutions. Furthermore, this paper discusses in deep about various issues in the proposed method that employs genetic algorithm, such as population of genes, number of generations, and traffic patterns. This paper also discusses applicability to large-scale systems for future practical use.</p>

Journal

References(36)*help

See more

Related Projects

See more

Details 詳細情報について

Report a problem

Back to top