{
  "slug": "service-time",
  "term": "Service time",
  "aliases": [
    "service requirement"
  ],
  "definition": "Service time is the processing time required by a request at a specified resource, excluding time spent waiting for service there.",
  "note": "For one nonpreemptive stage, service time S is completion minus service start; queueing delay Q precedes service, and response time R = Q + S. With preemption, count actual service across its separate intervals. [queueing-practitioners]\n\nAsynchronous fio clat ends when fio reaps completion, so it is not an isolated device-processing measurement. Matching units do not make different timing boundaries equivalent. [fio-timing]\n\nThe existing synthetic FIFO trace has a request arriving at 10 ms, starting at 101 ms and completing at 102 ms: S = 1 ms, Q = 91 ms and R = 92 ms. The model supplies the service-start event; an observed completion alone does not. [hesela-timing]\n\nIn a separate constructed preempt-resume trace, request A runs during [0, 2) and [6, 8) ms. Its 8 ms residence contains 4 ms of service and 4 ms of later waiting, despite starting immediately. Completion minus first start would overcount service. The example assumes one server and no overhead or other state. [hesela-timing]",
  "status": "shipping",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "related": [
    "queueing-delay",
    "latency-storage",
    "completion-latency",
    "little-law",
    "pollaczek-khinchine-formula",
    "kingman-approximation",
    "tandem-queue",
    "shortest-remaining-processing-time",
    "request-slowdown",
    "processor-sharing"
  ],
  "citations": [
    {
      "id": "queueing-practitioners",
      "title": "Harchol-Balter and Scully: The most common queueing theory questions asked by computer systems practitioners, sections 1 and 2.1.",
      "url": "https://www.cs.cmu.edu/~harchol/Papers/TeaPACS21.pdf",
      "accessed": "2026-11-18"
    },
    {
      "id": "fio-timing",
      "title": "fio manual: interpreting slat, clat and lat; asynchronous completion observation.",
      "url": "https://fio.readthedocs.io/en/latest/fio_doc.html#interpreting-the-output",
      "accessed": "2026-11-18"
    },
    {
      "id": "hesela-timing",
      "title": "Hesela: separating waiting and processing in the existing synthetic FIFO trace.",
      "url": "https://hesela.com/analyses/storage-latency-coordinated-omission/#service-and-waiting",
      "accessed": "2026-11-18"
    }
  ]
}
