Network servers make special demands that other types of applications may not make on memory allocators. We describe a simple malloc() microbenchmark suite that tests the ability ...
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
This paper argues that economic theory can improve our understanding of memory management. We introduce the allocation curve, as an analogue of the demand curve from microeconomic...
Jeremy Singer, Richard E. Jones, Gavin Brown, Mike...
We present a simple auction protocol for the sale of overdemanded goods with a delivery schedule. Under some reasonable assumptions, our mechanism is incentive compatible, collect...
We present a unification-based, context-sensitive escape and effect analysis that infers lightweight method summaries describing heap effects. The analysis is parameterized on two...