Study of cache performance in distributed environment for data processing

15th International Workshop on Advanced Computing and Analysis Techniques in Physics Research

物理学;计算机科学

Makatun, Dzmitry^1,3 ; Lauret, Jérôme^2 ; Šumbera, Michal^3

Faculty of Nuclear Physics and Physical Engineering, Czech Technical University, Prague, Czech Republic^1

STAR, Brookhaven National Laboratory, United States^2

Nuclear Physics Institute, Academy of Sciences, Czech Republic^3

关键词: Cache performance;    Caching algorithm;    Caching strategy;    Cloud processing;    Computational work;    Distributed environments;    ITS applications;    Nuclear and particle physics;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/523/1/012016/pdf
DOI  :  10.1088/1742-6596/523/1/012016

学科分类：计算机科学（综合）

来源: IOP

【 摘 要 】

Processing data in distributed environment has found its application in many fields of science (Nuclear and Particle Physics (NPP), astronomy, biology to name only those). Efficiently transferring data between sites is an essential part of such processing. The implementation of caching strategies in data transfer software and tools, such as the Reasoner for Intelligent File Transfer (RIFT) being developed in the STAR collaboration, can significantly decrease network load and waiting time by reusing the knowledge of data provenance as well as data placed in transfer cache to further expand on the availability of sources for files and data-sets. Though, a great variety of caching algorithms is known, a study is needed to evaluate which one can deliver the best performance in data access considering the realistic demand patterns. Records of access to the complete data-sets of NPP experiments were analyzed and used as input for computer simulations. Series of simulations were done in order to estimate the possible cache hits and cache hits per byte for known caching algorithms. The simulations were done for cache of different sizes within interval 0.001-90% of complete data-set and low-watermark within 0-90%. Records of data access were taken from several experiments and within different time intervals in order to validate the results. In this paper, we will discuss the different data caching strategies from canonical algorithms to hybrid cache strategies, present the results of our simulations for the diverse algorithms, debate and identify the choice for the best algorithm in the context of Physics Data analysis in NPP. While the results of those studies have been implemented in RIFT, they can also be used when setting up cache in any other computational work-flow (Cloud processing for example) or managing data storages with partial replicas of the entire data-set.