Skip to Main content Skip to Navigation
New interface
Poster communications

Efficient Representations for Large Dynamic Sequences in ML

Arthur Charguéraud 1 Mike Rainey 2 
1 CAMUS - Compilation pour les Architectures MUlti-coeurS
Inria Nancy - Grand Est, ICube - Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie
Abstract : The use of sequence containers, including stacks, queues, and double-ended queues, is ubiquitous in programming. When the maximal number of elements is not known in advance, containers need to grow dynamically. For this purpose, most ML programs either rely on lists or vectors. These structures are inefficient, both in terms of time and space usage. We investigate the use of chunked-based data structures. Such structures save a lot of memory and may deliver better performance than classic container data structures. We observe a 2x speedup compared with vectors, and up to a 3x speedup compared with lengthy lists.
Document type :
Poster communications
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download
Contributor : Arthur Charguéraud Connect in order to contact the contributor
Submitted on : Wednesday, December 20, 2017 - 8:20:12 PM
Last modification on : Tuesday, October 25, 2022 - 4:20:40 PM


Files produced by the author(s)


  • HAL Id : hal-01669407, version 1


Arthur Charguéraud, Mike Rainey. Efficient Representations for Large Dynamic Sequences in ML. ML Family Workshop, Sep 2017, Oxford, United Kingdom. 2017. ⟨hal-01669407⟩



Record views


Files downloads