arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.04708cs.DScs.CG
收藏

有限内存环境下压缩栈算法的实验研究

Experimental Study of Compressed Stack Algorithms in Limited Memory Environments

Jean-François Baffier, Yago Diez, Matias Korman

摘要:

{ \em compressed stack}是由Barba { \em et al.}设计的数据结构。(Rummica 2015),它允许减少算法所需的内存量(以增加其运行时间为代价)。在本文中,我们介绍了这种数据结构的第一个实现,并公开其源代码。并结合具体实现对压缩栈的性能进行了分析。在我们的合成实验中,考虑到不同的测试场景,并使用数据大小范围高达$2^{30}$元素,我们比较它与经典的(未压缩的)堆栈,无论是在运行时间和内存使用。我们的实验表明,压缩堆栈需要的内存比通常的堆栈少得多(这种差异对于包含$2000$或更多元素的输入是显着的)。总的来说,通过正确选择参数,我们可以节省大量的空间(从两到四个数量级),同时运行时间略有增加($2.32$平均比经典堆栈慢$2.32$倍)。这些结果甚至在专门设计为对压缩堆栈具有挑战性的测试场景中也成立。

英文摘要:

The {\em compressed stack} is a data structure designed by Barba {\em et al.} (Algorithmica 2015) that allows to reduce the amount of memory needed by an algorithm (at the cost of increasing its runtime). In this paper we introduce the first implementation of this data structure and make its source code publicly available. Together with the implementation we analyze the performance of the compressed stack. In our synthetic experiments, considering different test scenarios and using data sizes ranging up to $2^{30}$ elements, we compare it with the classic (uncompressed) stack, both in terms of runtime and memory used. Our experiments show that the compressed stack needs significantly less memory than the usual stack (this difference is significant for inputs containing $2000$ or more elements). Overall, with a proper choice of parameters, we can save a significant amount of space (from two to four orders of magnitude) with a small increase in the runtime ($2.32$ times slower on average than the classic stack). These results holds even in test scenarios specifically designed to be challenging for the compressed stack.

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

↑