OSF
open access
The Retreating Flag: What Time-Sharing Does to Peterson’s Algorithm, and a Lab That Shows It
Textbooks compare Dekker’s and Peterson’s algorithms on a machine without a scheduler, and Peterson’s wins. We use one controlled, scheduler-dependent execution to expose what that comparison leaves implicit: formal correctness does not determine operational behavior. On a single time-shared process
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
- Leveraging I/O Stalls for Efficient Scheduling in ANNS#204867
- A Forensic and Theoretical Audit of Constraint Transfer Theory: Spacetime Architecture, Algorithmic Governance, and Global Priority Topologies#15578
- A Forensic and Theoretical Audit of Constraint Transfer Theory: Spacetime Architecture, Algorithmic Governance, and Global Priority Topologies#15577
- Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete#129474
- On the Limits of Performance Portability in Directive-Based GPU Programming#271800
Record · ID 1180062
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