• Home
  • Search
  • Strongly Tail-Optimal Scheduling in the Light-Tailed M/G/1
  • Open Access IconOpen Access
  • Cite Icon2
  • https://doi.org/10.1145/3673660.3655084Copy DOI Icon

Strongly Tail-Optimal Scheduling in the Light-Tailed M/G/1

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We study the problem of scheduling jobs in a queueing system, specifically an M/G/1 with light-tailed job sizes, to asymptotically optimize the response time tail. This means scheduling to make \mathbfP [T > t], the chance a job's response time exceeds t, decay as quickly as possible in the t → ∞ limit. For some time, the best known policy was First-Come First-Served (FCFS), which has an asymptotically exponential tail: P [T > t] ∼ C e -γ t . FCFS achieves the optimal decay rate ~γ, but its tail constant C is suboptimal. We derive a closed-form expression for the optimal tail constant, and we introduce γ-Boost, a new policy that achieves this optimal tail constant. We also show via simulation that γ-Boost has excellent practical performance. This abstract summarizes our full paper.

Similar Papers
  • Conference Article
  • Citations20

Improving Preemptive Scheduling with Application-Transparent Checkpointing in Shared Clusters

  • Nov 24, 2015
  • Jack Li +4
  • Research Article
  • Citations30

The departure process from a queueing system

  • Sep 01, 1976
  • Mathematical Proceedings of the Cambridge Philosophical Society
  • F P Kelly
  • Research Article
  • Citations35

Scheduling for efficiency and fairness in systems with redundancy

  • Jul 20, 2017
  • Performance Evaluation
  • Kristen Gardner +3
  • Research Article
  • Citations4

An execution/sleep scheduling policy for serving an additional job in priority queueing systems

  • Apr 01, 1993
  • Journal of the ACM
  • Kin K Leung
  • Research Article
  • Citations5

Efficient processor management schemes for mesh-connected multicomputers

  • May 11, 2001
  • Parallel Computing
  • Byung S Yoo +1
  • Conference Article
  • Citations299

Online job dispatching and scheduling in edge-clouds

  • May 01, 2017
  • Haisheng Tan +3
  • Conference Article
  • Citations10

Nudge: Stochastically Improving upon FCFS

  • May 31, 2021
  • Isaac Grosof +3
  • Research Article
  • Citations4

Nudge: Stochastically Improving upon FCFS

  • Jun 22, 2021
  • ACM SIGMETRICS Performance Evaluation Review
  • Isaac Grosof +3
  • Research Article

A Gittins Policy for Optimizing Tail Latency

  • Jun 16, 2025
  • ACM SIGMETRICS Performance Evaluation Review
  • Amit Harlev +2
  • Book Chapter
  • Citations30

Achieving Service Level Agreement in Cloud Environment Using Job Prioritization in Hierarchical Scheduling

  • Jan 01, 2012
  • Rajkumar Rajavel +1
  • Research Article

Frequency scaling in multilevel queues

  • Mar 05, 2021
  • ACM SIGMETRICS Performance Evaluation Review
  • Maryam Elahi +3
  • Conference Article
  • Citations8

Performance Analysis of Buffer Allocation Schemes under Heterogeneous Traffic with Individual Thresholds

  • Jan 01, 2006
  • Lan Wang +2
  • Research Article
  • Citations13

Analytical Results for Waiting Time and System Size Distributions in Two Parallel Queueing Systems

  • Jun 01, 1990
  • SIAM Journal on Applied Mathematics
  • Zhensheng Zhang
  • PDF
  • Research Article
  • Citations1

An Optimization Model for Scheduling Tour of Service Personnel in afterSale Service Process with Additional Side Conditions of Responsiveness and FCFS Service Policy

  • Jan 01, 2015
  • Industrial Engineering and Management
  • Devendra Choudhary
  • Conference Article
  • Citations49

A genetic algorithm inspired task scheduling in cloud computing

  • Apr 01, 2016
  • Mohit Agarwal +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.