skip to content
Reconfigurability and reliability of systolic/wavefront arrays Preview this item
ClosePreview this item
Checking...

Reconfigurability and reliability of systolic/wavefront arrays

Author: Edwin Hsing-Mean Sha; Kenneth Steiglitz
Publisher: Princeton, N.J. : Princeton University, Dept. of Computer Science, [1990]
Series: Princeton University.; Department of Computer Science.; Technical report
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "In this paper we study fault-tolerant redundant structures for maintaining reliable arrays. In particular we assume the desired array (application graph) is embedded in a certain class of regular, bounded-degree graphs called dynamic graphs. We define the degree of reconfigurability DR, and DR with distance DR[superscript d], of a redundant graph. When DR (respectively DR[superscript d]) is independent of
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: 24156663
Notes: "August 1990."
Description: 28 pages : illustrations ; 28 cm.
Series Title: Princeton University.; Department of Computer Science.; Technical report
Responsibility: Edwin Hsing-Mean Sha, Kenneth Steiglitz.

Abstract:

Abstract: "In this paper we study fault-tolerant redundant structures for maintaining reliable arrays. In particular we assume the desired array (application graph) is embedded in a certain class of regular, bounded-degree graphs called dynamic graphs. We define the degree of reconfigurability DR, and DR with distance DR[superscript d], of a redundant graph. When DR (respectively DR[superscript d]) is independent of the size of the application graph, we say the graph is finitely reconfigurable, FR (resp. locally reconfigurable, LR).

We show 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. We then show that if we wish to maintain both local reconfigurability, and a fixed level of reliability, a dynamic graph must be of 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."

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/24156663>
library:oclcnum"24156663"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:contributor
schema:creator
schema:datePublished"1990"
schema:description"We show 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. We then show that if we wish to maintain both local reconfigurability, and a fixed level of reliability, a dynamic graph must be of 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.""@en
schema:description"Abstract: "In this paper we study fault-tolerant redundant structures for maintaining reliable arrays. In particular we assume the desired array (application graph) is embedded in a certain class of regular, bounded-degree graphs called dynamic graphs. We define the degree of reconfigurability DR, and DR with distance DR[superscript d], of a redundant graph. When DR (respectively DR[superscript d]) is independent of the size of the application graph, we say the graph is finitely reconfigurable, FR (resp. locally reconfigurable, LR)."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/25823713>
schema:inLanguage"en"
schema:isPartOf
schema:name"Reconfigurability and reliability of systolic/wavefront arrays"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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