정보처리학회논문지A (The KIPS Transactions:PartA)

한국정보처리학회 (Korea Information Processing Society)
권호 표지
DOI QR코드

DOI QR Code

데이터 그리드 환경에서 파일 교체 정책 연구

A Study of File Replacement Policy in Data Grid Environments

  • 박홍진 (상지대학교 컴퓨터정보학부)
  • 발행 : 2006.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

데이터 그리드는 대용량의 데이터 어플리케이션 처리를 위해 지리적으로 분산되어 있는 저장 자원을 제공한다. 대용량을 처리해야 하는 데이터 그리드 환경에서는 기존 웹 캐싱 정책이나 가상 메모리 캐쉬 교체 정책과는 다른 파일 교체 정책이 필요하다. LRU(Least Recently Used)나 LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) 같은 기존의 파일 교체 전략은 파일 교체를 위해 추가적인 자원이 필요하거나 미래를 예측해야한다. 본 논문은 이를 해결하기 위해 파일의 크기에 기반하여 파일 교체를 수행하는 SBR-k(Sized-based replacement-k)을 제안한다. 성능평가 결과 제안한 정책이 기존의 정책보다 더 나은 성능을 나타낸다는 것을 확인하였다.

The data grid computing provides geographically distributed storage resources to solve computational problems with large-scale data. Unlike cache replacement policies in virtual memory or web-caching replacement, an optimal file replacement policy for data grids is the one of the important problems by the fact that file size is very large. The traditional file replacement policies such as LRU(Least Recently Used) LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) have the problem that they have to predict requests or need additional resources to file replacement. To solve theses problems, this paper propose SBR-k(Sized-based replacement-k) that replaces files based on file size. The results of the simulation show that the proposed policy performs better than traditional policies.

키워드

참고문헌

  1. B.Allcock, I.Foster, V.Nefedova, A.Chernenak, D.Deelman etc, 'High-performance remote access to climate simulation data: A challenge problem for data grid technologies,' Proceeding of the SuperComputing Conference, Non, 2003 https://doi.org/10.1145/582034.582080
  2. K. IIoltman, 'Data grid system overview and requirements,' Technical report, CERN, July, 2001
  3. M. Russel, G. Daues, I. Foster, E. Seidel, J. Novotny, J. Shalf and G. von Laszewski, 'The astophysics simulation collaboratory: A science portal enabling community software deveopment,' Cluster Computing , 2002 https://doi.org/10.1023/A:1015629422149
  4. A. Chervecnak, I. Foster , C. Kesselman, C. Salisbury and S. Tueckes, 'The data grid : Towards an architecture for the distributed management and analysis of large scientific data-sets,' Journal of Network and Computer Applications, pp.187-200, 2002
  5. E. J. Otoo. F. Olken and A. Shoshari, 'Disk Cache replacement algorithm for storage resource managers in data grids,' In the 15th Annual Super Computer Conference, pp.1-15, Nov., 2002 https://doi.org/10.1109/SC.2002.10043
  6. J.H Abawajy, 'File Replacement Algorithm for Storage Resource Managers in Data Grids,' LNCS 3038, pp.339-346, 2004 https://doi.org/10.1007/b97989
  7. M. Carman, F. Serafini, L. Stokinger, K. Stockinger, 'Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid,' In Procedings of 2nd CCGRID, pp.120-126, 2002 https://doi.org/10.1109/CCGRID.2002.1017156
  8. S. Jiang, X. Zhang, 'An Efficient Distributed Disk Caching in Data Grid Management,' In Preceedings of Cluster Computing, 2003
  9. S. Aberham, G. Peter Baer, G. Greg, Oprating system principles, 7th , Wiley, 2006
  10. E. J. Otoo, F. O'Neil, G. Weilum, 'The LRU-K page repalcement Algorithm for Database Disk Buffering,' The 15th Annual Super Computer Conference, Nov., 2002
  11. Daid G. Gameron, Buben Carajal-Schiaffino, Jamie Ferguson, OptorSim v2.0 Installation and user Guid, http://cern.ch/edg-wp2/optimization/opotorsim.html
  12. W.H.Bell, D.G. Gameron, 'Optorsim-A grid simulator for stydying dynamic data replication strategies,' Journal of High Performance Computing Application, 2003 https://doi.org/10.1177/10943420030174005