Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
暂无分享,去创建一个
Sivan Toledo | Ulrich Meyer | Deepak Ajwani | Itay Malinger | Sivan Toledo | U. Meyer | Deepak Ajwani | Itay Malinger
[1] Kurt Mehlhorn,et al. External-Memory Breadth-First Search with Sublinear I/O , 2002, ESA.
[2] Sang-Won Lee,et al. Design of flash-based DBMS: an in-page logging approach , 2007, SIGMOD '07.
[3] Matteo Frigo,et al. Cache-oblivious algorithms , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[4] Ulrich Meyer,et al. Improved External Memory BFS Implementation , 2007, ALENEX.
[5] Sivan Toledo,et al. Algorithms and data structures for flash memories , 2005, CSUR.
[6] Seongsoo Hong,et al. Real-Time and Embedded Computing Systems and Applications , 2004, Lecture Notes in Computer Science.
[7] Alok Aggarwal,et al. The input/output complexity of sorting and related problems , 1988, CACM.
[8] M. F.,et al. Bibliography , 1985, Experimental Gerontology.
[9] Tei-Wei Kuo,et al. An efficient R-tree implementation over flash-memory storage systems , 2003, GIS '03.
[10] Michael Isard,et al. A design for high-performance flash disks , 2007, OPSR.
[11] David A. Patterson,et al. A new approach to I/O performance evaluation: self-scaling I/O benchmarks, predicted I/O performance , 1994, TOCS.
[12] Andrew V. Goldberg,et al. Computing Point-to-Point Shortest Paths from External Memory , 2005, ALENEX/ANALCO.
[13] Tei-Wei Kuo,et al. An Efficient B-Tree Layer for Flash-Memory Storage Systems , 2003, RTCSA.
[14] Rajeev Raman,et al. Algorithms — ESA 2002 , 2002, Lecture Notes in Computer Science.