“School of Computer Science”
Back to Papers HomeBack to Papers of School of Computer Science
| Paper IPM / Computer Science / 11121 |
|
||||||
| Abstract: | |||||||
|
Data integrity of words coming out of the caches needsto be checked to assure their correctness. This paperproposes a cache placement scheme, which provides highperformance as well as high fault detection coverage. Inthis scheme, the cache space is divided into sets ofdifferent sizes. Here, the length of tag fields associated toeach set is unique and is different from the other sets. Theother remained bits of tags are used for protecting the tagusing a fault detection scheme e.g., generalized parity.This leads to protect the cache without compromisingperformance and area with respect to the similar one,fully associative cache. The results obtained fromsimulating some standard trace files reveal that theproposed scheme exhibits a performance near to fullyassociative but achieves a considerable fault detectioncoverage which is suitable to be used in the dependable computing.
Download TeX format |
|||||||
| back to top | |||||||
