CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Design and Reliability Analysis of a Class of Irregular Fault-Tolerant Multistage Interconnection Networks

by Rinkle Rani Aggarwal
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 39 - Number 8
Year of Publication: 2012
Authors: Rinkle Rani Aggarwal
10.5120/4838-7100

Rinkle Rani Aggarwal . Design and Reliability Analysis of a Class of Irregular Fault-Tolerant Multistage Interconnection Networks. International Journal of Computer Applications. 39, 8 ( February 2012), 8-14. DOI=10.5120/4838-7100

@article{ 10.5120/4838-7100,
author = { Rinkle Rani Aggarwal },
title = { Design and Reliability Analysis of a Class of Irregular Fault-Tolerant Multistage Interconnection Networks },
journal = { International Journal of Computer Applications },
issue_date = { February 2012 },
volume = { 39 },
number = { 8 },
month = { February },
year = { 2012 },
issn = { 0975-8887 },
pages = { 8-14 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume39/number8/4838-7100/ },
doi = { 10.5120/4838-7100 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:25:53.727719+05:30
%A Rinkle Rani Aggarwal
%T Design and Reliability Analysis of a Class of Irregular Fault-Tolerant Multistage Interconnection Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 39
%N 8
%P 8-14
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Parallel processing can be used to design high performance computing systems. In a parallel computer inter-connecting processors and linking them efficiently to the memory modules is not an easy task. Therefore, there is a requirement of an interconnection network that provides the desired connectivity and performance at minimum cost. Multistage interconnection networks (MINs) provide cost-effective, high-bandwidth communication between processors and/or memory modules in comparison to bus and crossbar interconnection networks. In this paper a new irregular MIN named IFTN (Improved Four Tree Network) has been proposed. The performance of IFTN has been measured in terms of reliability and cost. It has been proved that the proposed network IFTN provides much better fault-tolerance and reliability at lesser cost In Comparison To Four Trees.

References
  1. Bhuyan, L.N., Qing, Y., Agrawal, D.P., 1989. Performance of Multiprocessor Interconnection Networks. Computer, 22(2), 25-37.
  2. Gupta, A., Bansal P.K., 2008. Evaluation of Fault-tolerant Multistage Interconnection Networks. CSI- Communication, 1-16.
  3. Sengupta, J., Bansal, P.K., 2001. High speed Dynamic Fault-Tolerance. IEEE Region 10 International Conference on Electrical and Electronic Technology, 669-675.
  4. Bansal, P. K., Singh, K., Joshi, R.C., Siroha, G. P., 1991. Fault-tolerant Augmented Baseline Multistage Interconnection Network. IEEE International Conference TENCON-91, 200-204.
  5. Sharma S., Kalhon K.S., Bansal P.K., Singh K., 2008a. Improved Irregular Augmented Shuffle Exchange Multistage Interconnection Network. International Journal of Computer Science and Security, 2(3), 28-33.
  6. Nitin, 2006. On Analytic Bounds of Regular and Irregular Fault-tolerant Multistage Interconnection Networks. International Conference PDPTA-06, 221-226.
  7. Hou, G., Yang, Y., 2000. Super Recursive Baselines: A Family of New Interconnection Networks with High Performance/Cost Ratios. IEEE International Symposium on Parallel Architectures, Algorithms and Networks ISPAN- 2000, 260-265.
  8. Sengupta, J., Bansal, P.K., Gupta, A., 2000. Permutation and Reliability Measures of Regular and Irregular MINs. IEEE International Conference TENCON-2000, 531-536.
  9. Sharma, S., Kahlon, K.S., Bansal, P.K., 2008b. On a class of Multistage Interconnection Networks in Parallel Processing. International Journal of Computer Science and Network Security, 8(5), 287-291.
  10. Subramanyam, A., Prasad, E.V. & Nadamuni, R. (2006) Permutation Capability and Connectivity of Enhanced Multistage Interconnection Network (E-MIN). IEEE International Conference on Advanced Computing and Communications, 8-11.
  11. Seok, S., You, B., Youm, S., Kim, K., Kang C., 2010. A?Heuristic Multi-path routing scheme for online traffic in MPLS Networks. International Journal of Computer Systems Science and Engineering, 25(1).
  12. Tang, Y., Zhang, Y., Chen, H., 2009. A?parallel shortest path algorithm based on graph-partitioning and iterative correcting. International Journal of Computer Systems Science and Engineering, 24(5).
  13. Zhen, C., Zengji L. Zhiliang, Q., Peng, C., Xiaoming, T., 2005. Balance Routing Traffic in Generalized Shuffle-Exchange Network. Journal of Electronics, 22(4), 345-350.
  14. Bansal, P. K., Singh, K., Joshi, R.C., 1992. Routing and path length algorithm for a cost-effective Four-Tree Multistage Interconnection Network. International Journal of Electronics, 73(1), 107-115.
  15. Bansal, P. K., Joshi, R.C., Singh, K., 1994. On a Fault-tolerant Multistage Interconnection Network. International Journal of Electronics and Electrical Engineering, 20(4), 335-345.
  16. Aggarwal, H., Bansal, P.K., 2002. Routing and Path Length Algorithm for Cost-effective Modified Four Tree Network. IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering, 293-297.
Index Terms

Computer Science
Information Sciences

Keywords

Multistage Interconnection Network Reliability Four Tree Network Fault-tolerance MTTF

Powered by PhDFocusTM