skip to content
Reliable reconfigurable structures for array architectures Preview this item
ClosePreview this item
Checking...

Reliable reconfigurable structures for array architectures

Author: Edwin Hsing-Mean Sha; Kenneth Steiglitz
Publisher: Princeton, N.J. : Princeton University, Dept. of Computer Science, [1991]
Series: Princeton University.; Department of Computer Science.; Technical report
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "This paper describes some explicit constructions for reconfigurable array architectures. Given a working architecture (application graph), we add redundant hardware to increase reliability. The degree of reconfigurability, DR, of a redundant graph is a measure of the cost of reconfiguration after failures. When DR is independent of the size of the application graph, we say the graph is finitely
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Edwin Hsing-Mean Sha; Kenneth Steiglitz
OCLC Number: 26368465
Notes: "April 1991."
Description: 24 pages : illustrations ; 28 cm.
Series Title: Princeton University.; Department of Computer Science.; Technical report
Responsibility: Edwin Hsing-Mean Sha, Kenneth Steiglitz.

Abstract:

Abstract: "This paper describes some explicit constructions for reconfigurable array architectures. Given a working architecture (application graph), we add redundant hardware to increase reliability. The degree of reconfigurability, DR, of a redundant graph is a measure of the cost of reconfiguration after failures. When DR is independent of the size of the application graph, we say the graph is finitely reconfigurable, FR. We present a class of simple layered graphs with a logarithmic number of redundant edges, which can maintain both finite reconfigurability and a fixed level of reliability for a wide class of application graphs.

By sacrificing finite reconfigurability, we show that by using expanders we can construct highly reliable structures with the asymptotically optimal number of edges for one-dimensional and tree-like array architectures."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/26368465>
library:oclcnum"26368465"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/26368465>
rdf:typeschema:Book
schema:about
<http://id.worldcat.org/fast/872026>
rdf:typeschema:Intangible
schema:name"Computer architecture"@en
schema:name"Computer architecture."@en
schema:about
schema:contributor
schema:creator
schema:datePublished"1991"
schema:description"Abstract: "This paper describes some explicit constructions for reconfigurable array architectures. Given a working architecture (application graph), we add redundant hardware to increase reliability. The degree of reconfigurability, DR, of a redundant graph is a measure of the cost of reconfiguration after failures. When DR is independent of the size of the application graph, we say the graph is finitely reconfigurable, FR. We present a class of simple layered graphs with a logarithmic number of redundant edges, which can maintain both finite reconfigurability and a fixed level of reliability for a wide class of application graphs."@en
schema:description"By sacrificing finite reconfigurability, we show that by using expanders we can construct highly reliable structures with the asymptotically optimal number of edges for one-dimensional and tree-like array architectures.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/28826292>
schema:inLanguage"en"
schema:name"Reliable reconfigurable structures for array architectures"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.