Data movement in flash memories

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 1031-1038

  Jiang, Anxiao ^a   Langberg, Michael ^b   Mateescu, Robert ^c   Bruck, Jehoshua ^d  

^a Texas AandM University   (United States)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

^c California Institute of Technology   (United States)

^d CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING COMPLEXITY; CODING SCHEME; DATA MOVEMENTS; FLASH STORAGE; LOWER BOUNDS; NAND FLASH MEMORY; NON-VOLATILE MEMORIES; NP-HARDNESS; NUMBER OF BLOCKS; OPTIMAL DATA;

OPTIMIZATION;

FLASH MEMORY;

EID: 77949621542     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394879     Document Type: Conference Paper

References (13)

1. N. Alon, "A simple algorithm for edge-coloring bipartite multigraphs," in Inf. Process. Lett., vol. 85, no. 6, pp. 301-302, 2003.
2. B. Bollobás, Random Graphs. Cambridge University Press, 2001.
3. G. Even, J. Naor, B. Schieber and M. Sudan, "Approximating minimum feedback sets and multi-cuts in directed graphs," in Proc. 4th Int. Conf. on Integer Prog. and Combinatorial Optimization, Lecture Notes in Comput. Sci. 920, Springer-Verlag, pp. 14-28, 1995.
4. H. Finucane, Z. Liu, and M. Mitzenmacher, "Designing floating codes for expected performance," in Proc. Annual Allerton Conference, 2008.
5. E. Gal and S. Toledo, "Algorithms and data structures for flash memories," ACM Computing Surveys, vol. 37, no. 2, pp. 138-163, 2005.
6. A. Jiang, V. Bohossian, and J. Bruck, "Floating codes for joint information storage in write asymmetric memories," in Proc. IEEE Int. Symp. on Information Theory (ISIT), Nice, France, Jun. 2007, pp. 1166-1170.
7. A. Jiang, M. Langberg, R. Mateescu and J. Bruck, "Data movement in flash memories," Caltech Technical Report, online: http : //www.paradise.caltech.edu/papers/etr097.pdf .
8. A. Jiang, M. Langberg, M. Schwartz and J. Bruck, "Universal rewriting in constrained memories," in Proc. IEEE International Symposium on Information Theory (ISIT), Seoul, Korea, 2009, pp. 1219-1223.
9. A. Jiang, H. Li and Y. Wang, "Error scrubbing codes for flash memories," Proc. Canadian Workshop on Inform. Theory (CWIT), Ottawa, Canada, May 2009, pp. 32-35.
10. A. Jiang, R. Mateescu, M. Schwartz and J. Bruck, "Rank modulation for flash memories," in IEEE Transactions on Information Theory, vol. 55, no. 6, pp. 2659-2673, June 2009.
11. A. Jiang, R. Mateescu, E. Yaakobi, J. Bruck, P. Siegel, A. Vardy and J. Wolf, "Storage coding for wear leveling in flash memories," in Proc. IEEE Int. Symp. on Inform. Theory (ISIT), 2009, pp. 1229-1233.
12. A. Jiang, M. Schwartz and J. Bruck, "Error-correcting codes for rank modulation," Proc. IEEE International Symposium on Information Theory (ISIT), Toronto, Canada, July 2008, pp. 1736-1740.
13. E. Yaakobi, A. Vardy, P. H. Siegel, and J. K. Wolf, " Multidimensional flash codes," in Proc. of the Annual Allerton Conference, 2008.