Near-Optimal Universal Scheduling for Moldable Tasks: The Fair Algorithm

Research Square 2026 Preprint Open access

Read full text
Authors: Lucas Perotin, Thomas Verrecchia, Padma Raghavan
DOI: 10.21203/rs.3.rs-8251720/v1
Cited by: 0

Fields of Study & Subjects

Distributed and Parallel Computing Systems Parallel Computing and Optimization Techniques Real-Time Systems Scheduling

Publication details

Journal / source
Research Square
Publication date
14 January 2026
Document type
Preprint