Several families of reconfigurable tree-like architectures, suitable for VLSI implementation, are presented. Such architectures are based on interconnection patterns consisting of complete binary trees with spare links added (between a node and its grandfather and/or cousin) according to various criteria. The aim is to dynamically reconfigure them as (nonbinary) trees. The total silicon area required by these architectures is only a constant factor higher than that of a complete binary tree. They can bear multiple faults in processing elements and/or links and still function with an acceptable performance degradation. An analytical method for evaluating the average performance degradation in the presence of faults is presented. Some basic procedure paradigms that can be easily performed on all the proposed architectures are given. Such paradigms can be effectively used in several applications, including linear programming, dictionary machines, and relational database processing.

RECONFIGURABLE TREE ARCHITECTURES FOR GRACEFULLY DEGRADABLE VLSI SYSTEMS

BONUCCELLI, MAURIZIO ANGELO;
1994

Abstract

Several families of reconfigurable tree-like architectures, suitable for VLSI implementation, are presented. Such architectures are based on interconnection patterns consisting of complete binary trees with spare links added (between a node and its grandfather and/or cousin) according to various criteria. The aim is to dynamically reconfigure them as (nonbinary) trees. The total silicon area required by these architectures is only a constant factor higher than that of a complete binary tree. They can bear multiple faults in processing elements and/or links and still function with an acceptable performance degradation. An analytical method for evaluating the average performance degradation in the presence of faults is presented. Some basic procedure paradigms that can be easily performed on all the proposed architectures are given. Such paradigms can be effectively used in several applications, including linear programming, dictionary machines, and relational database processing.
Bertossi, Aa; Bonuccelli, MAURIZIO ANGELO; Roccetti, M.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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: http://hdl.handle.net/11568/21765
 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