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
- João Afonso (ORCID: https://orcid.org/0000-0003-0300-4544)
- Pablo Oliver Cortés
- Vladímir Bahyl
- Julien Leduc
- Susana Pérez (ORCID: https://orcid.org/0000-0001-9444-251X)
- Richard Bachmann
- Michael Davis (ORCID: https://orcid.org/0000-0002-1523-2870)
- J. Guenther (ORCID: https://orcid.org/0000-0003-3189-3959)
- David Smith (ORCID: https://orcid.org/0000-0003-1859-8007)
- Konstantina Skovola
- Niels Bügel
- Idriss Larbi
Institutions
- European Organization for Nuclear Research (CH)
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