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:   Print 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


Primary Entity

<http://www.worldcat.org/oclc/24156663> # Reconfigurability and reliability of systolic/wavefront arrays
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "24156663" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nju> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/25823713#Place/princeton_n_j> ; # Princeton, N.J.
    schema:about <http://id.worldcat.org/fast/921988> ; # Fault-tolerant computing
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/6157742> ; # Kenneth Steiglitz
    schema:creator <http://experiment.worldcat.org/entity/work/data/25823713#Person/sha_edwin_hsing_mean> ; # Edwin Hsing-Mean Sha
    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 <http://experiment.worldcat.org/entity/work/data/25823713#Series/technical_report> ; # Technical report ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/25823713#Series/technical_report_princeton_university_dept_of_computer_science> ; # Technical report. Princeton University. Dept. of Computer Science ;
    schema:name "Reconfigurability and reliability of systolic/wavefront arrays"@en ;
    schema:productID "24156663" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/24156663#PublicationEvent/princeton_n_j_princeton_university_dept_of_computer_science_1990> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/25823713#Agent/princeton_university_dept_of_computer_science> ; # Princeton University, Dept. of Computer Science
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/24156663> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/25823713#Agent/princeton_university_dept_of_computer_science> # Princeton University, Dept. of Computer Science
    a bgn:Agent ;
    schema:name "Princeton University, Dept. of Computer Science" ;
    .

<http://experiment.worldcat.org/entity/work/data/25823713#Organization/princeton_university_department_of_computer_science> # Princeton University. Department of Computer Science.
    a schema:Organization ;
    schema:name "Princeton University. Department of Computer Science." ;
    .

<http://experiment.worldcat.org/entity/work/data/25823713#Person/sha_edwin_hsing_mean> # Edwin Hsing-Mean Sha
    a schema:Person ;
    schema:familyName "Sha" ;
    schema:givenName "Edwin Hsing-Mean" ;
    schema:name "Edwin Hsing-Mean Sha" ;
    .

<http://experiment.worldcat.org/entity/work/data/25823713#Place/princeton_n_j> # Princeton, N.J.
    a schema:Place ;
    schema:name "Princeton, N.J." ;
    .

<http://experiment.worldcat.org/entity/work/data/25823713#Series/technical_report> # Technical report ;
    a bgn:PublicationSeries ;
    schema:creator <http://experiment.worldcat.org/entity/work/data/25823713#Organization/princeton_university_department_of_computer_science> ; # Princeton University. Department of Computer Science.
    schema:hasPart <http://www.worldcat.org/oclc/24156663> ; # Reconfigurability and reliability of systolic/wavefront arrays
    schema:name "Technical report ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/25823713#Series/technical_report_princeton_university_dept_of_computer_science> # Technical report. Princeton University. Dept. of Computer Science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/24156663> ; # Reconfigurability and reliability of systolic/wavefront arrays
    schema:name "Technical report. Princeton University. Dept. of Computer Science ;" ;
    .

<http://id.worldcat.org/fast/921988> # Fault-tolerant computing
    a schema:Intangible ;
    schema:name "Fault-tolerant computing"@en ;
    .

<http://viaf.org/viaf/6157742> # Kenneth Steiglitz
    a schema:Person ;
    schema:birthDate "1939" ;
    schema:familyName "Steiglitz" ;
    schema:givenName "Kenneth" ;
    schema:name "Kenneth Steiglitz" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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