Lossless Fault-Tolerant Data Structures with Additive Overhead

被引：0
|
作者：
Christiano, Paul [1 ]
Demaine, Erik D. [1 ]
Kishore, Shaunak [1 ]
机构：
[1] MIT, Comp Sci & Artificial Intelligence Lab, 32 Vassar St, Cambridge, MA 02139 USA
来源：
ALGORITHMS AND DATA STRUCTURES | 2011年 / 6844卷
基金：
新加坡国家研究基金会;
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We develop the first dynamic data structures that tolerate delta memory faults, lose no data, and incur only an (O) over tilde(delta) additive overhead in overall space and time per operation. We obtain such data structures for arrays, linked lists, binary search trees, interval trees, predecessor search, and suffix trees. Like previous data structures, delta must be known in advance, but we show how to restore pristine state in linear time, in parallel with queries, making delta just a bound on the rate of memory faults. Our data structures require Theta(delta) words of safe memory during an operation, which may not be theoretically necessary but seems a practical assumption.
引用
收藏
页码：243 / +
页数：3
相关论文
共 50 条
  • [41] ON THE SYNTHESIS OF FAULT-TOLERANT STRUCTURES OF COMMUNICATION-NETWORKS
    PEREGUDA, AI
    POVJAKALO, AA
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1987, (04): : 22 - 23
  • [42] Automatic insertion of fault-tolerant structures at the RT level
    Entrena, L
    López, C
    Olías, E
    SEVENTH IEEE INTERNATIONAL ON-LINE TESTING WORKSHOP, PROCEEDINGS, 2001, : 48 - 50
  • [43] MECHANISM FOR EVALUATING THE EFFECTIVENESS OF SOFTWARE FAULT-TOLERANT STRUCTURES
    CARPENTER, GF
    MICROPROCESSORS AND MICROSYSTEMS, 1990, 14 (08) : 505 - 510
  • [44] FAULT-TOLERANT TECHNIQUES FOR VLSI TREE-STRUCTURES
    PIURI, V
    STEFANELLI, R
    MICROPROCESSING AND MICROPROGRAMMING, 1992, 34 (1-5): : 97 - 102
  • [45] High-threshold and low-overhead fault-tolerant quantum memory
    Bravyi, Sergey
    Cross, Andrew W.
    Gambetta, Jay M.
    Maslov, Dmitri
    Rall, Patrick
    Yoder, Theodore J.
    NATURE, 2024, 627 (8005)
  • [46] Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays
    Xu, Qian
    Ataides, J. Pablo Bonilla
    Pattison, Christopher A.
    Raveendran, Nithin
    Bluvstein, Dolev
    Wurtz, Jonathan
    Vasic, Bane
    Lukin, Mikhail D.
    Jiang, Liang
    Zhou, Hengyun
    NATURE PHYSICS, 2024, 20 (07) : 1084 - 1090
  • [47] Efficient implementation of fault-tolerant data structures in PC-based control software
    Short, Michael
    ICINCO 2007: PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS, VOL SPSMC: SIGNAL PROCESSING, SYSTEMS MODELING AND CONTROL, 2007, : 214 - 219
  • [48] Fault Tolerant Approximate BFS Structures with Additive Stretch
    Parter, Merav
    Peleg, David
    ALGORITHMICA, 2020, 82 (12) : 3458 - 3491
  • [49] Fault Tolerant Approximate BFS Structures with Additive Stretch
    Merav Parter
    David Peleg
    Algorithmica, 2020, 82 : 3458 - 3491
  • [50] FAIL-MPI: How fault-tolerant is fault-tolerant MPI?
    Hoarau, William
    Lemarinier, Pierre
    Herault, Thomas
    Rodriguez, Eric
    Tixeuil, Sebastien
    Cappello, Franck
    2006 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING, VOLS 1 AND 2, 2006, : 133 - +
12345