A constant-time dynamic storage allocator for real-time systems
From MaRDI portal
Publication:1039289
DOI10.1007/s11241-008-9052-7zbMath1192.68145OpenAlexW2138837084WikidataQ57591151 ScholiaQ57591151MaRDI QIDQ1039289
Patricia Balbastre, Miguel Masmano, Alfons Crespo, Ismael Ripoll
Publication date: 27 November 2009
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-008-9052-7
Related Items (2)
An efficient algorithm for computing the distance between close partitions ⋮ CoMem: collaborative memory management for real-time operation within reactive sensor/actor networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the external storage fragmentation produced by first-fit and best-fit allocation strategies
- Buddy systems
- Bounds for Some Functions Concerning Dynamic Storage Allocation
- Evaluating models of memory allocation
- An Estimate of the Store Size Necessary for Dynamic Storage Allocation
This page was built for publication: A constant-time dynamic storage allocator for real-time systems