Run-Time error detection in arrays based on the data-dependency graph

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper describes a methodology based on dependency graphs for doing concurrent run-Time error detection in systolic arrays and wavefront processors. It combines the projection method of deriving systolic arrays from dependency graphs with the idea of input-Triggered test-ing. We call the method ITRED, for Input-driven Time-Redundancy Error Detection. Tests arc 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 present the general approach and derive corresponding constraints on the modified dependency graphs that guarantee correctness.

Original languageEnglish
Title of host publicationICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages625-628
Number of pages4
ISBN (Electronic)0780305329
DOIs
StatePublished - 1992
Externally publishedYes
Event1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992 - San Francisco, United States
Duration: 23 Mar 199226 Mar 1992

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume5
ISSN (Print)1520-6149

Conference

Conference1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992
Country/TerritoryUnited States
CitySan Francisco
Period23/03/9226/03/92

Fingerprint

Dive into the research topics of 'Run-Time error detection in arrays based on the data-dependency graph'. Together they form a unique fingerprint.

Cite this