# GRID Storage Optimization in Transparent and User-Friendly Way for LHCb   Datasets

**Authors:** Mikhail Hushchyn, Andrey Ustyuzhanin, Philippe Charpentier and, Christophe Haen

arXiv: 1705.04513 · 2017-12-06

## TL;DR

This paper introduces a machine learning-based data replication strategy for the LHCb Grid, optimizing storage and data access efficiency by predicting data popularity to improve overall performance.

## Contribution

It proposes a novel data replication approach using machine learning and time series analysis to optimize storage in large-scale scientific data grids.

## Key findings

- Improved data access efficiency in LHCb Grid
- Reduced storage requirements through optimized replication
- Enhanced performance with predictive data distribution

## Abstract

The LHCb collaboration is one of the four major experiments at the Large Hadron Collider at CERN. Many petabytes of data are produced by the detectors and Monte-Carlo simulations. The LHCb Grid interware LHCbDIRAC is used to make data available to all collaboration members around the world. The data is replicated to the Grid sites in different locations. However the Grid disk storage is limited and does not allow keeping replicas of each file at all sites. Thus it is essential to optimize number of replicas to achieve a better Grid performance.   In this study, we present a new approach of data replication and distribution strategy based on data popularity prediction. The popularity is performed based on the data access history and metadata, and uses machine learning techniques and time series analysis methods.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1705.04513/full.md

## Figures

7 figures with captions in the complete paper: https://tomesphere.com/paper/1705.04513/full.md

## References

6 references — full list in the complete paper: https://tomesphere.com/paper/1705.04513/full.md

---
Source: https://tomesphere.com/paper/1705.04513