Evolution of the CERN Tape Archive Scheduling System

The CERN Tape Archive (CTA) scheduling system implements the workflow and lifecycle of archive, retrieve and repack requests. The transient metadata for queued requests is stored in the Scheduler backend store (Scheduler DB). In our previous work, we presented the CTA Scheduler together with an object-store backend implementation of the Scheduler DB. Now, with four years of experience in production, the strengths and limitations of this approach are better understood. While highly efficient for FIFO queueing operations (archive/retrieve), non-FIFO operations (delete, priority queues) require some workarounds. Additionally, this backend imposes constraints on how the CTA Scheduler code can be modified and is an additional software dependency and technology for developers to learn. This paper discusses an alternative Scheduler DB implementation, based on relational database technology. We include a status report and roadmap.

Authors

Institutions

Publication Details

Journal
EPJ Web of Conferences
Published
2025-01-01
DOI
https://doi.org/10.1051/epjconf/202533701002
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Evolution of the CERN Tape Archive Scheduling System

João Afonso, Pablo Oliver Cortés, Vladímir Bahyl, Julien Leduc et al.
EPJ Web of Conferences
Distributed and Parallel Computing Systems
article

Evolution of the CERN Tape Archive Scheduling System

João Afonso, Pablo Oliver Cortés, Vladímir Bahyl, Julien Leduc, Susana Pérez, Richard Bachmann, Michael Davis, J. Guenther, David Smith, Konstantina Skovola, Niels Bügel, Idriss Larbi
article en

Abstract

The CERN Tape Archive (CTA) scheduling system implements the workflow and lifecycle of archive, retrieve and repack requests. The transient metadata for queued requests is stored in the Scheduler backend store (Scheduler DB). In our previous work, we presented the CTA Scheduler together with an object-store backend implementation of the Scheduler DB. Now, with four years of experience in production, the strengths and limitations of this approach are better understood. While highly efficient for FIFO queueing operations (archive/retrieve), non-FIFO operations (delete, priority queues) require some workarounds. Additionally, this backend imposes constraints on how the CTA Scheduler code can be modified and is an additional software dependency and technology for developers to learn. This paper discusses an alternative Scheduler DB implementation, based on relational database technology. We include a status report and roadmap.

EPJ Web of ConferencesVol. 337
European Organization for Nuclear Research (CH)
Openalex Percentile: Top 68%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Evolution of the CERN Tape Archive Scheduling System — João Afonso, Pablo Oliver Cortés, et al. · EPJ Web of Conferences (2025) | TGRS Research Map | TGRS