Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting

被引:0
|
作者
Kopelowitz, Tsvi [1 ]
Talmon, Nimrod [1 ]
机构
[1] Weizmann Inst Sci, IL-76100 Rehovot, Israel
来源
关键词
INDUCED SOFT ERRORS;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The selection problem, where one wishes to locate the kth smallest element in an unsorted array of size n, is one of the basic problems studied in computer science. The main focus of this work is designing algorithms for solving the selection problem in the presence of memory faults. Specifically, the computational model assumed here is a faulty variant of the RAM model (abbreviated as FRAM), which was introduced by Finocchi and Italiano [FI04]. In this model, the content of memory cells might get corrupted adversarially during the execution, and the algorithm cannot distinguish between corrupted cells and uncorrupted cells. The model assumes a constant number of reliable memory cells that never become corrupted, and an upper bound delta on the number of corruptions that may occur, which is given as an auxiliary input to the algorithm. The main contribution of this work is a deterministic resilient selection algorithm with optimal O(n) worst-case running time. Interestingly, the running time does not depend on the number of faults, and the algorithm does not need to know delta. As part of the solution, several techniques that allow to sometimes use non-tail recursion algorithms in the FRAM model are developed. Notice that using recursive algorithms in this model is problematic, as the stack might be too large to fit in reliable memory. The aforementioned resilient selection algorithm can be used to improve the complexity bounds for resilient k-d trees developed by Gieseke, Moruz and Vahrenhold [GMV10]. Specifically, the time complexity for constructing a k-d tree is improved from O(n log(2) n + delta(2)) to O(n log n). Besides the deterministic algorithm, a randomized resilient selection algorithm is developed, which is simpler than the deterministic one, and has O(n + alpha) expected time complexity and O(1) space complexity (i.e., is in-place). This algorithm is used to develop the first resilient sorting algorithm that is in-place and achieves optimal O(n log n + alpha delta) expected running time.
引用
收藏
页码:558 / 567
页数:10
相关论文
共 50 条
  • [1] Optimal resilient sorting and searching in the presence of memory faults
    Finocchi, Irene
    Grandoni, Fabrizio
    Italiano, Giuseppe F.
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 286 - 298
  • [2] Optimal resilient sorting and searching in the presence of memory faults
    Finocchi, Irene
    Grandoni, Fabrizio
    Italiano, Giuseppe F.
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (44) : 4457 - 4470
  • [3] In-Place Sorting
    Geffert, Viliam
    Gajdos, Jozef
    [J]. SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2011, 6543 : 248 - 259
  • [4] Engineering In-place (Shared-memory) Sorting Algorithms
    Axtmann, Michael
    Witt, Sascha
    Ferizovic, Daniel
    Sanders, Peter
    [J]. ACM TRANSACTIONS ON PARALLEL COMPUTING, 2022, 9 (01)
  • [5] In-place suffix sorting
    Franceschini, G.
    Muthukrishnan, S.
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 533 - +
  • [6] In-place sorting with fewer moves
    Katajainen, J
    Pasanen, TA
    [J]. INFORMATION PROCESSING LETTERS, 1999, 70 (01) : 31 - 37
  • [7] SORTING MULTISETS AND VECTORS IN-PLACE
    MUNRO, JI
    RAMAN, V
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 519 : 473 - 480
  • [8] Optimal In-Place Suffix Sorting
    Li, Zhize
    Li, Jian
    Huo, Hongwei
    [J]. 2018 DATA COMPRESSION CONFERENCE (DCC 2018), 2018, : 422 - 422
  • [9] Optimal In-Place Suffix Sorting
    Li, Zhize
    Li, Jian
    Huo, Hongwei
    [J]. STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2018, 2018, 11147 : 268 - 284
  • [10] In-Place Sparse Suffix Sorting
    Prezza, Nicola
    [J]. SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1496 - 1508