An Introduction to Combinatorial Models of Dynamic Storage Allocation
DOI10.1137/1025074zbMATH Open0521.68027OpenAlexW1985914682MaRDI QIDQ3670545FDOQ3670545
Authors: E. G. jun. Coffman 
Publication date: 1983
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1025074
performanceapproximation algorithmsasymptotic boundsdynamic storage allocationcheckerboardinginefficient use of storageinternal fragmentationpartition fragmentation
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Cited In (15)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- An approximation result for the interval coloring problem on claw-free chordal graphs
- Assigning service requests in voice-over-internet gateway multiprocessors
- Some exact and asymptotic solutions to single server models of dynamic storage
- Storage allocation under processor sharing. II: Further asymptotic results
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
- A provably efficient algorithm for dynamic storage allocation
- Dynamic storage allocation with known durations
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- An approximation result for a periodic allocation problem
- On a storage allocation model with finite capacity
- A note on the dynamic storage allocation problem
- On some packing problem related to dynamic storage allocation
- CHECKCOL: improved local search for graph coloring
- Dynamic spectrum allocation: the impotency of duration notification.
This page was built for publication: An Introduction to Combinatorial Models of Dynamic Storage Allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670545)
