Exploiting Idle Cycles for Algorithm Level Re-Computing

Although algorithm level re-computing techniques can trade-off the detection capability of Concurrent Error Detection (CED) vs. time overhead, it results 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 dependencies between operations prevent the recomputation from fully utilizing the idle cycles. Deliberately breaking some of these data dependencies can further reduce the time overhead associated with

• Type: Conference
• Year: 2002
• Where: DATE
• Authors: Kaijie Wu, Ramesh Karri
• Keywords: DATE 2002, Hardware, Idle Cycles, Strongest Ced Capability, Time Overhead