{
  "slug": "first-come-first-served",
  "term": "First-come-first-served scheduling",
  "aliases": [
    "FCFS",
    "FIFO scheduling",
    "First-in first-out scheduling"
  ],
  "definition": "First-come-first-served is a nonpreemptive scheduling discipline that selects waiting requests in arrival order when service becomes available.",
  "note": "FCFS orders service selection, not requests by size or priority. Once a request starts, a later arrival does not interrupt it. The scheduling rule does not itself require Poisson arrivals; that is a separate assumption in an M/G/1 analysis. [soap]\n\nState the queue boundary and how simultaneous arrivals are ordered. With multiple servers, service selection order need not be completion order: an earlier request can take longer on another server. This is a consequence of the model, not a measured storage result. [hesela]\n\nA FIFO host queue does not establish end-to-end FCFS storage behavior. Linux blk-mq distinguishes staging, dispatch and tagged completion, and does not promise completion order. Higher layers must explicitly arrange any operation ordering they require. [blk-mq]\n\nFIFO cache replacement selects an eviction victim; FCFS scheduling selects work for service. They are separate uses of arrival order. [hesela]",
  "status": "shipping",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-19",
  "related": [
    "head-of-line-blocking",
    "queueing-delay",
    "io-scheduler",
    "fifo-replacement"
  ],
  "citations": [
    {
      "id": "soap",
      "title": "Scully et al. SOAP: One Clean Analysis of All Age-Based Scheduling Policies. PACM 2(1), 16 (2018), section 1. DOI: 10.1145/3179419.",
      "url": "https://ziv.codes/scully_soap_2018/scully_soap_2018.pdf",
      "accessed": "2026-11-19"
    },
    {
      "id": "blk-mq",
      "title": "Linux 6.16: Multi-Queue Block IO Queueing Mechanism, hardware dispatch queues and tag-based completion.",
      "url": "https://docs.kernel.org/6.16/block/blk-mq.html",
      "accessed": "2026-11-19"
    },
    {
      "id": "hesela",
      "title": "Hesela: queue order, blocked work and completion boundaries.",
      "url": "https://hesela.com/analyses/ssd-fairness-shared-queues/#queue-order",
      "accessed": "2026-11-19"
    }
  ],
  "provenance": [
    "Primary-source synthesis and scheduling-model reasoning; no new device benchmark or scheduler implementation."
  ]
}
