Skip to main content
SpringerLink
Log in

Dynamic dependability analysis of shuffle-exchange networks

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

Designing dependable multiprocessor systems requires reliable interconnection networks. Multistage interconnection networks (MINs), including shuffle-exchange networks (SENs), are widely used to establish the desired connection. The failure of these networks can degrade the overall system performance, which may lead to significant losses. In this paper, we propose to formally model and analyze the dynamic dependability aspects of SENs using a combination of dynamic fault trees (DFTs) and dynamic reliability block diagrams (DRBDs) based on higher-order logic (HOL) theorem proving. We propose to integrate these two modeling approaches for efficiently handling the considered formal dependability analysis by leveraging upon the advantages of each method. The soundness of this integration is provided through a formal proof of equivalence between the DFT and DRBD algebras. We utilize the proposed framework to provide the formal DFT and DRBD analyses of three common measures of SENs, namely: terminal, broadcast and network reliability. The proposed approach allowed us to verify generic expressions of probability of failure and reliability of these systems, which can be instantiated with any number of system components and time-to-failure functions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27

Similar content being viewed by others

Data availability

The theories developed during the current study are available at http://hvg.ece.concordia.ca/code/hol/SEN/index.php.

References

  1. Aggarwal R, Kaur L (2008) On reliability analysis of fault-tolerant multistage interconnection networks. Int J Comput Sci Secur 2(4):01–08

    Google Scholar 

  2. Ahmed W, Hasan O (2015) Towards formal fault tree analysis using theorem proving. In: Intelligent computer mathematics, LNCS 9150. Springer, pp 39–54

  3. Avizienis A, Laprie J, Randell B, Landwehr C (2004) Basic concepts and taxonomy of dependable and secure computing. IEEE Trans Dependable Secure Comput 1(1):11–33

    Article  Google Scholar 

  4. Bistouni F, Jahanshahi M (2014) Analyzing the reliability of shuffle-exchange networks using reliability block diagrams. Reliab Eng Syst Saf 132:97–106

    Article  Google Scholar 

  5. Bistouni F, Jahanshahi M (2019) Determining the reliability importance of switching elements in the shuffle-exchange networks. Int J Parallel Emergent Distrib Syst 34(4):448–476

    Article  Google Scholar 

  6. Distefano S, Puliafito A (2007) Dynamic reliability block diagrams vs dynamic fault trees. In: reliability and maintainability symposium. IEEE, pp 71–76

  7. Distefano S, Xing L (2006) A new approach to modeling the system reliability: dynamic reliability block diagrams. In: Reliability and maintainability symposium. IEEE, pp 189–195

  8. Elderhalli Y (2019) Shuffle-exchange network formal dependability analysis: HOL4 script. Concordia University, Canada. http://hvg.ece.concordia.ca/code/hol/SEN/index.php

  9. Elderhalli Y, Ahmad W, Hasan O, Tahar S (2018) Formal probabilistic analysis of dynamic fault trees in HOL4. Tech. rep., Concordia University, Canada. https://arxiv.org/abs/1807.11576

  10. Elderhalli Y, Ahmad W, Hasan O, Tahar S (2019) Probabilistic analysis of dynamic fault trees using HOL theorem proving. J Appl Log 2631(3):469

    MathSciNet  Google Scholar 

  11. Elderhalli Y, Hasan O, Tahar S A (2019) Formally verified algebraic approach for dynamic reliability block diagrams. In: Formal engineering methods, LNCS 11852. Springer, pp 253–269

  12. Elderhalli Y, Hasan O, Tahar S (2019) A formally verified HOL algebra for dynamic reliability block diagrams. Technical report, Concordia University, Canada. http://arxiv.org/abs/1908.01930

  13. Elderhalli Y, Hasan O, Tahar S (2019) A methodology for the formal verification of dynamic fault trees using HOL theorem proving. IEEE Access 7:136176–136192

    Article  Google Scholar 

  14. Elderhalli Y, Volks M, Hasan O, Katoen J, Tahar S (2019) Formal verification of rewriting rules for dynamic fault trees. In: Software engineering and formal methods, LNCS 11724. Springer, pp 513–531

  15. Gauthier T, Kaliszyk C, Urban J (2017) TacticToe: learning to reason with HOL4 tactics. In: Logic for programming, artificial intelligence and reasoning, vol 46, pp 125–143

  16. Gunawan I (2008) Redundant paths and reliability bounds in gamma networks. Appl Math Model 32(4):588–594

    Article  MathSciNet  Google Scholar 

  17. Gunawan I (2013) Reliability prediction of distributed systems using Monte Carlo method. Int J Reliab Saf 7(3):235–248

    Article  Google Scholar 

  18. Hasan O, Ahmed W, Tahar S, Hamdi MS (2015) Reliability block diagrams based analysis: a survey. In: International conference of numerical analysis and applied maths, vol 1648, p 850129. AIP

  19. Hennessy J, Patterson D (2011) Computer architecture: a quantitative approach. Elsevier, Amsterdam

    Google Scholar 

  20. Jeng M, Siegel H (1986) A fault-tolerant multistage interconnection network for multiprocessor systems using dynamic redundancy. In: International conference on distributed computing systems. IEEE, pp 70–77

  21. Kumar V, Reddy S (1988) Fault-tolerant multistage interconnection networks for multiprocessor systems. In: Concurrent computations. Springer, pp 495–523

  22. MATLAB (2017) 2017a, The MathWorks, Natick

  23. Merle G (2010) Algebraic modelling of dynamic fault trees, contribution to qualitative and quantitative analysis. Ph.D. thesis, ENS, France

  24. Mhamdi T (2012) Information-theoretic analysis using theorem proving. Ph.D. thesis, Concordia University, Montreal, QC, Canada

  25. Mhamdi T, Hasan O, Tahar S (2010) On the formalization of the Lebesgue integration theory in HOL. In: Interactive theorem proving, LNCS 6172. Springer, pp 387–402

  26. Mhamdi T, Hasan O, Tahar S (2011) Formalization of entropy measures in HOL. In: Interactive theorem proving, LNCS 6898. Springer, pp 233–248

  27. Nipkow T, Wenzel M, Paulson LC (2002) Isabelle/HOL: a proof assistant for higher-order logic. Springer, Berlin

    Book  Google Scholar 

  28. Panda D, Dash R, Mishra A, Mohapatra S (2018) Reliability evaluation and analysis of multistage interconnection networks. Int J Pure Appl Math 119(14):1729–1737

    Google Scholar 

  29. Qasim M, Hasan O, Elleuch M, Tahar S (2016) Formalization of normal random variables in HOL. In: Intelligent computer mathematics, LNCS 9791. Springer, pp 44–59

  30. Rajkumar S, Goyal N (2016) Review of multistage interconnection networks reliability and fault-tolerance. IETE Tech Rev 33(3):223–230

    Article  Google Scholar 

  31. Ruijters E, Stoelinga M (2015) Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools. Comput Sci Rev 15–16:29–62

    Article  MathSciNet  Google Scholar 

  32. Stamatelatos M, Vesely W, Dugan J, Fragola J, Minarick J, Railsback J (2002) Fault tree handbook with aerospace applications. NASA Office of Safety and Mission Assurance

  33. Yunus N, Othman M (2015) Reliability evaluation for shuffle exchange interconnection network. Procedia Comput Sci 59:162–170

    Article  Google Scholar 

  34. Yunus N, Othman M, Hanapi Z, Kweh Y (2019) Evaluation of replication method in shuffle-exchange network reliability performance. In: Advances in data and information sciences. Springer, pp 271–281

  35. Yunus N, Othman M, Hanapi Z, Lun K (2016) Reliability review of interconnection networks. IETE Tech Rev 33(6):596–606

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Concordia University, Montreal, QC, Canada

    Yassmeen Elderhalli, Osman Hasan & Sofiène Tahar

Authors
  1. Yassmeen Elderhalli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Osman Hasan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sofiène Tahar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yassmeen Elderhalli.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Elderhalli, Y., Hasan, O. & Tahar, S. Dynamic dependability analysis of shuffle-exchange networks. Form Methods Syst Des 62, 285–325 (2024). https://doi.org/10.1007/s10703-024-00448-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10703-024-00448-z

Keywords

Search

Navigation