shortest-remaining-processing-time · research · also SRPT, shortest remaining time first

Shortest remaining processing time

Shortest remaining processing time is a preemptive scheduling policy that serves the ready job with the least remaining service requirement.

Related Observatory article: Read on hesela.com

Ideal model: one server, known service requirements and cost-free preempt-resume give SRPT its mean-response-time optimality; an estimated size or multiple servers changes the problem. Remaining work is not original size or elapsed wall time. [1]

The published web-server implementation approximated priorities with size bands and updated them as data was sent. Its Linux 2.2.16 network-bottleneck experiments are not SSD benchmarks. [2]

In a constructed three-job example, SRPT reduces mean response from 8 to 4 ms while one job rises from 8 to 10 ms. Lower mean latency therefore does not establish a per-request deadline. [3]

Relations

related
Request slowdown, Service time, Work-conserving scheduler, I/O scheduler, Semi-preemptible I/O

Citations

  1. Harchol-Balter and Scully. The most common queueing theory questions asked by computer systems practitioners. Sections 2.1 and 3. (accessed 2026-11-20)
  2. Harchol-Balter et al. Size-based Scheduling to Improve Web Performance. TOCS 2003; author manuscript, sections 2.2 and 3.1. (accessed 2026-11-20)
  3. Hesela: a finite SRPT trace and distinct slowdown denominators. (accessed 2026-11-20)
Sources & caveats
  • Primary-source synthesis and an exact synthetic trace; no device or scheduler benchmark.
  • Paper implementation and ideal policy are distinguished; no universal starvation or deadline guarantee is claimed.

JSON: /data/terms/shortest-remaining-processing-time.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Shortest remaining processing time. Hesela. 2026-11-20. https://hesela.dev/terms/shortest-remaining-processing-time/