{
  "slug": "open-loop-load",
  "term": "Open-loop load",
  "aliases": [
    "Open workload model"
  ],
  "definition": "An open-loop load model schedules request arrivals independently of earlier request completions.",
  "note": "Finite generators still have capacity limits; retain scheduled, submitted, rejected and completed counts to check whether the intended arrival policy was achieved.",
  "related": [
    "closed-loop-load",
    "coordinated-omission",
    "queue-depth"
  ],
  "citations": [
    {
      "id": "schroeder",
      "title": "Schroeder, Wierman and Harchol-Balter. Open Versus Closed: A Cautionary Tale. USENIX NSDI 2006, sections 2-5 and 7.",
      "url": "https://www.usenix.org/legacy/events/nsdi06/tech/full_papers/schroeder/schroeder_html/index.html",
      "accessed": "2026-10-11"
    },
    {
      "id": "wrk2",
      "title": "Gil Tene, wrk2: scheduled-arrival latency and coordinated omission; maintainer documentation, not an SSD benchmark.",
      "url": "https://github.com/giltene/wrk2",
      "accessed": "2026-10-11"
    },
    {
      "id": "hesela-latency",
      "title": "Hesela: synthetic arrival cohorts, timing boundaries and percentile pooling",
      "url": "https://hesela.com/analyses/storage-latency-coordinated-omission/",
      "accessed": "2026-10-11"
    }
  ],
  "status": "unknown",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-10-11"
}