Efficient algorithms for dynamic allocation of distributed memory

DOI10.1007/PL00009275MaRDI QIDQ1293882zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 3 April 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00009275

zbMATH Keywords

distributed dynamic allocation problemon-line allocation algorithm

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• A provably efficient algorithm for dynamic storage allocation
• Competitive distributed file allocation.
• scientific article; zbMATH DE number 1003306
• Algorithms for resolving conflicts in dynamic storage allocation
• Parallelism versus memory allocation in pipelined router forwarding engines

Cited in

(21)

• Fast allocation and deallocation with an improved buddy system
• Maintaining Arrays of Contiguous Objects
• Dynamic parallel memories
• scientific article; zbMATH DE number 3928336 (Why is no real title available?)
• Probabilistic analysis of a network resource allocation algorithm
• Algorithms for resolving conflicts in dynamic storage allocation
• scientific article; zbMATH DE number 4046862 (Why is no real title available?)
• scientific article; zbMATH DE number 4080874 (Why is no real title available?)
• A high performance memory allocator for object-oriented systems
• Chainmail: A Model of First-fit Memory Allocation
• Experience with an efficient parallel kernel memory allocator
• scientific article; zbMATH DE number 1875376 (Why is no real title available?)
• scientific article; zbMATH DE number 1897128 (Why is no real title available?)
• Some distributed algorithms revisited
• Evaluating models of memory allocation
• Dynamic Task Allocation in Asynchronous Shared Memory
• The working set model for program behavior
• An algorithm for dynamic data allocation in distributed systems
• A provably efficient algorithm for dynamic storage allocation
• Parallelism versus memory allocation in pipelined router forwarding engines
• Competitive algorithms for distributed data management.

This page was built for publication: Efficient algorithms for dynamic allocation of distributed memory

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