Skip to main content
Top
Published in: Peer-to-Peer Networking and Applications 2/2023

04-03-2023

Fault tolerance designs of interconnection networks

Authors: Muhammad Faisal Nadeem, Muhammad Imran, Hafiz Muhammad Afzal Siddiqui, Muhammad Azeem

Published in: Peer-to-Peer Networking and Applications | Issue 2/2023

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Multiprocessor interconnection networks are mainly required to link a significant number of stable processor memory sets, every one of which is known as a processing vertex. Due to the cost-effectiveness, the design and utilization of multiprocessor interconnection networks have drawn attention lately. An interconnection network is extensively used in a parallel multiprocessor system to connect the processors and memory modules. In multiprocessor networks, vertices represent processors, and each processor of which is subject to complete failure. Fault tolerance is a process that ensures the working of a system to its total capacity, even if one or more of its components fail. In fault-tolerant design, backup components are used in interconnection networks to automatically take the place of the failed component, guaranteeing that the system’s working continues. This paper proposed the fault-tolerant design in the form of \(P_j^k\) and \(C_j^k\) graphs, where n processing components are linked, and i of these n components creating a chain of maximum size, are used to perform the task, they can tolerate the failure of components, maintaining steady operation. In particular, we present the fault-tolerant designs of pyramid, OTIS, biswapped, and mesh-derived networks.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
2.
go back to reference Park JH, Kim HC, Lim HS (2005) Fault-hamiltonicity of hypercube-like interconnection networks, In 19th IEEE International Parallel and Distributed Processing Symposium, p 10 Park JH, Kim HC, Lim HS (2005) Fault-hamiltonicity of hypercube-like interconnection networks, In 19th IEEE International Parallel and Distributed Processing Symposium, p 10
3.
go back to reference Park JH, Lim HS, Kim HC (2007) Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements. Theor Comput Sci 377:170–180MathSciNetCrossRefMATH Park JH, Lim HS, Kim HC (2007) Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements. Theor Comput Sci 377:170–180MathSciNetCrossRefMATH
4.
go back to reference Bistouni F, Jahanshahi M (2015) Pars network: a multistage interconnection network with fault-tolerance capability. J Parallel Distrib Comput 75:168–183CrossRef Bistouni F, Jahanshahi M (2015) Pars network: a multistage interconnection network with fault-tolerance capability. J Parallel Distrib Comput 75:168–183CrossRef
6.
go back to reference Prakash A, Yadav DK (2019) Design and reliability analysis of fault-tolerant shuffle exchange gamma logical neighborhood interconnection network. J Supercomput 75:7934–7951CrossRef Prakash A, Yadav DK (2019) Design and reliability analysis of fault-tolerant shuffle exchange gamma logical neighborhood interconnection network. J Supercomput 75:7934–7951CrossRef
8.
go back to reference Ballesteros A, Barranco M, Proenza J, Almeida L, Pozo F, Palmer-Rodríguez P (2022) An infrastructure for enabling dynamic fault tolerance in highly-reliable adaptive distributed embedded systems based on switched ethernet. Sensors 22(18):7099CrossRef Ballesteros A, Barranco M, Proenza J, Almeida L, Pozo F, Palmer-Rodríguez P (2022) An infrastructure for enabling dynamic fault tolerance in highly-reliable adaptive distributed embedded systems based on switched ethernet. Sensors 22(18):7099CrossRef
9.
go back to reference Choudhary A, Kumar S, Gupta S, Gong M, Mahanti A (2021) FEHCA: A fault-tolerant energy-efficient hierarchical clustering algorithm for wireless sensor networks. Energies 14(13):3935CrossRef Choudhary A, Kumar S, Gupta S, Gong M, Mahanti A (2021) FEHCA: A fault-tolerant energy-efficient hierarchical clustering algorithm for wireless sensor networks. Energies 14(13):3935CrossRef
10.
go back to reference Zhao Z, Wang T, Benbouzid M (2022) A fault-tolerant reconfiguration system based on pilot switch for grid-connected inverters. Microelectron Reliab 131:114511CrossRef Zhao Z, Wang T, Benbouzid M (2022) A fault-tolerant reconfiguration system based on pilot switch for grid-connected inverters. Microelectron Reliab 131:114511CrossRef
11.
go back to reference Park P, Ghadikolaei HS, Fischione C (2021) Proactive fault-tolerant wireless mesh networks for mission-critical control systems. J Netw Comput Appl 186:103082CrossRef Park P, Ghadikolaei HS, Fischione C (2021) Proactive fault-tolerant wireless mesh networks for mission-critical control systems. J Netw Comput Appl 186:103082CrossRef
12.
go back to reference Sahu S, Silakari S (2022) Distributed multilevel k-coverage energy-efficient fault-tolerant scheduling for wireless sensor networks. Wireless Pers Commun 124:2893–2922CrossRef Sahu S, Silakari S (2022) Distributed multilevel k-coverage energy-efficient fault-tolerant scheduling for wireless sensor networks. Wireless Pers Commun 124:2893–2922CrossRef
13.
go back to reference Gallai T (1968) “Problem 4”, in: Theory of Graphs, Proc. Tihany (1966) (ed: P. Erdös & G. Katona), Academic Press, New York, 362 Gallai T (1968) “Problem 4”, in: Theory of Graphs, Proc. Tihany (1966) (ed: P. Erdös & G. Katona), Academic Press, New York, 362
15.
go back to reference Zamfirescu T (2001) Intersecting longest paths or cycles: a short survey. An Univ Craiova Ser Mat Inform 28:1–9MathSciNetMATH Zamfirescu T (2001) Intersecting longest paths or cycles: a short survey. An Univ Craiova Ser Mat Inform 28:1–9MathSciNetMATH
16.
17.
go back to reference Shabbir A, Zamfirescu T (2016) Fault-tolerant designs in triangular lattice networks. Appl Anal 10:447–456MathSciNetMATH Shabbir A, Zamfirescu T (2016) Fault-tolerant designs in triangular lattice networks. Appl Anal 10:447–456MathSciNetMATH
18.
go back to reference Shabbir A, Zamfirescu CT, Zamfirescu TI (2013) Intersecting longest paths and longest cycles: A survey. Electron J Graph Theory Appl 1:56–76MathSciNetCrossRefMATH Shabbir A, Zamfirescu CT, Zamfirescu TI (2013) Intersecting longest paths and longest cycles: A survey. Electron J Graph Theory Appl 1:56–76MathSciNetCrossRefMATH
19.
go back to reference Gao C, He X, Dong H, Liu H, Lyu G (2022) A survey on fault-tolerant consensus control of multi-agent systems: trends, methodologies and prospects. Int J Syst Sci 53(13):2800-2813 Gao C, He X, Dong H, Liu H, Lyu G (2022) A survey on fault-tolerant consensus control of multi-agent systems: trends, methodologies and prospects. Int J Syst Sci 53(13):2800-2813
20.
go back to reference Qu Z, Xu H, Zhao X, Tang H, Wang J, Li B (2022) A fault-tolerant sensor scheduling approach for target tracking in wireless sensor networks. Alexandria Eng J 61(12):13001–13010CrossRef Qu Z, Xu H, Zhao X, Tang H, Wang J, Li B (2022) A fault-tolerant sensor scheduling approach for target tracking in wireless sensor networks. Alexandria Eng J 61(12):13001–13010CrossRef
21.
go back to reference Salam R, Bhattacharya A (2022) Efficient greedy heuristic approach for fault-tolerant distributed controller placement in scalable SDN architecture. Cluster Comput 25:4543–4572CrossRef Salam R, Bhattacharya A (2022) Efficient greedy heuristic approach for fault-tolerant distributed controller placement in scalable SDN architecture. Cluster Comput 25:4543–4572CrossRef
22.
go back to reference Song Y, Zhao J, Sun J (2022) Design of a fault-tolerant system for a multi-motor drive with multiple inverter leg faults. J Power Electron 22:1848–1859CrossRef Song Y, Zhao J, Sun J (2022) Design of a fault-tolerant system for a multi-motor drive with multiple inverter leg faults. J Power Electron 22:1848–1859CrossRef
23.
go back to reference Sun X, Fan J, Cheng B, Liu Z, Yu J (2021) Component conditional fault tolerance of hierarchical folded cubic networks. Theor Comput Sci 883:44–58MathSciNetCrossRefMATH Sun X, Fan J, Cheng B, Liu Z, Yu J (2021) Component conditional fault tolerance of hierarchical folded cubic networks. Theor Comput Sci 883:44–58MathSciNetCrossRefMATH
24.
25.
go back to reference Shabbir A, Zamfirescu T (2016) Gallai’s property for graphs in lattices on the torus and the Möbius strip. Period Math Hung 72:1–11 Shabbir A, Zamfirescu T (2016) Gallai’s property for graphs in lattices on the torus and the Möbius strip. Period Math Hung 72:1–11
26.
27.
go back to reference Leighton FT (2014) Introduction to parallel algorithms and architectures: Arrays trees hypercubes. ElsevierMATH Leighton FT (2014) Introduction to parallel algorithms and architectures: Arrays trees hypercubes. ElsevierMATH
28.
go back to reference Quinn MJ (1987) Designing efficient algorithms for parallel computers. McGraw-HillMATH Quinn MJ (1987) Designing efficient algorithms for parallel computers. McGraw-HillMATH
29.
go back to reference Levialdi S (1985) A Pyramid Project Using Integrated Technology, Integrated Technology for Parallel Image Processing, S. Levialdi, ed. New York: Academic Press Levialdi S (1985) A Pyramid Project Using Integrated Technology, Integrated Technology for Parallel Image Processing, S. Levialdi, ed. New York: Academic Press
31.
go back to reference Hoseinyfarahabady MR, Sarbazi-Azad H (2006) The grid-pyramid: A generalized pyramid network. J Supercomput 37:23–45CrossRef Hoseinyfarahabady MR, Sarbazi-Azad H (2006) The grid-pyramid: A generalized pyramid network. J Supercomput 37:23–45CrossRef
32.
go back to reference Marsden GC, Marchand PJ, Harvey P, Esener SC (1993) Optical transpose interconnection system architectures. Opt Lett 18:1083-1085 Marsden GC, Marchand PJ, Harvey P, Esener SC (1993) Optical transpose interconnection system architectures. Opt Lett 18:1083-1085
33.
go back to reference Sahni S, Wang CF (1997) BPC Permutations on the OTIS-mesh Optoelectronic Computer, In proceedings of the fourth international conference on massively parallel processing using optical interconnections, pp 130–135 Sahni S, Wang CF (1997) BPC Permutations on the OTIS-mesh Optoelectronic Computer, In proceedings of the fourth international conference on massively parallel processing using optical interconnections, pp 130–135
34.
go back to reference Osterloh A (2000) Sorting on the OTIS-Mesh. In: Proceedings 14th International Parallel and Distributed Processing Symposium, IPDPS, IEEE, pp 269–274 Osterloh A (2000) Sorting on the OTIS-Mesh. In: Proceedings 14th International Parallel and Distributed Processing Symposium, IPDPS, IEEE, pp 269–274
35.
go back to reference Rajasekaran S, Sahni S (1998) Randomized routing, selection, and sorting on the OTIS-mesh. IEEE T Parall Distr 9:833–840CrossRef Rajasekaran S, Sahni S (1998) Randomized routing, selection, and sorting on the OTIS-mesh. IEEE T Parall Distr 9:833–840CrossRef
36.
go back to reference Wang CF (1998) Algorithms for the OTIS optoelectronic computer, University of Florida Wang CF (1998) Algorithms for the OTIS optoelectronic computer, University of Florida
37.
go back to reference Wang CF, Sahni S (2000) Image processing on the OTIS-mesh optoelectronic computer. IEEE T Parall Distr 11:97–109CrossRef Wang CF, Sahni S (2000) Image processing on the OTIS-mesh optoelectronic computer. IEEE T Parall Distr 11:97–109CrossRef
38.
go back to reference Xiao W, Chen W, He M, Wei W, Parhami B (2007) Biswapped networks and their topological properties. In: Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, pp 193–198 Xiao W, Chen W, He M, Wei W, Parhami B (2007) Biswapped networks and their topological properties. In: Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, pp 193–198
39.
go back to reference Imran M, Hayat S, Mailk MYH (2014) On topological indices of certain interconnection networks. Appl Math Comput 244:936–951MathSciNetMATH Imran M, Hayat S, Mailk MYH (2014) On topological indices of certain interconnection networks. Appl Math Comput 244:936–951MathSciNetMATH
Metadata
Title
Fault tolerance designs of interconnection networks
Authors
Muhammad Faisal Nadeem
Muhammad Imran
Hafiz Muhammad Afzal Siddiqui
Muhammad Azeem
Publication date
04-03-2023
Publisher
Springer US
Published in
Peer-to-Peer Networking and Applications / Issue 2/2023
Print ISSN: 1936-6442
Electronic ISSN: 1936-6450
DOI
https://doi.org/10.1007/s12083-023-01462-4

Other articles of this Issue 2/2023

Peer-to-Peer Networking and Applications 2/2023 Go to the issue

Premium Partner