Sparse Predict and Demote: Optimal Scheduling with Minimal Size Advice
cs.PF, cs.DS, cs.LG
Submitted: 2026-11-06
Updated: 2026-11-06
Project page: https://algorithms-withpredictions.github.io
Terminology
Sources
- Parsimonious Learning-Augmented Approximations for Dense Instances of $\mathcal{NP}$-hard Problems
- Scheduling with Service-Time Information: The Power of Two Priority Classes
- Scheduling with Predictions and the Price of Misprediction
- How to Schedule Near-Optimally under Real-World Constraints
Related papers
- Instruction-Aware Transfer of GPU Implementation Crossovers: a Tensor-Product Discontinuous Galerkin Operator on GB200, H100, and A100
- denet, A lightweight command-line tool for process monitoring in benchmarking and beyond
- HybridQC: Hardware-Grounded Simulation of Tightly Integrated Hybrid Quantum-Classical Systems
- TileBench: A Controlled Benchmark for Performance Evaluation and Bottleneck Diagnosis of Tile-Based Programming Models
- The M/PH 2/1 Queue: Explicit Distributions, Sojourn Times and Numerical Benchmarks
- Rolling Round-Robin Rate: Standard Heterogeneous Throughput for SPEC CPU