Efficient algorithms for dynamic allocation of distributed memory
From MaRDI portal
(Redirected from Publication:1293882)
Recommendations
Cited in
(19)- scientific article; zbMATH DE number 3928336 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1897128 (Why is no real title available?)
- scientific article; zbMATH DE number 4046862 (Why is no real title available?)
- A high performance memory allocator for object-oriented systems
- Fast allocation and deallocation with an improved buddy system
- scientific article; zbMATH DE number 4080874 (Why is no real title available?)
- The working set model for program behavior
- Dynamic parallel memories
- scientific article; zbMATH DE number 1875376 (Why is no real title available?)
- 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
- An algorithm for dynamic data allocation in distributed systems
- Dynamic Task Allocation in Asynchronous Shared Memory
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)