arXiv (All)
open access
Tight Bounds for Memory Allocation With and Without Request Fragmentation
The classical memory-allocation problem captures the task of placing objects of different sizes in memory, while minimizing the so-called memory high-water mark. It has been known since the early 1970s that the optimal competitive ratio for any deterministic online allocator is $Θ(\log M)$, where $M
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
- Tight Bounds for Memory Allocation With and Without Request Fragmentation#788466
- Optimal Transport in Economics#973865
- Dense Pinwheel Packing Is Strongly NP-Complete#1033853
- Memory behavior of a randomly driven model glass#630289
- Optimization without Future Compromises? Decentralized Coordination via Collective and Reinforcement Learning#1063786
Record · ID 792466
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