Experimental study of compressed stack algorithms in limited memory environments

Jean François Baffier, Yago Diez, Matias Korman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

The compressed stack is a data structure designed by Barba et al. (Algorithmica 2015) that allows to reduce the amount of memory needed by a certain class of algorithms 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 analyse the performance of the compressed stack. In our synthetic experiments, considering di erent test scenarios and using data sizes ranging up to 230 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 di erence 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 hold even in test scenarios specifically designed to be challenging for the compressed stack.

Original languageEnglish
Title of host publication17th Symposium on Experimental Algorithms, SEA 2018
EditorsGianlorenzo D'Angelo
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages19:1-19:13
ISBN (Electronic)9783959770705
DOIs
Publication statusPublished - 2018 Jun 1
Event17th Symposium on Experimental Algorithms, SEA 2018 - L'Aquila, Italy
Duration: 2018 Jun 272018 Jun 29

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume103
ISSN (Print)1868-8969

Conference

Conference17th Symposium on Experimental Algorithms, SEA 2018
CountryItaly
CityL'Aquila
Period18/6/2718/6/29

Keywords

  • Convex hull
  • Implementation
  • Phrases Stack algorithms
  • Time-space trade-o

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Experimental study of compressed stack algorithms in limited memory environments'. Together they form a unique fingerprint.

  • Cite this

    Baffier, J. F., Diez, Y., & Korman, M. (2018). Experimental study of compressed stack algorithms in limited memory environments. In G. D'Angelo (Ed.), 17th Symposium on Experimental Algorithms, SEA 2018 (pp. 19:1-19:13). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 103). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SEA.2018.19