{
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "slug": "shortest-remaining-processing-time",
  "term": "Shortest remaining processing time",
  "aliases": [
    "SRPT",
    "shortest remaining time first"
  ],
  "definition": "Shortest remaining processing time is a preemptive scheduling policy that serves the ready job with the least remaining service requirement.",
  "note": "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. [srpt-practice]\n\nThe 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. [srpt-web]\n\nIn 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. [hesela-srpt]",
  "related": [
    "request-slowdown",
    "service-time",
    "work-conserving-scheduler",
    "io-scheduler",
    "semi-preemptible-io"
  ],
  "citations": [
    {
      "id": "srpt-practice",
      "title": "Harchol-Balter and Scully. The most common queueing theory questions asked by computer systems practitioners. Sections 2.1 and 3.",
      "url": "https://www.cs.cmu.edu/~harchol/Papers/TeaPACS21.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "srpt-web",
      "title": "Harchol-Balter et al. Size-based Scheduling to Improve Web Performance. TOCS 2003; author manuscript, sections 2.2 and 3.1.",
      "url": "https://www.cs.cmu.edu/~mukesh/papers/srpt-tocs.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "hesela-srpt",
      "title": "Hesela: a finite SRPT trace and distinct slowdown denominators.",
      "url": "https://hesela.com/analyses/ssd-fairness-shared-queues/#srpt-objective",
      "accessed": "2026-11-20"
    }
  ],
  "provenance": [
    "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."
  ]
}
