skip to content
Error detection in arrays via dependency graphs Preview this item
ClosePreview this item
Checking...

Error detection in arrays via dependency graphs

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:   Print book : English
Database:WorldCat
Summary:
Abstract: "This paper describes a methodology based on dependency graphs for doing concurrent run-time error detecton in systolic arrays and wavefront processors. It combines the projection method of deriving systolic arrays from dependency graphs with the idea of input- triggered testing. We call the method ITRED, for Input-driven Time- Redundancy Error Detection. Tests are triggered by inserting special symbols in
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: 26626380
Notes: "August 1991."
Description: 26 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 a methodology based on dependency graphs for doing concurrent run-time error detecton in systolic arrays and wavefront processors. It combines the projection method of deriving systolic arrays from dependency graphs with the idea of input- triggered testing. We call the method ITRED, for Input-driven Time- Redundancy Error Detection. Tests are triggered by inserting special symbols in the input, and so the approach gives the user flexibility in trading off throughput for error coverage. Correctness of timing is proved at the dependency graph level. The method requires no extra PE's and little extra hardware.

We propose several variations of the general approach and derive corresponding constraints on the modified dependency graphs that guarantee correctness. One variation performs run-time error correction using majority voting. Examples are given, including a dynamic programming algorithm, convolution, and matrix multiplication."

Reviews

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

Tags

Be the first.

Similar Items

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/26626380> # Error detection in arrays via dependency graphs
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "26626380" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/29019131#Place/princeton_n_j> ; # Princeton, N.J.
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nju> ;
   schema:about <http://id.worldcat.org/fast/946584> ; # Graph theory
   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/29019131#Person/sha_edwin_hsing_mean> ; # Edwin Hsing-Mean Sha
   schema:datePublished "1991" ;
   schema:description "Abstract: "This paper describes a methodology based on dependency graphs for doing concurrent run-time error detecton in systolic arrays and wavefront processors. It combines the projection method of deriving systolic arrays from dependency graphs with the idea of input- triggered testing. We call the method ITRED, for Input-driven Time- Redundancy Error Detection. Tests are triggered by inserting special symbols in the input, and so the approach gives the user flexibility in trading off throughput for error coverage. Correctness of timing is proved at the dependency graph level. The method requires no extra PE's and little extra hardware."@en ;
   schema:description "We propose several variations of the general approach and derive corresponding constraints on the modified dependency graphs that guarantee correctness. One variation performs run-time error correction using majority voting. Examples are given, including a dynamic programming algorithm, convolution, and matrix multiplication.""@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/29019131> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/29019131#Series/technical_report_princeton_university_dept_of_computer_science> ; # Technical report. Princeton University. Dept. of Computer Science ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/29019131#Series/technical_report> ; # Technical report ;
   schema:name "Error detection in arrays via dependency graphs"@en ;
   schema:productID "26626380" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/26626380#PublicationEvent/princeton_n_j_princeton_university_dept_of_computer_science_1991> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/29019131#Agent/princeton_university_dept_of_computer_science> ; # Princeton University, Dept. of Computer Science
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/26626380> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/29019131#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/29019131#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/29019131#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/29019131#Place/princeton_n_j> # Princeton, N.J.
    a schema:Place ;
   schema:name "Princeton, N.J." ;
    .

<http://experiment.worldcat.org/entity/work/data/29019131#Series/technical_report> # Technical report ;
    a bgn:PublicationSeries ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/29019131#Organization/princeton_university_department_of_computer_science> ; # Princeton University. Department of Computer Science.
   schema:hasPart <http://www.worldcat.org/oclc/26626380> ; # Error detection in arrays via dependency graphs
   schema:name "Technical report ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/29019131#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/26626380> ; # Error detection in arrays via dependency graphs
   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://id.worldcat.org/fast/946584> # Graph theory
    a schema:Intangible ;
   schema:name "Graph theory"@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.