A performance model for analysis of heterogeneous multi-cluster systems

This paper addresses the problem of performance modeling for large-scale heterogeneous distributed systems with emphases on multi-cluster computing systems. Since the overall performance of distributed systems is often depends on the effectiveness of its communication network, the study of the interconnection networks for these systems is very important. Performance modeling is required to avoid poorly chosen components and architectures as well as discovering a serious shortfall during system testing just prior to deployment time. However, the multiplicity of components and associated complexity make performance analysis of distributed computing systems a challenging task. To this end, we present an analytical performance model for the interconnection networks of heterogeneous multi-cluster systems. The analysis is based on a parametric family of fat-trees, the m-port n-tree, and a deterministic routing algorithm, which is proposed in this paper. The model is validated through comprehensive simulation, which demonstrated that the proposed model exhibits a good degree of accuracy for various system organizations and under different working conditions.

[1]  Chita R. Das,et al.  Performance Analysis of Buffering Schemes on Wormhole Routers , 1997, IEEE Trans. Computers.

[2]  Mohammad Kazem Akbari,et al.  Study of a Cluster-Based Parallel System Through Analytical Modeling and Simulation , 2005, ICCSA.

[3]  S. Khorsandi,et al.  Queuing network modeling of a cluster-based parallel system , 2004, Proceedings. Seventh International Conference on High Performance Computing and Grid in Asia Pacific Region, 2004..

[4]  Cho-Li Wang,et al.  Contention-free complete exchange algorithm on clusters , 2000, Proceedings IEEE International Conference on Cluster Computing. CLUSTER 2000.

[5]  David J. Lilja,et al.  Characterization of Communication Patterns in Message-Passing Parallel Scientific Application Programs , 1998, CANPC.

[6]  Jemal H. Abawajy,et al.  Parallel job scheduling on multicluster computing system , 2003, 2003 Proceedings IEEE International Conference on Cluster Computing.

[7]  Ian Foster,et al.  The Grid: A New Infrastructure for 21st Century Science , 2002 .

[8]  P.M. Melliar-Smith,et al.  Recursively scalable fat-trees as interconnection networks , 1994, Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications.

[9]  Yeh-Ching Chung,et al.  A multiple LID routing scheme for fat-tree-based InfiniBand networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[10]  Antonio Robles,et al.  An effective methodology to improve the performance of the up*/down* routing algorithm , 2004, IEEE Transactions on Parallel and Distributed Systems.

[11]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[12]  Mohammad Kazem Akbari,et al.  Performance analysis of multi-cluster systems using analytical modelling , 2005 .

[13]  Hamid Sarbazi-Azad,et al.  Analysis of k-ary n-cubes with dimension-ordered routing , 2003, Future Gener. Comput. Syst..

[14]  Xiaodong Zhang,et al.  Memory Hierarchy Considerations for Cost-Effective Cluster Computing , 2000, IEEE Trans. Computers.

[15]  Ming Q. Xu.  Effective metacomputing using LSF Multicluster , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[16]  A. Varga,et al.  THE OMNET++ DISCRETE EVENT SIMULATION SYSTEM , 2003 .

[17]  Joydeep Ghosh,et al.  A Comprehensive Analytical Model for Wormhole Routng in Multicomputer Systems , 1994, J. Parallel Distributed Comput..

[18]  Jemal H. Abawajy.  Dynamic Parallel Job Scheduling in Multi-cluster Computing Systems , 2004, International Conference on Computational Science.

[19]  Hideharu Amano,et al.  The Impact of Path Selection Algorithm of Adaptive Routing for Implementing Deterministic Routing , 2002, PDPTA.

[20]  Anca I. D. Bucur,et al.  The Influence of the Structure and Sizes of Jobs on the Performance of Co-allocation , 2000, JSSPP.

[21]  Ahmad Khonsari,et al.  A performance model of compressionless routing in k-ary n-cube networks , 2006, Perform. Evaluation.

[22]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[23]  Leonard Kleinrock.  On the modeling and analysis of computer networks , 1993 .

[24]  Fabrizio Petrini,et al.  k-ary n-trees: high performance networks for massively parallel architectures , 1997, Proceedings 11th International Parallel Processing Symposium.

[25]  Hideharu Amano,et al.  Performance evaluation of routing algorithms in RHiNET-2 cluster , 2003, 2003 Proceedings IEEE International Conference on Cluster Computing.

[26]  Ronald I. Greenberg,et al.  An improved analytical model for wormhole routed networks with application to butterfly fat-trees , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

[27]  Leonard Kleinrock,et al.  A queueing model for wormhole routing with timeout , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[28]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..