English

Intent-driven scheduling of backup jobs

Distributed, Parallel, and Cluster Computing 2025-01-28 v1 Performance

Abstract

Job scheduling under various constraints to achieve global optimization is a well-studied problem. However, in scenarios that involve time-dependent constraints, such as scheduling backup jobs, achieving global optimization may not always be desirable. This paper presents a framework for scheduling new backup jobs in the presence of existing job schedules, focusing on satisfying intent-based constraints without disrupting current schedules. The proposed method accommodates various scheduling intents and constraints, and its effectiveness is validated through extensive testing against a variety of backup scenarios on real-world data from Veritas Netbackup customer policies.

Keywords

Cite

@article{arxiv.2501.14763,
  title  = {Intent-driven scheduling of backup jobs},
  author = {Souvik Dutta and Suri Brahmaroutu},
  journal= {arXiv preprint arXiv:2501.14763},
  year   = {2025}
}

Comments

7 pages, 6 figures, 1 table, 1 algorithm

R2 v1 2026-06-28T21:16:45.895Z