Skip to main content
Article thumbnail
Location of Repository

Selectively Breaking Data Dependences to Improve the . . .

By Kaijie Wu and Ramesh Karri

Abstract

Although algorithm level re-computing techniques can trade-off the fault detection capability vs. time overhead of a Concurrent Error Detection (CED) scheme, they result in 100% time overhead when the strongest CED capability is achieved. Using the idle cycles in the data path to do the re-computation can reduce this time overhead. However, dependences between operations prevent the re-computation from fully utilizing the idle cycles. Deliberately breaking some of these data dependences can further reduce the time overhead associated with algorithm level re-computing. According to the experimental results the proposed technique, it brings time overhead down to 0–60 % while the associated hardware overhead is from 12 % to 50 % depending on the design size

Year: 2003
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.2590
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://ece.uic.edu/~kaijie/pdf... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.