Sciweavers

298 search results - page 1 / 60
» Competitive Analysis of Flash-Memory Algorithms
Sort
View
ESA
2006
Springer
90views Algorithms» more  ESA 2006»
13 years 8 months ago
Competitive Analysis of Flash-Memory Algorithms
Avraham Ben-Aroya, Sivan Toledo
DAMON
2008
Springer
13 years 6 months ago
Modeling the performance of algorithms on flash memory devices
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
Kenneth A. Ross
GIS
2003
ACM
14 years 5 months ago
An efficient r-tree implementation over flash-memory storage systems
For many applications with spatial data management such as Geographic Information Systems (GIS), block-oriented access over flash memory could introduce a significant number of no...
Chin-Hsien Wu, Li-Pin Chang, Tei-Wei Kuo
DASFAA
2011
IEEE
250views Database» more  DASFAA 2011»
12 years 8 months ago
An FTL-Agnostic Layer to Improve Random Write on Flash Memory
Flash memories are considered a competitive alternative to rotating disks as non-volatile data storage for database management systems. However, even if the Flash Translation Layer...
Brice Chardin, Olivier Pasteur, Jean-Marc Petit
WEA
2009
Springer
165views Algorithms» more  WEA 2009»
13 years 9 months ago
On Computational Models for Flash Memory Devices
Flash memory-based solid-state disks are fast becoming the dominant form of end-user storage devices, partly even replacing the traditional hard-disks. Existing two-level memory hi...
Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulric...