arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1305.3828cs.DS
收藏

在弹性算法和数据结构中利用非恒定安全存储器

Exploiting non-constant safe memory in resilient algorithms and data structures

Lorenzo De Stefani, Francesco Silvestri

摘要:

我们通过添加任意大小的安全内存$S$来扩展Finocchi和Italiano(2008)的FaithRAM模型,然后我们推导出弹性算法技术的性能和安全内存大小之间的权衡。令$δ$和$α$分别表示在算法执行期间可能发生的最大故障量和实际发生的故障数,其中$α\leq δ$。我们提出了一个弹性算法排序$n$条目,需要$O\left(n\log n+α(δ/S + \log S)\right)$时间,并使用$Θ(S)$安全内存字。我们的算法优于以前的弹性排序算法,不利用可用的安全内存,并需要$O\left(n\log n+ αδ\right)$时间。最后,我们利用我们的排序算法,推导出一个弹性的优先级队列。我们的实现使用$Θ(S)$安全存储器字和$Θ(n)$错误存储器字来存储$n$密钥,并且需要$O\left(\log n + δ/S\right)$为每个插入和删除操作分摊时间。我们的弹性优先级队列提高了现有技术所需的$O\left(\log n + δ\right)$摊销时间。

英文摘要:

We extend the Faulty RAM model by Finocchi and Italiano (2008) by adding a safe memory of arbitrary size $S$, and we then derive tradeoffs between the performance of resilient algorithmic techniques and the size of the safe memory. Let $δ$ and $α$ denote, respectively, the maximum amount of faults which can happen during the execution of an algorithm and the actual number of occurred faults, with $α\leq δ$. We propose a resilient algorithm for sorting $n$ entries which requires $O\left(n\log n+α(δ/S + \log S)\right)$ time and uses $Θ(S)$ safe memory words. Our algorithm outperforms previous resilient sorting algorithms which do not exploit the available safe memory and require $O\left(n\log n+ αδ\right)$ time. Finally, we exploit our sorting algorithm for deriving a resilient priority queue. Our implementation uses $Θ(S)$ safe memory words and $Θ(n)$ faulty memory words for storing $n$ keys, and requires $O\left(\log n + δ/S\right)$ amortized time for each insert and deletemin operation. Our resilient priority queue improves the $O\left(\log n + δ\right)$ amortized time required by the state of the art.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