Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline

1968/06/01 by Linus Schrage · 13 citations
Business, Management and Accounting · Computer Science · Engineering · #Advanced Queuing Theory Analysis #Cloud Computing and Resource Management #Scheduling and Optimization Algorithms

paper · doi:10.1287/opre.16.3.687

Cited by

• Is Tail-Optimal Scheduling Possible?
• Ergodicity Bounds for the Markovian Queue With Time-Varying Transition Intensities, Batch Arrivals and One Queue Skipping Policy
• HeraSys: Collaborative Serving of Multiple LLM Workflows via Fine-Grained End-to-End Optimization
• Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
• Outperforming Multiserver SRPT at All Loads
• Load Balancing Guardrails: Keeping Your Heavy Traffic on the Road to Low Response Times
• TridentServe: A Stage-level Serving System for Diffusion Pipelines
• Prompt Scheduling for Selfish Agents
• Invariance of fluid limits for the Shortest Remaining Processing Time\n and Shortest Job First policies
• Clairvoyant: Predictive Shortest-Job-First Admission for Serial LLM Inference
• A Little Clairvoyance Is All You Need
• Scheduling with Service-Time Information: The Power of Two Priority Classes
• FIFO Queueing Policies for Packets with Heterogeneous Processing