Choice-Memory Tradeoff in Allocations

DOI10.1109/FOCS.2009.49MaRDI QIDQ5171179zbMATH OpenOpenAlexFDO

Authors Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich

Publication date 25 July 2014

Published in 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/focs.2009.49

Mathematics Subject Classification ID

Combinatorial probability (60C05) Sums of independent random variables; random walks (60G50) Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• A lower bound on the queueing delay in resource constrained load balancing
• Recency-Abstraction for Heap-Allocated Storage
• Quantifying and evaluating the space overhead for alternative C++ memory layouts
• Choosing an optimum version of main-memory allocation
• Choice-memory tradeoff in allocations

This page was built for publication: Choice-Memory Tradeoff in Allocations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171179)