IEMEK Journal of Embedded Systems and Applications (대한임베디드공학회논문지)

Institute of Embedded Engineering of Korea (대한임베디드공학회)
권호 표지
DOI QR코드

DOI QR Code

Study of Hash Collision Resolution Scheme for NAND Flash Memory

NAND Flash 메모리 기반 해시 충돌 처리 기법에 관한 연구

  • Received : 2017.06.03
  • Accepted : 2017.09.26
  • Published : 2017.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we show shortcomings of separate chaining scheme by way of experiments with NAND flash memory and improve the performance with merge chaining scheme which is proposed in this paper. We explain this merge chaining scheme and explain how to improve the performance of search operation. Merge chaining scheme shows better performance at insert and search operation compare to separate chaining scheme.

Keywords

References

  1. E. Gal, S. Toledo, "Algorithms and Data Structures for Flash Memories," ACM Computing Surveys, Vol. 37, No. 2, pp. 138-163, 2005. https://doi.org/10.1145/1089733.1089735
  2. Samsung Electronics Company, K9PDG08U5D datasheet 2G x 8Bit NAND Flash Memory.
  3. S.Y. Kim, S.I. Jung, "A log-based Flash Translation Layer for Large NAND Flash Memory," Proceedings of International Conference on Advanced Communication Technology, Vol. 3, pp. 1641-1644, 2006.
  4. S.W. Lee, D.J. Park, T.S. Chung, D.H. Lee, S. Park, H.J. Song, "A log Buffer-based Flash Translation Layer Using Fully-associative Sector Translation," ACM Transactions on Embedded Computing Systems, Vol. 6, No. 3, 2007.
  5. J. Kim, J.M. Kim, S.H. Noh, S.L. Min, Y. Cho, "A Space-efficient Flash Translation Layer for Compact Flash Systems," IEEE Transactions on Consumer Electronics, Vol. 48, No. 2, pp. 366-375, 2002. https://doi.org/10.1109/TCE.2002.1010143
  6. J.U. Kang, H. Jo, J.S. Kim, J. Lee, "A Superblock-based Flash Translation Layer for NAND Flash Memory," Proceedings of ACM & IEEE International Conference on Embedded software, pp. 161-170, 2006.
  7. D. Woodhouse, "JFFS: The Journaling Flash File System," Ottawa Linux Symposium, 2001.
  8. A. One, "YAFFS: Yet Another Flash File System," 2002.
  9. A Mathur, M. Cao, S. Bhattacharya, A. Dilger, A. Tomas, L. Vivier, "The new ext4 File System: Current Status and Future Plans," Proceedings of Linux Symposium, Vol. 2, pp. 21-33, 2007.
  10. Y.H. Chang, J.W. Hsieh, T.W. Kuo, "Endurance Enhancement of Flash-memory Storage Systems: an Efficient Static Wear Leveling Design," Proceedings of ACM Design Automation Conference, pp. 212-217, 2007.
  11. L.P. Chang, "On Efficient Wear Leveling for Large-scale Flash-memory Storage Systems," Proceedings of ACM symposium on Applied computing, pp. 1126-1130, 2007.
  12. Y. Li, B. He, R.J. Yang, Q. Luo, K. Yi, "Tree Indexing on Solid State Drives," Proceedings of VLDB Endowment, Vol. 3, No. 1-2, pp. 1195-1206. 2010. https://doi.org/10.14778/1920841.1920990
  13. P. O'Neil, E. Cheng, D. Hawlick, E. O'Neil, "The log-structured Merge-tree (LSM-tree)," Springer Acta Informatica, Vol. 33, No. 4, pp. 351-385, 1996. https://doi.org/10.1007/s002360050048
  14. C.H. Wu, L.P. Chang, T.W. Kuo, "An Efficient B-tree Layer for Flash-memory Storage Systems," Springer Real-Time and Embedded Computing Systems and Applications, pp. 409-430, 2004.
  15. E. Malalla, "Two-way Hashing With Separate Chaining and Linear Probing," McGill University, 2004.
  16. X. Li, Z. Da, X. Meng, "A new Dynamic Hash Index for Flash-based Storage," Proceedings of International Conference on Web-Age Information Management, pp. 93-98, 2008.
  17. C.W. Yang, K.Y. Lee, M.H. Kim, Y.J. Lee, "An Efficient Dynamic Hash Index Structure for NAND Flash Memory," IEICE Transactions on fundamentals of electronics, communications and computer sciences, Vol. 92, No.7, pp. 1716-1719, 2009 https://doi.org/10.1587/transfun.E92.A.1716
  18. S.H. Lim, C. Lee, K.H. Park, "Hashing Directory Scheme for NAND Flash File System," Proceedings of International Conference on Advanced Communication Technology, Vol. 1, pp. 273-276, 2007.
  19. B. Pittel, "Linear Probing: the Probable Largest Search Time Grows Logarithmically With the Number of Records," Journal of algorithms, Vol. 8, No. 2, pp. 236-249, 1987. https://doi.org/10.1016/0196-6774(87)90040-X
  20. A. Fiat, M Naor, "Implicit O(1) Probe Search," Proceedings of ACM symposium on Theory of computing, pp. 336-344, 1989.
  21. M. V. Ramakrishna, "Analysis of Random Probing Hashing," Information Processing Letters, Vol. 31, No. 2, pp. 83-90, 1989. https://doi.org/10.1016/0020-0190(89)90073-2
  22. E. Malalla, "Two-way Hashing With Separate Chaining and Linear Probing," McGill University, 2004.
  23. G.E. Blelloch, D. Golovin, "Strongly History-independent Hashing With Applications," Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 272-282, 2007.
  24. J.S. Vitter, "Analysis of the Search Performance of Coalesced Hashing," Journal of the ACM, Vol. 30, No. 2, pp. 231-258, 1983. https://doi.org/10.1145/322374.322375