A constant-time dynamic storage allocator for real-time systems

DOI10.1007/S11241-008-9052-7MaRDI QIDQ1039289zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Miguel Masmano, Ismael Ripoll, Patricia Balbastre, Alfons Crespo

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

zbMATH Keywords

dynamic storage allocationallocation algorithms evaluationreal-time allocators

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 2080756
• Fast allocation and deallocation with an improved buddy system
• Algorithms for resolving conflicts in dynamic storage allocation
• Dynamic storage allocation with limited compaction - complexity and some practical implications
• Tight Bounds for Dynamic Storage Allocation

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1033260 (Why is no real title available?)
• scientific article; zbMATH DE number 2011483 (Why is no real title available?)
• An Estimate of the Store Size Necessary for Dynamic Storage Allocation
• Bounds for Some Functions Concerning Dynamic Storage Allocation
• Buddy systems
• Evaluating models of memory allocation
• On the external storage fragmentation produced by first-fit and best-fit allocation strategies

Cited in

(4)

• CoMem: collaborative memory management for real-time operation within reactive sensor/actor networks
• scientific article; zbMATH DE number 2080756 (Why is no real title available?)
• An efficient algorithm for computing the distance between close partitions
• A verified specification of TLSF memory management allocator using state monads

This page was built for publication: A constant-time dynamic storage allocator for real-time systems

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