scientific article; zbMATH DE number 4046862

MaRDI QIDQ3783352zbMATH OpenFDO

Authors Václav E. Beneš

Publication date 1982

zbMATH Keywords

Markov dynamic programmingnumerical solution of the Bellman equationoptimal allocationoptimal route for a telephone call

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Recommendations

• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• Efficient algorithms for dynamic allocation of distributed memory
• Chainmail: A Model of First-fit Memory Allocation
• A provably efficient algorithm for dynamic storage allocation
• Insertion and Compaction Algorithms in Sequentially Allocated Storage

Cited in

(16)

• Iterative approaches for a dynamic memory allocation problem in embedded systems
• Algorithms for optimization of retrieval in a distributed memory system
• Mathematical models of program segmentation.
• Optimality and greed in dynamic allocation
• On approximating the memory-constrained module allocation problem
• scientific article; zbMATH DE number 3854406 (Why is no real title available?)
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• scientific article; zbMATH DE number 4080874 (Why is no real title available?)
• Multi-dimensional state-space model for memory management
• scientific article; zbMATH DE number 1305512 (Why is no real title available?)
• scientific article; zbMATH DE number 541197 (Why is no real title available?)
• Chainmail: A Model of First-fit Memory Allocation
• Evaluating models of memory allocation
• A mathematical model and a metaheuristic approach for a memory allocation problem
• A dynamic storage process
• A provably efficient algorithm for dynamic storage allocation

This page was built for publication:

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