International journal of advanced smart convergence

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

CPC: A File I/O Cache Management Policy for Compute-Bound Workloads

  • Bahn, Hyokyung (Department of Computer Engineering, Ewha University)
  • Received : 2022.03.03
  • Accepted : 2022.03.09
  • Published : 2022.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

With the emergence of the new era of the 4th industrial revolution, compute-bound workloads with large memory footprint like big data processing increase dramatically. Even in such compute-bound workloads, however, we observe bulky I/Os while loading big data from storage to memory. Although file I/O cache plays a role of accelerating the performance of storage I/O, we found out that the cache hit rate in such environments is not improved even though we increase the file I/O cache capacity because of some special I/O references generated by compute-bound workloads. To cope with this situation, we propose a new file I/O cache management policy that improves the cache hit rate for compute-bound workloads significantly. Trace-driven simulations by replaying file I/O reference logs of compute-bound workloads show that the proposed cache management policy improves the cache hit rate compared to the well-acknowledged CLOCK algorithm by a large margin.

Keywords

Acknowledgement

This work was supported by the IITP grant funded by the Korea government (MSIT) (No.2021-0-02068, Artificial Intelligence Innovation Hub) and the ICT R&D program of MSIT/IITP (2018-0-00549, Extremely Scalable Order Preserving OS for Manycore and Non-volatile Memory).

References

  1. G. Patil, S. Deshpande, "Distributed rendering system for 3D animations with Blender," Proc. IEEE Conf. on Advances in Electronics, Communication and Computer Technology, pp.91-98, 2016. DOI: https://doi.org/10.1109/ICAECCT.2016.7942562
  2. S. Yoo, Y. Jo, and H. Bahn, "Integrated scheduling of real-time and interactive tasks for configurable industrial systems," IEEE Transactions on Industrial Informatics, vol. 18, no. 1, pp. 631-641, 2022. DOI: https://doi.org/10.1109/TII.2021.3067714
  3. H. Bahn, J. Kim, "Separation of virtual machine I/O in cloud systems," IEEE Access, vol. 8, pp. 223756-223764, 2020. DOI: https://doi.org/10.1109/ACCESS.2020.3044172
  4. O. Kwon, H. Bahn, and K Koh, "Popularity and prefix aware interval caching for multimedia streaming servers," Proc. IEEE CIT Conference, pp. 555-560, 2008. DOI: http://doi.org/10.1109/CIT.2008.4594735
  5. J. Kim and H. Bahn, "Analysis of smartphone I/O characteristics - toward efficient swap in a smartphone," IEEE Access, vol. 7, pp. 129930-129941, 2019. DOI: https://doi.org/10.1109/ACCESS.2019.2937852
  6. S. Lim, H. Bahn, "Characterizing file accesses in android applications and caching implications," IEEE Access, vol. 9, pp. 150292-150303, 2021. DOI: https://doi.org/10.1109/ACCESS.2021.3125779
  7. H. Bahn, H. Lee, S. Noh, S. Min, and K. Koh, "Replica-aware caching for web proxies, Computer Communications, vol. 25, no. 3, pp. 183-188, 2002. DOI: https://doi.org/10.1016/S0140-3664(01)00365-6
  8. J. Choi, S. Noh, S. Min, Y. Cho, "An implementation study of a detection-based adaptive block replacement scheme," Proc. USENIX Annual Technical Conf., pp. 239-252, 1999.
  9. T. Johnson and D. Shasha, "2Q: a low overhead high performance buffer management replacement algorithm," Proc. 20th ACM Conf. on Very Large Databases (VLDB), pp. 439-450, 1994.
  10. S. Bansal, D. S. Modha, "CAR: clock with adaptive replacement," Proc. USENIX Conf. on File and Storage Technologies (FAST), 2004.