Research Article Open Access

Irregular Class of Multistage Interconnection Network in Parallel Processing

Sandeep Sharma1, K. S. Kahlon1, P. K. Bansal1 and Kawaljeet Singh1
  • 1 ,
Journal of Computer Science
Volume 4 No. 3, 2008, 220-224

DOI: https://doi.org/10.3844/jcssp.2008.220.224

Published On: 31 March 2008

How to Cite: Sharma, S., Kahlon, K. S., Bansal, P. K. & Singh, K. (2008). Irregular Class of Multistage Interconnection Network in Parallel Processing. Journal of Computer Science, 4(3), 220-224. https://doi.org/10.3844/jcssp.2008.220.224

Abstract

A major problem in designing a large-scale parallel and distributed system was the construction of an Interconnection Network (IN) to provide inter-processor communication. One of the biggest issues in the development of such a system was the development of an effective architecture and algorithms that have high reliability, give good performance (even in the presence of faults), low cost, low average path length, higher number of passes of request and a simple control. In this study, a new class of Irregular Fault Tolerant Multistage Interconnection Network (MIN) called Improved Four Tree (IFT) is introduced. Algorithms for computing the cost and permutations passable in the presence and absence of fault are developed for the analysis of various networks with proposed network.

Download

Keywords

  • Fault tolerant MIN
  • four tree network
  • multistage interconnection network
  • routing
  • permutation