Robust Storage Structures for Crash Recovery
IEEE Transactions on Computers - The MIT Press scientific computation series
Local Concurrent Error Detection and Correction in Data Structures Using Virtual Backpointers
IEEE Transactions on Computers
Effect of probabilistic error checking procedures and performability of robust objects
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Design of Multi-Invariant Data Structures for Robust Shared Accesses in Multiprocessor Systems
IEEE Transactions on Software Engineering
| Hi-index | 14.98 |
A helix (k) list is a robust multiply linked list having k pointers in each node. In general, the ith pointer in each node addresses the ith previous node. However, the first pointer in each node addresses the next node, rather than the previous. An algorithm for performing local correction in a helix (k驴3) list is presented. Given the assumption that at most k errors are encountered during any single correction step, this algorithm performs correction whenever possible, and otherwise reports failure. The algorithm generally reports failure only if all k pointers addressing a specific node are damaged, causing this node to become disconnected. However, in a helix (k=3) structure, one specific type of damage that causes disconnection is indistinguishable from alternative damage that does not. This also causes the algorithm to report failure.