arXiv (OAI Expanded)
open access
Paging with Per-Replacement Maximum Delay
Classical paging serves every miss immediately. We study paging with per-replacement maximum delay, where loading a pending page costs one movement plus the age of its oldest outstanding request and clears that page's entire episode. Equivalently, the holding rate is the number of pending pages. F
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Reverse Sequential Proportional Approval Voting Rule: Proportionality and Approximation Guarantees#1129923
- 7 U.S.C. § 2903 — Issuance of orders#560841
- Generalized Compare-and-Swap and Space-Efficient Universal Constructions for the Infinite-Arrival Model#204759
- 38 U.S.C. § 4110B — Coordination and nonduplication#587421
- 40 CFR Part 24 — Rules Governing Issuance of and Administrative Hearings on Interim Status Corrective Action Orders#509368
Record · ID 1056366
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive