Efficient algorithms for dynamic allocation of distributed memory

DOI10.1007/PL00009275zbMATH Open0934.68005OpenAlexW2167404168MaRDI QIDQ1293882FDOQ1293882

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

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

zbMATH Keywords

distributed dynamic allocation problemon-line allocation algorithm

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Cited In (19)

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

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)