A probabilistic model is proposed that allows one to solve stochastic network reliability problems for tree‐type networks of N nodes, taking O(log N) time. The considered networks are based on interconnection patterns consisting of complete binary trees in which spare edges are added according to different criteria. We show that the use of this probabilistic model allows one to evaluate, taking O(log N) time, The average connectedness (i.e., The expected number of processing elements still functioning in the presence of random faults) of dynamically reconfigurable fault‐tolerant VLSI systems which are based on such tree‐based structures. Finally, numerical results obtained from the model are provided that show that, given a fixed chip silicon area, several of the analyzed VLSI architectures have a notably greater expected number of working processing elements w.r.t. complete binary trees, in the presence of a given fault distribution. Copyright © 1995 Wiley Periodicals, Inc., A Wiley Company

Roccetti M. (1995). Reliability analysis of tree‐based networks and its application to fault‐tolerant VLSI systems. NETWORKS, 26(4), 217-230 [10.1002/net.3230260406].

Reliability analysis of tree‐based networks and its application to fault‐tolerant VLSI systems

Roccetti M.
1995

Abstract

A probabilistic model is proposed that allows one to solve stochastic network reliability problems for tree‐type networks of N nodes, taking O(log N) time. The considered networks are based on interconnection patterns consisting of complete binary trees in which spare edges are added according to different criteria. We show that the use of this probabilistic model allows one to evaluate, taking O(log N) time, The average connectedness (i.e., The expected number of processing elements still functioning in the presence of random faults) of dynamically reconfigurable fault‐tolerant VLSI systems which are based on such tree‐based structures. Finally, numerical results obtained from the model are provided that show that, given a fixed chip silicon area, several of the analyzed VLSI architectures have a notably greater expected number of working processing elements w.r.t. complete binary trees, in the presence of a given fault distribution. Copyright © 1995 Wiley Periodicals, Inc., A Wiley Company
1995
Roccetti M. (1995). Reliability analysis of tree‐based networks and its application to fault‐tolerant VLSI systems. NETWORKS, 26(4), 217-230 [10.1002/net.3230260406].
Roccetti M.
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/895098
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact