This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Local Correction of Helix(k) Lists
May 1989 (vol. 38 no. 5)
pp. 718-724
ASCII Text
x 
 
I.J. Davis, "Local Correction of Helix(k) Lists," IEEE Transactions on Computers, vol. 38, no. 5, pp. 718-724, May, 1989.
 
 
BibTex
x
 
@article{ 10.1109/12.24273,
author = {I.J. Davis},
title = {Local Correction of Helix(k) Lists},
journal ={IEEE Transactions on Computers},
volume = {38},
number = {5},
issn = {0018-9340},
year = {1989},
pages = {718-724},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.24273},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Local Correction of Helix(k) Lists
IS - 5
SN - 0018-9340
SP718
EP724
EPD - 718-724
A1 - I.J. Davis,
PY - 1989
KW - helix(k) lists; robust multiply linked list; pointers; node; algorithm; local correction; errors; failure; damaged; disconnected; data structures; list processing.
VL - 38
JA - IEEE Transactions on Computers
ER -
 
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

[1] J. P. Black, D. J. Taylor, and D. E. Morgan, "An introduction to robust data structures," inDig. Papers: 10th Annu. Int. Symp. Fault-Tolerant Comput., Oct. 1-3, 1980, pp. 110-112.
[2] J. P. Black, D. J. Taylor, and D. E. Morgan, "A compendium of robust data structures," inDig. Papers: 11th Annu. Int. Symp. Fault-Tolerant Comput., June 24-26, 1981, pp. 129-131.
[3] J. P. Black and D. J. Taylor, "Local correctability in robust storage structures," CS-84-44, Dep. Comput. Sci., Univ. of Waterloo, Dec. 1984,IEEE Trans. Software Eng., submitted for publication.
[4] I. J. Davis and D. J. Taylor, "Local correction of mod (k) lists," CS- 85-55, Dep. Comput. Sci., Univ. Waterloo, Dec. 1985.
[5] I. J. Davis, "A locally correctable AVL tree," inDig. Papers: 17th Int. Symp. Fault-Tolerant Comput., July 6-8, 1987, pp. 85-88.
[6] S. C. Seth and R. Muralidhar, "Analysis and design of robust data structures," inDig. Papers: 15th Annu. Int. Symp Fault-Tolerant Comput., June 19-21, 1985, pp. 14-19.
[7] D. J. Taylor, D. E. Morgan, and J. P. Black, "Redundancy in data structures: Some theoretical results,"IEEE Trans. Software Eng., vol. SE-6, pp. 595-602, Nov. 1980.
[8] D. J. Taylor and J. P. Black, "A locally correctable B-tree implementation,"Computer J., vol. 29, pp. 269-276, June 1986.
[9] D. J. Taylor and C. J. Seger, "Robust storage structures for crash recovery,"IEEE Trans. Comput., vol. C-35, pp. 288-295, Apr. 1986.

Index Terms:
helix(k) lists; robust multiply linked list; pointers; node; algorithm; local correction; errors; failure; damaged; disconnected; data structures; list processing.
Citation:
I.J. Davis, "Local Correction of Helix(k) Lists," IEEE Transactions on Computers, vol. 38, no. 5, pp. 718-724, May 1989, doi:10.1109/12.24273
Usage of this product signifies your acceptance of the Terms of Use.