Browse > Article

Adjacency-Based Mapping of Mesh Processes for Switch-Based Cluster Systems of Irregular Topology  

Moh, Sang-Man (School of Computer Eng., Chosun University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea CI / v.47, no.2, 2010 , pp. 1-10 More about this Journal
Abstract
Mapping virtual process topology to physical processor topology is one of the most important design issues in parallel programming. However, the mapping problem is complicated due to the topology irregularity and routing complexity. 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 cluster systems have been studied and developed for many years since they provide high interconnection flexibility, scalability, and expandability which are not attainable in traditional regular networks. 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
Cluster system; process mapping; process topology; irregular network; MPI;
Citations & Related Records
연도 인용수 순위
  • Reference
1 W. Qiao and L. M. Ni, "Adaptive Routing in Irregular Networks Using Cut-Through Switches," Proc. of Int. Conf. on Parallel Processing, 1996.
2 G. F. Pfister, In Search of Clusters, 2nd Ed., Chapter 5, Prentice-Hall, Inc., NJ, 1998.
3 A. M. Mainwaring, B. N. Chun, S. Schleimer, and D. S. Wilkerson, "System Area Network Mapping," Proc. of Annual Symp. on Parallel Algorithms and Architectures, 1997.
4 F. Silla and J. Duato, "On the Use of Virtual Channels in Networks of Workstations with Irregular Topology," Proc. of Workshop on Parallel Computer Routing and Communication, Also in Lecture Notes in Computer Science, Vol. 1417, pp. 202-216, 1997.
5 R. Kesavan, K. Bondalapati, and D. K. Panda, "Multicast on Irregular Switch-Based Networks with Wormhole Routing," Proc. of Int. Symp. on High Performance Computer Architecture, 1997.
6 R. Sivaram, D. K. Panda, and C. B. Stunkel, "Multicasting in Irregular Networks with Cut-Through Switches Using Tree-Based Multidestination Worms," Proc. of Workshop on Parallel Computer Routing and Communication, Also in Lecture Notes in Computer Science, Vol. 1417, pp. 39-52, 1997.
7 R. M. Butler and E. L. Lusk, "Monitors, Messages, and Clusters: the p4 Parallel Programming System," Parallel Computing, 1994.
8 C. B. Stunkel, R. Sivaram, and D. K. Panda, "Implementing Multidestination Worms in Switch-Based Parallel Systems: Architectural Alternatives and their Impact," Proc. of Int. Symp. on Computer Architecture, 1997.
9 T. Hatazaki, "Rank Reordering Strategies for MPI Topology Creation Functions," Lecture Notes in Computer Science, Vol. 1497, pp. 188-195, 1998.
10 D. Avresky and N. Natchev, "Dynamic Reconfiguration in Computer Clusters with Irregular Topologies in the Presence of Multiple Node and Link Failures," IEEE Trans. on Computers, Vol. 54, No. 5, pp. 603-615, May 2005.   DOI
11 H. Chen, and P. Wyckoff, "Simulation Studies of Gigabit Ethernet versus Myrinet using Real Application Cores," Proc. of 4th Workshop on Communication, Architecture, and Applications for Network-Based Parallel Computing (CANPC), 2000.
12 S. Moh, C. Yu, H. Y. Youn, B. Lee, and D. Han, "Mapping Strategies for Switch-Based Cluster Systems of Irregular Topology," Proc. of 8th Int. Conf .on Parallel and Distributed Systems, pp. 733-740, Jun. 2001.
13 M. D. Schroeder, et.al., "Autonet: a High-speed, Self-configuring Local Area Network Using Point-to-point Links," SRC Research Report, No.59, Digital Equipment Corporation, April 1990.
14 P. Czarnul, "Dynamic Process Partitioning and Migration for Irregular Applications," Proc. of Int. Conf .on Parallel Computing in Electrical Engineering, 2002.
15 R. Calkin, R. Hempel, H.-C. Hoppe, and P. Wypior, "Portable programming with the PARMACS message-passing library," Parallel Computing, Vol. 20, pp. 614-632, 1994.
16 R. Kesavan and D. K. Panda, "Multicasting on Switch-Based Irregular Networks using Multi-drop Path-Based Multidestination Worms," Proc. of Workshop on Parallel Computer Routing and Communication, Also in Lecture Notes in Computer Science, Vol. 1417, pp. 217-230, 1997.
17 S. Moh, "Adjacency-Based Mesh Process Mapping for Irregular Cluster Systems," Proc. of 11th IEEE Int. Conf. on High Performance Computing and Communications, pp. 500-505, Seoul, Korea, June 2009.
18 O. KrAamer and H. MAuhlenbein, "Mapping Strategies in Message-Based Multiprocessor Systems," Parallel Computing, Vol. 9, pp. 213-225, 1989.   DOI   ScienceOn
19 R. Buyya, High Performance Cluster Computing: Architectures and Systems, Prentice-Hall Inc., NJ, 1999.
20 S. H. Bokhari, "On the Mapping Problem," IEEE Trans. on Computers, Vol. C-30, No. 3, pp. 207-214, March 1981.   DOI
21 F. Silla, J. Duato, A. Sivasubramaniam and C. R. Das, "Virtual Channel Multiplexing in Networks of Workstations with Irregular Topology," Proc. of Int. Conf. on High Performance Computing, pp. 147-154, Dec. 1998.
22 C. Glass and L. Ni, "The Turn Model for Adaptive Routing," Journal of the ACM, Vol. 41 No. 4, Sep. 1994.
23 M. J. Berger and S. H. Bokhari, "A Partitioning Strategy for Nonuniform Problems on Multiprocessors," IEEE Trans. on Computers, Vol. C-36, No. 5, pp. 570-580, May 1987.   DOI
24 J. M. Orduna, F. Silla, and J. Duoto, "On the Development of a Communication-Aware Task Mapping Technique," Journal of Systems Architecture, Vol. 50, No. 4, pp. 207-220, Mar. 2004.   DOI   ScienceOn
25 Message Passing Interface Forum, MPI: A Message-Passing Interface Standard, Version 2.1, June 23, 2008.
26 N. Boden, et.al., "Myrinet: A Gigabit-per-Second Local Area Network," IEEE Micro, Vol. 15 No. 1, pp. 29-36, Feb. 1995.   DOI   ScienceOn