한국정보과학회논문지:소프트웨어및응용 (Journal of KIISE:Software and Applications)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

이동 컴퓨팅 환경에서 요구 패턴 분석을 기반으로 하는 캐쉬 대체 전략

A Cache Replacement Strategy based on the Analysis of Request Patterns in Mobile Computing Environments

  • 이윤장 (중앙대학교 정보시스템학과) ;
  • 신동천 (중앙대학교 산업과학대학 정보시스템학과)
  • 발행 : 2003.08.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

낮은 대여폭을 갖는 이동 컴퓨팅 환경에서 캐슁은 요구 경쟁을 감소시킴으로서 응답시간을 향상시킬수 있는 유용한 방법이다. 전통적인 캐쉬 기반의 시스템에서는 히트율을 향상시키는 것이 일반적으로 빠른 응답시간을 위한 주요한 관심사중의 하나였다. 그렇지만, 이동 컴퓨팅 환경에서는 히트율 뿐만 아니라 미스 비용의 고려도 필요하다. 본 논문에서는 풀 기반의 데이타 분산 시스템에서 새로운 캐쉬 대체 전략을 제시하고 시뮬레이션을 통하여 성능을 평가한다. 제시한 전략은 인기도와 대기 시간을 함께 고려하여 인기도와 대기 시간을 곱한 값 중에서 가장 작은 값을 갖는 페이지를 대체 페이지로 선정한다.

Caching is a useful technique to improve the response time by reducing contention of requests in mobile computing environments with a narrow bandwidth. in the traditional cache-based systems, to improve the hit ratio has been usually one of main concerns for the time. However, in mobile computing environments, it is necessary to consider the cost of cache miss as well as the hit ratio. In this paper, we propose a new cache replacement strategy in pull-based data dissemination systems. Then, we evaluate performance of the proposed strategy by a simulation approach. The proposed strategy considers both the popularity and the wating time together, so the page with the smallest value of multiplying popularity by waiting time is selected as a victim.

키워드

참고문헌

  1. D. Aksoy, M. Altinel, R. Bose, U. Cetintemel, M. Franklin, J. Wang, S. Zdonik, 'Research in Data Broadcast and Dissemination,' AMCP, pp. 194-207, 1998
  2. D. Barbara, 'Mobile Computing and Databases A Survey,' IEEE Transactions on Knowledge Engineering, Vol. 11, No. 1, pp. 108-117, January/February 1999 https://doi.org/10.1109/69.755619
  3. M. Frnaklin, S. Zdonik, 'Dissemination Based Information Systems,' IEEE Data Engineering Bulletin, Vol. 19, No.3, pp. 20-30, Sept. 1996
  4. S. Acharya, M. Franklin, S. Zdonik, 'Balancing Push and Pull for Data Broadcast,' Proc. of ACM SIGMOD, Tuscon, Arizona, pp. 183-194, May 1997 https://doi.org/10.1145/253262.253293
  5. S. Acharya, R. Alonso, M. Franklin, S. Zdonik, 'Broadcast Disks : Data Management for Asymmetric Communication Environments,' Proc. of ACM SIGMOD, pp. 199-210, 1995 https://doi.org/10.1145/223784.223816
  6. C. Griwodz, M. Bar, L. C. Wolf, 'Long term Movie Popularity Models in Video on Demand Systems or The Life of an on Demand Movie,' ACM Int. Conf. on Multimedia, Seattle, USA, pp. 349-357, 1997 https://doi.org/10.1145/266180.266386
  7. T. Choi, Y. Kim, K. Chung, 'A prefetching scheme based on the analysis of user access patterns in news-on demand system,' Proc. of the 7th ACM Int. Conf. on Multimedia, pp. 145-148, 1999 https://doi.org/10.1145/319463.319482
  8. S. Khanna, V. Liberatore, 'On Broadcast Disk Paging,' Proc. of the 30th ACM Symp. on the Theory of Computing, pp. 634-643, 1998 https://doi.org/10.1145/276698.276879
  9. V. Liberatore, 'Caching and Scheduling for Broadcast Diks Systems,' Technical Report 98-71, UMIACS, 1998
  10. S. Galvin, P. B. Galvin, Operation System Concepts, 4th Edition, Addison Wesley, 1994
  11. E. O'Neil, P. O'Neil, G. Weikum, 'The LRU-K page replacement algorithm for database disk buffering,' Proc. of ACM SIGMOD, pp. 297-306, May 1993 https://doi.org/10.1145/170036.170081
  12. D. Knuth, The Art of Computer Programming, Vol II, Addison Wesley, 1981
  13. D. Lee, J. Choi, J. Kim, S.Noh, S. Min, Y. Cho, C. Kim, 'On the Existence of a Spectrum of Policies that Subsumes the Least Recently Used(LRU) and Least Frequently Used(LFU) Policies,' Proceedings of ACM SIGMETRICS'99(International Conference on Measurement and Modeling of Computer Systems), pp. 134-143, 1999 https://doi.org/10.1145/301453.301487
  14. D. Aksoy, M. Franklin, 'RxW : A Scheduling Approach for Large Scale On-Demand Data Broadcast,' IEEE/ACM Transactions on Networking Vol. 7, No. 6, pp. 846-860, 1999 https://doi.org/10.1109/90.811450