Reconfigurability and reliability of systolic/wavefront arrays

The authors study fault-tolerant redundant structures for maintaining reliable arrays. In particular, they assume that the desired array (application graph) is embedded in a certain class of regular, bounded-degree graphs called dynamic graphs. The degree of reconfigurability (DR) and DR with distan...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on computers Ročník 42; číslo 7; s. 854 - 862
Hlavní autoři: Sha, E.H.-M., Steiglitz, K.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.07.1993
Institute of Electrical and Electronics Engineers
Témata:
Aerospace electronics
Applied sciences
Computer architecture
Computer science
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Fault tolerance
Maintenance
Runtime
Signal processing algorithms
Software
Switches
Systolic arrays
Throughput
Systolic array
Fault tolerance
Wavefront array
Parallelism
Reliability
Dynamic graph
Reconfiguration
ISSN:0018-9340
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The authors study fault-tolerant redundant structures for maintaining reliable arrays. In particular, they assume that the desired array (application graph) is embedded in a certain class of regular, bounded-degree graphs called dynamic graphs. The degree of reconfigurability (DR) and DR with distance (DR/sup d/) of a redundant graph are defined. When DR and DR/sup d/ are independent of the size of the application graph, the graph is finitely reconfigurable (FR) and locally reconfigurable (LR), respectively. It is shown that DR provides a natural lower bound on the time complexity of any distributed reconfiguration algorithm and that there is no difference between being FR and LR on dynamic graphs. It is also shown that if both local reconfigurability and a fixed level of reliability are to be maintained, a dynamic graph must be of a dimension at least one greater than the application graph. Thus, for example, a one-dimensional systolic array cannot be embedded in a one-dimensional dynamic graph without sacrificing either reliability or locality of reconfiguration.< >
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
DOI:10.1109/12.237725