EagleTree: Exploring the Design Space of SSD-Based Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

EagleTree: Exploring the Design Space of SSD-Based Algorithms


Solid State Drives (SSDs) are a moving target for system designers: they are black boxes, their internals are undocumented, and their performance characteristics vary across models. There is no appropriate analytical model and experimenting with commercial SSDs is cumbersome, as it requires a careful experimental methodology to ensure repeatability. Worse, performance results obtained on a given SSD cannot be generalized. Overall, it is impossible to explore how a given algorithm, say a hash join or LSM-tree insertions, leverages the intrinsic parallelism of a modern SSD, or how a slight change in the internals of an SSD would impact its overall performance. In this paper, we propose a new SSD simulation framework, named EagleTree, which addresses these problems, and enables a principled study of SSD-Based algorithms. The demonstration scenario illustrates the design space for algorithms based on an SSD-based IO stack, and shows how researchers and practitioners can use EagleTree to perform tractable explorations of this complex design space.
Fichier principal
Vignette du fichier
EagleTreeDemo.pdf (801.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00935797 , version 1 (24-01-2014)



Niv Dayan, Martin Kjaer Svendsen, Matias Bjorling, Philippe Bonnet, Luc Bouganim. EagleTree: Exploring the Design Space of SSD-Based Algorithms. 39th International Conference on Very Large Data Bases (VLDB) (Demonstration Track), Aug 2013, Trento, Italy. ⟨hal-00935797⟩
209 View
163 Download



Gmail Facebook Twitter LinkedIn More