Page Replacement Algorithm for NAND Flash Used in Mobile Devices

Hai Jun Zhang; Wan Jun Yu

doi:doi:10.11648/j.jeee.20160403.16

| Peer-Reviewed

Page Replacement Algorithm for NAND Flash Used in Mobile Devices

Hai Jun Zhang, Wan Jun Yu

Published in Journal of Electrical and Electronic Engineering (Volume 4, Issue 3)

Received: 16 June 2016 Published: 17 June 2016

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

In modern society, intelligent devices equipped with flash memory are very popular. It has many wonderful characteristics, such as small, fast, little consumption, shock resistance and so on. Flash memory is divided into NOR memory and NAND memory. The NOR memory can be quickly read with byte data which is developed into data memory for code storage. A new algorithm is needed to optimize the performance of the flash memory. In this paper, we propose a new strategy for replacement to focus on reducing the execution time of the replacement cost and I / O, which is to improve the performance of the algorithm performance. Trace-driven method has a better performance than the existing algorithms in terms of cost and execution time.

Published in	Journal of Electrical and Electronic Engineering (Volume 4, Issue 3)
DOI	10.11648/j.jeee.20160403.16
Page(s)	73-77
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2016. Published by Science Publishing Group

Keywords

Page Replacement Algorithms, NAND Flash Memory, Embedded Systems

References

[1]	Pack, C, Kang, J, U, Park, S. Y, Kim, J. S, "Energy-aware demand paging on NAND flash-based embedded storages, "In: Proceedings of the 2004 International Symposium on Low Power Electronics and Design.2004.
[2]	Chul. Lee, Sung Hoon Baek, Kyu Ho Park, "A Hybrid Flash File System Based on NOR and NAND Flash Memories for Embedded Devices," IEEE Translation on Computers, vol. 57, Issue. 7, July. 2008, pp. 102-1008.
[3]	Baichuan Shen. "APRA: Adaptive Page Replacement Algorithm for NAND Flash Memory Storages", 2009 International Forum on Computer Science-Technology and Applications, 12/2009.
[4]	T. Hoshi, K. Ootsu, T. Ohkawa and T. Yokota, "Runtime Overhead Reduction in Automated Parallel Processing System Using Valgrind," 2013 First International Symposium on Computing and Networking, Matsuyama, 2013, pp. 572-576.doi: 10.1109/CANDAR. 2013.102.
[5]	W. Kim and D. Shin, "Non-preemptive demand paging technique for NAND flash-based real-time embedded systems," in IEEE Transactions on Consumer Electronics, vol. 56, no. 3, pp. 1516-1523, Aug. 2010.
[6]	Megiddo, N, Modha, D," ARC:A Self-Tuning, Low Overhead Replacement Cache, "In the Proceedings of the 2nd USENIX Conference on File and Storage Technologies. 2003.
[7]	Jiang, S, Zhang, X, "LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance," ACM SIGMENTRICS Performance Evaluation Review archive. 2002.
[8]	S. T. On, J. Xu, B. Choi, H. Hu and B. He, "Flag Commit: Supporting Efficient Transaction Recovery in Flash-Based DBMSs," in IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 9, pp. 1624-1639, Sept. 2012.
[9]	S. A. Hussain and A. Mansoor, "FLASH modelling for wear leveling algorithms," 8th International Conference on High-capacity Optical Networks and Emerging Technologies, Riyadh, 2011, pp. 267-272.
[10]	J. Liu, S. Chen, G. Wang and T. Wu, "Page replacement algorithm based on counting bloom filter for NAND flash memory," in IEEE Transactions on Consumer Electronics, vol. 60, no. 4, pp. 636-643, Nov. 2014.
[11]	M. Lin, S. Chen and Z. Zhou, "An efficient page replacement algorithm for NAND flash memory," in IEEE Transactions on Consumer Electronics, vol. 59, no. 4, pp. 779-785, November 2013.

Cite This Article

Plain Text BibTeX RIS

APA Style

Hai Jun Zhang, Wan Jun Yu. (2016). Page Replacement Algorithm for NAND Flash Used in Mobile Devices. Journal of Electrical and Electronic Engineering, 4(3), 73-77. https://doi.org/10.11648/j.jeee.20160403.16

Copy | Download

ACS Style

Hai Jun Zhang; Wan Jun Yu. Page Replacement Algorithm for NAND Flash Used in Mobile Devices. J. Electr. Electron. Eng. 2016, 4(3), 73-77. doi: 10.11648/j.jeee.20160403.16

Copy | Download

AMA Style

Hai Jun Zhang, Wan Jun Yu. Page Replacement Algorithm for NAND Flash Used in Mobile Devices. J Electr Electron Eng. 2016;4(3):73-77. doi: 10.11648/j.jeee.20160403.16

Copy | Download

