An Introduction to Combinatorial Models of Dynamic Storage Allocation

DOI10.1137/1025074MaRDI QIDQ3670545zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

performanceapproximation algorithmsasymptotic boundsdynamic storage allocationcheckerboardinginefficient use of storageinternal fragmentationpartition fragmentation

Mathematics Subject Classification ID

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
• Dynamic storage allocation with known durations
• Dynamic spectrum allocation: the impotency of duration notification.
• A note on the dynamic storage allocation problem
• A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
• Embedding a novel objective function in a two-phased local search for robust vertex coloring
• A provably efficient algorithm for dynamic storage allocation
• An approximation result for a periodic allocation problem
• On some packing problem related to dynamic storage allocation
• An approximation result for the interval coloring problem on claw-free chordal graphs
• On a storage allocation model with finite capacity
• Some exact and asymptotic solutions to single server models of dynamic storage
• Storage allocation under processor sharing. II: Further asymptotic results
• CHECKCOL: improved local search for graph coloring
• Assigning service requests in voice-over-internet gateway multiprocessors

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)