Linear Crossed Cube (LCQ): A New Interconnection Network Topology for Massively Parallel System

Scalability and Complexity are crucial performance parameters in the design of Interconnection networks for multiprocessor system. This paper proposed and analyzed a new scalable interconnection network topology named as Linear Crossed Cube (LCQ). LCQ designed is based on the principle of hypercube architecture however, it improves some of the drawbacks of hypercube such as complex extensibility and its VLSI Layout. It inherits most of the desirable properties of hypercube type architectures; the most notably are small diameter and symmetry. LCQ has linear extension at each level of the extension while preserving all the desired topological properties. To evaluate the performance of proposed LCQ, standard scheduling algorithms are being implemented on it. The performance parameters such as Load Imbalance Factor (LIF) and balancing time are evaluated on the proposed LCQ as well as on other similar multiprocessor architectures. To compare the performance of proposed LCQ, standard scheduling scheme is also implemented on other similar multiprocessor architectures. The comparative simulation study shows that the proposed network can be considered as low-cost multiprocessor architecture for parallel system when appropriate scheduling algorithm is implemented onto it.

[1]  Hamid Sarbazi-Azad,et al.  The necklace-hypercube: a well scalable hypercube-based interconnection network for multiprocessors , 2005, SAC '05.

[2]  Yi Pan,et al.  The exchanged hypercube , 2005, IEEE Transactions on Parallel and Distributed Systems.

[3]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[4]  Robert D. van der Mei,et al.  Dynamic Load Balancing and Job Replication in a Global-Scale Grid Environment: A Comparison , 2009, IEEE Transactions on Parallel and Distributed Systems.

[5]  Mor Harchol-Balter,et al.  On Choosing a Task Assignment Policy for a Distributed Server System , 1998, J. Parallel Distributed Comput..

[6]  Fei Wang,et al.  A Task Scheduling Algorithm Based on Load Balancing in Cloud Computing , 2010, WISM.

[7]  Anthony P. Reeves,et al.  Strategies for Dynamic Load Balancing on Highly Parallel Computers , 1993, IEEE Trans. Parallel Distributed Syst..

[8]  Abdus Samad,et al.  Performance Analysis of Massively Parallel Architectures , 2013 .

[9]  Philip S. Yu,et al.  The state of the art in locally distributed Web-server systems , 2002, CSUR.

[10]  D. I. George Amalarethinam,et al.  A new DAG based Dynamic Task Scheduling Algorithm (DYTAS) for Multiprocessor Systems , 2011 .

[11]  Alpesh Patel,et al.  Area-Efficient VLSI Layouts for Binary Hypercubes , 2000, IEEE Trans. Computers.

[12]  S. N. Patro,et al.  Topological Properties of a New Fault Tolerant Interconnection Network for Parallel Computer , 2008, 2008 International Conference on Information Technology.

[13]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[14]  Abdus Samad,et al.  TOPOLOGICAL EVALUATION OF VARIANTS HYPERCUBE NETWORK , 2013 .

[15]  Mohamed Ould-Khaoua,et al.  On the topological properties of the arrangement-star network , 2003, J. Syst. Archit..

[16]  Emad Abuelrub A Comparative Study on the Topological Properties of the Hyper-Mesh Interconnection Network , 2008 .

[17]  Alexander V. Veidenbaum,et al.  Interconnection network organization and its impact on performance and cost in shared memory multiprocessors , 1999, Parallel Comput..

[18]  Ahmed Nabih Zaki Rashed Very Large Scale Optical Interconnect Systems For Different Types of Optical Interconnection Networks , 2012 .

[19]  Kemal Efe,et al.  The Crossed Cube Architecture for Parallel Computation , 1992, IEEE Trans. Parallel Distributed Syst..

[20]  Behrooz Parhami,et al.  Challenges in Interconnection Network Design in the Era of Multiprocessor and Massively Parallel Mic , 2000 .

[21]  Khaled Day,et al.  The Hyperstar Interconnection Network , 1998, J. Parallel Distributed Comput..

[22]  Philip S. Yu,et al.  Analysis of Task Assignment Policies in Scalable Distributed Web-Server Systems , 1998, IEEE Trans. Parallel Distributed Syst..

[23]  Chita Ranjan Tripathy,et al.  On a New Multicomputer Interconnection Topology for Massively Parallel Systems , 2011, ArXiv.

[24]  Giuseppe Lipari,et al.  Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms , 2009, IEEE Transactions on Parallel and Distributed Systems.

[25]  Huimin Du,et al.  A Hypercube-based Scalable Interconnection Network for Massively Parallel Computing , 2008, J. Comput..

[26]  Chita Ranjan Tripathy,et al.  Extended Crossed Cube: An Improved Fault Tolerant Interconnection Network , 2009, 2009 Fifth International Joint Conference on INC, IMS and IDC.

[27]  S. F. El-Zoghdy A Hierarchical Load Balancing Policy for Grid Computing Environment , 2012 .

[28]  Varsha Kumari,et al.  Modelling and Evaluation of Multiprocessor Architecture , 2012 .

[29]  Mor Harchol-Balter,et al.  On Choosing a Task Assignment Policy for a Distributed Server System , 1998, Computer Performance Evaluation.

[30]  Omar Farooq,et al.  Two Round Scheduling (TRS) Scheme for Linearly Extensible Multiprocessor Systems , 2012 .