@article{10.11648/j.jeee.20160403.16,
  author = {Hai Jun Zhang and Wan Jun Yu},
  title = {Page Replacement Algorithm for NAND Flash Used in Mobile Devices},
  journal = {Journal of Electrical and Electronic Engineering},
  volume = {4},
  number = {3},
  pages = {73-77},
  doi = {10.11648/j.jeee.20160403.16},
  url = {https://doi.org/10.11648/j.jeee.20160403.16},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.jeee.20160403.16},
  abstract = {In modern society, intelligent devices equipped with flash memory are very popular. It has many wonderful characteristics, such as small, fast, little consumption, shock resistance and so on. Flash memory is divided into NOR memory and NAND memory. The NOR memory can be quickly read with byte data which is developed into data memory for code storage. A new algorithm is needed to optimize the performance of the flash memory. In this paper, we propose a new strategy for replacement to focus on reducing the execution time of the replacement cost and I / O, which is to improve the performance of the algorithm performance. Trace-driven method has a better performance than the existing algorithms in terms of cost and execution time.},
 year = {2016}
}

Copy | Download

TY  - JOUR
T1  - Page Replacement Algorithm for NAND Flash Used in Mobile Devices
AU  - Hai Jun Zhang
AU  - Wan Jun Yu
Y1  - 2016/06/17
PY  - 2016
N1  - https://doi.org/10.11648/j.jeee.20160403.16
DO  - 10.11648/j.jeee.20160403.16
T2  - Journal of Electrical and Electronic Engineering
JF  - Journal of Electrical and Electronic Engineering
JO  - Journal of Electrical and Electronic Engineering
SP  - 73
EP  - 77
PB  - Science Publishing Group
SN  - 2329-1605
UR  - https://doi.org/10.11648/j.jeee.20160403.16
AB  - In modern society, intelligent devices equipped with flash memory are very popular. It has many wonderful characteristics, such as small, fast, little consumption, shock resistance and so on. Flash memory is divided into NOR memory and NAND memory. The NOR memory can be quickly read with byte data which is developed into data memory for code storage. A new algorithm is needed to optimize the performance of the flash memory. In this paper, we propose a new strategy for replacement to focus on reducing the execution time of the replacement cost and I / O, which is to improve the performance of the algorithm performance. Trace-driven method has a better performance than the existing algorithms in terms of cost and execution time.
VL  - 4
IS  - 3
ER  -

Copy | Download

Author Information

Hai Jun Zhang

School of Computer Science & Information Engineering, Shanghai Institute of Technology, Shanghai, China
Wan Jun Yu

School of Computer Science & Information Engineering, Shanghai Institute of Technology, Shanghai, China

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Hai Jun Zhang, Wan Jun Yu. (2016). Page Replacement Algorithm for NAND Flash Used in Mobile Devices. Journal of Electrical and Electronic Engineering, 4(3), 73-77. https://doi.org/10.11648/j.jeee.20160403.16

Copy | Download

ACS Style

Hai Jun Zhang; Wan Jun Yu. Page Replacement Algorithm for NAND Flash Used in Mobile Devices. J. Electr. Electron. Eng. 2016, 4(3), 73-77. doi: 10.11648/j.jeee.20160403.16

Copy | Download

AMA Style

Hai Jun Zhang, Wan Jun Yu. Page Replacement Algorithm for NAND Flash Used in Mobile Devices. J Electr Electron Eng. 2016;4(3):73-77. doi: 10.11648/j.jeee.20160403.16

Copy | Download

@article{10.11648/j.jeee.20160403.16,
  author = {Hai Jun Zhang and Wan Jun Yu},
  title = {Page Replacement Algorithm for NAND Flash Used in Mobile Devices},
  journal = {Journal of Electrical and Electronic Engineering},
  volume = {4},
  number = {3},
  pages = {73-77},
  doi = {10.11648/j.jeee.20160403.16},
  url = {https://doi.org/10.11648/j.jeee.20160403.16},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.jeee.20160403.16},
  abstract = {In modern society, intelligent devices equipped with flash memory are very popular. It has many wonderful characteristics, such as small, fast, little consumption, shock resistance and so on. Flash memory is divided into NOR memory and NAND memory. The NOR memory can be quickly read with byte data which is developed into data memory for code storage. A new algorithm is needed to optimize the performance of the flash memory. In this paper, we propose a new strategy for replacement to focus on reducing the execution time of the replacement cost and I / O, which is to improve the performance of the algorithm performance. Trace-driven method has a better performance than the existing algorithms in terms of cost and execution time.},
 year = {2016}
}

Copy | Download

TY  - JOUR
T1  - Page Replacement Algorithm for NAND Flash Used in Mobile Devices
AU  - Hai Jun Zhang
AU  - Wan Jun Yu
Y1  - 2016/06/17
PY  - 2016
N1  - https://doi.org/10.11648/j.jeee.20160403.16
DO  - 10.11648/j.jeee.20160403.16
T2  - Journal of Electrical and Electronic Engineering
JF  - Journal of Electrical and Electronic Engineering
JO  - Journal of Electrical and Electronic Engineering
SP  - 73
EP  - 77
PB  - Science Publishing Group
SN  - 2329-1605
UR  - https://doi.org/10.11648/j.jeee.20160403.16
AB  - In modern society, intelligent devices equipped with flash memory are very popular. It has many wonderful characteristics, such as small, fast, little consumption, shock resistance and so on. Flash memory is divided into NOR memory and NAND memory. The NOR memory can be quickly read with byte data which is developed into data memory for code storage. A new algorithm is needed to optimize the performance of the flash memory. In this paper, we propose a new strategy for replacement to focus on reducing the execution time of the replacement cost and I / O, which is to improve the performance of the algorithm performance. Trace-driven method has a better performance than the existing algorithms in terms of cost and execution time.
VL  - 4
IS  - 3
ER  -

Copy | Download