Cargando…

Disk storage management for LHCb based on Data Popularity estimator

This paper presents an algorithm providing recommendations for optimizing the LHCb data storage. The LHCb data storage system is a hybrid system. All datasets are kept as archives on magnetic tapes. The most popular datasets are kept on disks. The algorithm takes the dataset usage history and metada...

Descripción completa

Detalles Bibliográficos
Autores principales: Hushchyn, Mikhail, Charpentier, Philippe, Ustyuzhanin, Andrey
Lenguaje:eng
Publicado: 2015
Materias:
Acceso en línea:https://dx.doi.org/10.1088/1742-6596/664/4/042026
http://cds.cern.ch/record/2022203
_version_ 1780946990048215040
author Hushchyn, Mikhail
Charpentier, Philippe
Ustyuzhanin, Andrey
author_facet Hushchyn, Mikhail
Charpentier, Philippe
Ustyuzhanin, Andrey
author_sort Hushchyn, Mikhail
collection CERN
description This paper presents an algorithm providing recommendations for optimizing the LHCb data storage. The LHCb data storage system is a hybrid system. All datasets are kept as archives on magnetic tapes. The most popular datasets are kept on disks. The algorithm takes the dataset usage history and metadata (size, type, configuration etc.) to generate a recommendation report. This article presents how we use machine learning algorithms to predict future data popularity. Using these predictions it is possible to estimate which datasets should be removed from disk. We use regression algorithms and time series analysis to find the optimal number of replicas for datasets that are kept on disk. Based on the data popularity and the number of replicas optimization, the algorithm minimizes a loss function to find the optimal data distribution. The loss function represents all requirements for data distribution in the data storage system. We demonstrate how our algorithm helps to save disk space and to reduce waiting times for jobs using this data.
id cern-2022203
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2015
record_format invenio
spelling cern-20222032023-03-14T20:15:13Zdoi:10.1088/1742-6596/664/4/042026http://cds.cern.ch/record/2022203engHushchyn, MikhailCharpentier, PhilippeUstyuzhanin, AndreyDisk storage management for LHCb based on Data Popularity estimatorParticle Physics - ExperimentComputing and ComputersThis paper presents an algorithm providing recommendations for optimizing the LHCb data storage. The LHCb data storage system is a hybrid system. All datasets are kept as archives on magnetic tapes. The most popular datasets are kept on disks. The algorithm takes the dataset usage history and metadata (size, type, configuration etc.) to generate a recommendation report. This article presents how we use machine learning algorithms to predict future data popularity. Using these predictions it is possible to estimate which datasets should be removed from disk. We use regression algorithms and time series analysis to find the optimal number of replicas for datasets that are kept on disk. Based on the data popularity and the number of replicas optimization, the algorithm minimizes a loss function to find the optimal data distribution. The loss function represents all requirements for data distribution in the data storage system. We demonstrate how our algorithm helps to save disk space and to reduce waiting times for jobs using this data.This paper presents an algorithm providing recommendations for optimizing the LHCb data storage. The LHCb data storage system is a hybrid system. All datasets are kept as archives on magnetic tapes. The most popular datasets are kept on disks. The algorithm takes the dataset usage history and metadata (size, type, configuration etc.) to generate a recommendation report. This article presents how we use machine learning algorithms to predict future data popularity. Using these predictions it is possible to estimate which datasets should be removed from disk. We use regression algorithms and time series analysis to find the optimal number of replicas for datasets that are kept on disk. Based on the data popularity and the number of replicas optimization, the algorithm minimizes a loss function to find the optimal data distribution. The loss function represents all requirements for data distribution in the data storage system. We demonstrate how our algorithm helps to save disk space and to reduce waiting times for jobs using this data.arXiv:1510.00132oai:cds.cern.ch:20222032015-10-01
spellingShingle Particle Physics - Experiment
Computing and Computers
Hushchyn, Mikhail
Charpentier, Philippe
Ustyuzhanin, Andrey
Disk storage management for LHCb based on Data Popularity estimator
title Disk storage management for LHCb based on Data Popularity estimator
title_full Disk storage management for LHCb based on Data Popularity estimator
title_fullStr Disk storage management for LHCb based on Data Popularity estimator
title_full_unstemmed Disk storage management for LHCb based on Data Popularity estimator
title_short Disk storage management for LHCb based on Data Popularity estimator
title_sort disk storage management for lhcb based on data popularity estimator
topic Particle Physics - Experiment
Computing and Computers
url https://dx.doi.org/10.1088/1742-6596/664/4/042026
http://cds.cern.ch/record/2022203
work_keys_str_mv AT hushchynmikhail diskstoragemanagementforlhcbbasedondatapopularityestimator
AT charpentierphilippe diskstoragemanagementforlhcbbasedondatapopularityestimator
AT ustyuzhaninandrey diskstoragemanagementforlhcbbasedondatapopularityestimator