Advertisement

A Proposed Framework: Enhanced Automated Duplication Algorithm for Flash Application

  • Aqilah RostamEmail author
  • Rosni Abdullah
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 67)

Abstract

Duplicator machine is typically used to improve the data transfer over a shorter time. The process of duplication is done by copying each data bit from the master device to the targeted device including unused memory region. However, to duplicate a 64 GB embedded MultiMedia Card (eMMC) memory is usually very time-consuming which is between 2 and 7 h; plus the speed specification claimed by the vendor is not the same when it is tested during benchmarking process. Therefore, this paper describes a proposed technique to improve eMMC duplication process by adopting the data storage and data transmission concepts such as reducing the data size using compression and sorting technique, where the algorithm needs to be optimized from the sequential level (data structure, data flow, etc.) which includes the significant impact of data type and data size during the duplication process. This study also extends these techniques by using heterogeneous collection of dataset or digital data to serve the true purpose of flash storage.

Keywords

Duplication Data transfer Sorting Compression 

Notes

Acknowledgements

This work was supported by Collaborative Research in Engineering, Science and Technology (CREST) and Sophic Automation Sdn Bhd under P13C2-2014 Grant.

References

  1. 1.
    Schoenherr E, Steven (5 May 2004) The digital revolution. Archived from the original on October 2008Google Scholar
  2. 2.
    Chiao ML, Chang DW HybridLog: an efficient hybrid-mapped flash translation layer for modern NAND flash memoryGoogle Scholar
  3. 3.
    Zhang C, Wang Y, Wang T, Chen R, Liu D, Shao Z (2014) Deterministic crash recovery for NAND flash based storage systems. In: Proceedings of design automation conference, Dresden, Germany, 24–28 March 2014, ACM, Dresden, Germany, pp 1–6Google Scholar
  4. 4.
    Xie W, Chen Y, Roth PC (2016) ASA-FTL: an adaptive separation aware flash translation layer for solid state drives. Parallel Comput  https://doi.org/10.1016/j.parco.2016.10.006
  5. 5.
    Shim H, Kim JS, Maeng S (2012) BEST: best-effort energy saving techniques for NAND flash-based hybrid storage. IEEE Trans Consum Electron 58(3)Google Scholar
  6. 6.
    Tseng HW, Grupp LM, Swanson S (2013, May) Underpowering NAND flash: profits and perils. In: Proceedings of the 50th annual design automation conference. ACM, New York, p 162Google Scholar
  7. 7.
    Jimenez X, Novo D, Ienne P (2014, February) Wear unleveling: improving NAND flash lifetime by balancing page endurance. In: FAST vol 14, pp 47–59Google Scholar
  8. 8.
    Luo Y, Cai Y, Ghose S, Choi J, Mutlu O (2015, May) WARM: improving NAND flash memory lifetime with write-hotness aware retention management. In: 2015 31st symposium on mass storage systems and technologies (MSST). IEEE, New York, pp 1–14Google Scholar
  9. 9.
    Jeong J, Song Y, Hahn SS, Lee S, Kim J (2017) Dynamic erase voltage and time scaling for extending lifetime of NAND flash-based SSDs. IEEE Trans Comput 66(4):616Google Scholar
  10. 10.
    Gal E, Toledo S (2005) Algorithms and data structures for flash memories. ACM Comput Surv (CSUR) 37(2):138–163CrossRefGoogle Scholar
  11. 11.
    Parthey D (2007) Analyzing real-time behavior of flash memories. B. SmithGoogle Scholar
  12. 12.
    Longley PETAL (2001) Geographic information systems and science. Wiley, ChichesterGoogle Scholar
  13. 13.
    Kammer F Algorithm design under consideration of different resources and a faulty worldGoogle Scholar
  14. 14.
  15. 15.
    Micheloni R, Marelli A, Commodaro S (2010) NAND overview: from memory to systems. In: Inside NAND flash memories. Springer Netherlands, pp 19–53Google Scholar
  16. 16.
    Iniewski K (Ed) (2010) CMOS processors and memories. Springer Science & Business MediaGoogle Scholar
  17. 17.
    Na GJ, Moon BK, Lee SW (2011) IPL B+ -tree for Flash Memory Database Systems. J Inform Sci Eng 27:111–127Google Scholar
  18. 18.
    Kale MN, Jahagirdar AS (2012) An innovative algorithm for flash memory. Int J Comput Sci Inf Technol (IJCSIT) 3(3):4371–4376Google Scholar
  19. 19.
    Suh YK, Moon B, Efrat A, Kim JS, Lee SW (2012) Extent mapping scheme for flash memory devices. In: 2012 IEEE 20th international symposium on modeling, analysis & simulation of computer and telecommunication systems (MASCOTS). IEEE, New York, pp 331–338Google Scholar
  20. 20.
    Lee S, Shin D, Kim YJ, Kim J (2008) LAST: locality-aware sector translation for NAND flash memory-based storage systems. ACM SIGOPS Oper Syst Rev 42(6):36–42CrossRefGoogle Scholar
  21. 21.
    Lin T (2016) U.S. Patent No 6654841B2. U.S. Patent and Trademark Office, Washington, DCGoogle Scholar
  22. 22.
    Rashid MU, Khan ZH (2012) Design and implementation of a low-cost USB duplicator. Bull Electr Eng Inform 1(4):263–278Google Scholar
  23. 23.
    Intel microprocessors: 8086/8088, 80186/80188, 80286, 80386, 80486 Pentium, Pentium Pro Processor, Pentium II, Pentium 4 and Core2 WITH 64-bit extensions Architecture, Programming and Interfacing, Eight Edition Barry B. BreyGoogle Scholar
  24. 24.
    Sawant T, Parekh B, Shah N (2013, December) Computer independent USB to USB data transfer bridge. In: 2013 6th international conference on emerging trends in engineering and technology (ICETET). IEEE, New York, pp 40–45Google Scholar
  25. 25.
    Hammad J (2015) A comparative study between various sorting algorithms. Int J Comput Sci Netw Secur (IJCSNS) 15(3)Google Scholar
  26. 26.
    Null L, Lobur J (2014) The essentials of computer organization and architecture. Jones & BartlettGoogle Scholar
  27. 27.
    Dzhagaryan A (2016) A framework for optimizing data transfers between edge devices and the cloud using compression utilitiesGoogle Scholar
  28. 28.
    Yim KS, Kim J, Koh K (2005, March) A fast start-up technique for flash memory based computing systems. In: Proceedings of the 2005 ACM symposium on applied computing. ACM, New York, pp 843–849Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.School of Computer ScienceUniversiti Sains MalaysiaGelugorMalaysia
  2. 2.Sophic Automation Sdn BhdBayan LepasMalaysia

Personalised recommendations