Host-Based Allocators for Device Memory
Oren Bell, Ashwin Kumar, Chris Gill

TL;DR
This paper introduces a new model for device memory allocation where the allocator runs on host memory without reading device memory, challenging traditional algorithms and proposing alternative solutions.
Contribution
It presents novel algorithms for device memory allocation under the constraint that allocators cannot read device memory, requiring a fundamental shift from classical methods.
Findings
Proposed algorithms work without boundary tags.
Discussion on implications of host-based allocation model.
Reevaluation of classical memory management algorithms.
Abstract
Memory allocation is a fairly mature field of computer science. However, we challenge a prevailing assumption in the literature over the last 50 years which, if reconsidered, necessitates a fundamental reevaluation of many classical memory management algorithms. We pose a model where the allocation algorithm runs on host memory but allocates device memory and so incur the following constraint: the allocator can't read the memory it is allocating. This means we are unable to use boundary tags, which is a concept that has been ubiquitous in nearly every allocation algorithm. In this paper, we propose alternate algorithms to work around this constraint, and discuss in general the implications of this system model.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Advanced Memory and Neural Computing · Ferroelectric and Negative Capacitance Devices
