Javascript must be enabled to continue!
Double Adjacent Error Correction Codes For Ultra Cache Memories Using SEC-DAEC Method
View through CrossRef
Error correction codes are commonly used to protect cache memories from soft errors. As technology feature size scales deeper into sub-nanometer regime, radiation-induced soft error can cause double adjacent error (DAE). Several double adjacent error correction (DAEC) codes have been introduced to address DAEs; however, they miscorrect some nonadjacent double errors. In progress, a class of DAEC orthogonal Latin squares (OLS) codes is introduced to eliminate all miscorrections using the orthogonality property of OLS codes and also reduces the decoding delay time. The main drawback comes from the large number of check bits imposed by the conventional OLS codes.In this paper, two coding approaches are developed based on a modified SEC OLS coding scheme that requires less number of check bits. The first approach is a class of SEC-DED-DAEC codes proposed to reduce the number of check bits compared to the existing SEC-DED-DAEC OLS codes. The second approach is a class of SEC-DAEC codes with a very high-speed decoding process. This approach is designed as a SEC OLS scheme and integrated with new modules for detecting and correcting the DAE error.The evaluation of the proposed SEC-DAEC codes in 45nm ASIC technology shows promising results. The decoding delay for protecting 16, 64, and 256-bit data words is reduced by at least 20% compared to existing SEC-DED and SEC-DAEC codes.
Title: Double Adjacent Error Correction Codes For Ultra Cache Memories Using SEC-DAEC Method
Description:
Error correction codes are commonly used to protect cache memories from soft errors.
As technology feature size scales deeper into sub-nanometer regime, radiation-induced soft error can cause double adjacent error (DAE).
Several double adjacent error correction (DAEC) codes have been introduced to address DAEs; however, they miscorrect some nonadjacent double errors.
In progress, a class of DAEC orthogonal Latin squares (OLS) codes is introduced to eliminate all miscorrections using the orthogonality property of OLS codes and also reduces the decoding delay time.
The main drawback comes from the large number of check bits imposed by the conventional OLS codes.
In this paper, two coding approaches are developed based on a modified SEC OLS coding scheme that requires less number of check bits.
The first approach is a class of SEC-DED-DAEC codes proposed to reduce the number of check bits compared to the existing SEC-DED-DAEC OLS codes.
The second approach is a class of SEC-DAEC codes with a very high-speed decoding process.
This approach is designed as a SEC OLS scheme and integrated with new modules for detecting and correcting the DAE error.
The evaluation of the proposed SEC-DAEC codes in 45nm ASIC technology shows promising results.
The decoding delay for protecting 16, 64, and 256-bit data words is reduced by at least 20% compared to existing SEC-DED and SEC-DAEC codes.
Related Results
Software caching techniques and hardware optimizations for on-chip local memories
Software caching techniques and hardware optimizations for on-chip local memories
Despite the fact that the most viable L1 memories in processors are caches,
on-chip local memories have been a great topic of consideration lately. Local
memories are an interest...
An Efficient Software-Managed Cache Based on Cell Broadband Engine Architecture
An Efficient Software-Managed Cache Based on Cell Broadband Engine Architecture
While the CBEA (Cell Broadband Engine Architecture) offers substantial computational power, its explicit multilevel memory hierarchy poses significant challenges to traditional pro...
Optimized content caching strategies for multi-access edge computing (MEC)-assisted future cellular networks
Optimized content caching strategies for multi-access edge computing (MEC)-assisted future cellular networks
(English) Handling the tsunami of multimedia content is a big challenge for heterogeneous cellular networks.
Serving large volumes of content from the central system to end-users,...
Decoding of block and convolutional codes in rank metric
Decoding of block and convolutional codes in rank metric
Décodage des codes en bloc et des codes convolutifs en métrique rang
Les code en métrique rang attirent l’attention depuis quelques années en raison de leur applica...
VISUALISASI PENGARUH ELEMEN PERANCANGAN CACHE PADA SYMMETRIC MULTIPROCESSORS
VISUALISASI PENGARUH ELEMEN PERANCANGAN CACHE PADA SYMMETRIC MULTIPROCESSORS
[Id]Cache memory merupakan salah satu pokok pembahasan penting dalam matakuliah organisasi dan arsitektur komputer. Akan tetapi, cache tidak dapat diakses dalam proses pembelajaran...
Adjustable block size coherent caches
Adjustable block size coherent caches
Several studies have shown that the performance of coherent caches depends on the relationship between the granularity of sharing and locality exhibited by the program and the cach...
A Hierarchical Cache Architecture-Oriented Cache Management Scheme for Information-Centric Networking
A Hierarchical Cache Architecture-Oriented Cache Management Scheme for Information-Centric Networking
Information-Centric Networking (ICN) typically utilizes DRAM (Dynamic Random Access Memory) to build in-network cache components due to its high data transfer rate and low latency....
On models for performance evaluation and cache resources placement in multi-cache networks
On models for performance evaluation and cache resources placement in multi-cache networks
Sur des modèles pour l'évaluation de performance et le placement des ressources de cache dans les réseaux multi-cache
Au cours des dernières années, les fournisseur...

