An Introduction to Combinatorial Models of Dynamic Storage Allocation

DOI10.1137/1025074zbMath0521.68027OpenAlexW1985914682MaRDI QIDQ3670545

Edward 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)

Related Items (15)

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 ⋮ On a storage allocation model with finite capacity ⋮ CHECKCOL: improved local search for graph coloring ⋮ Coloring graphs by iterated local search traversing feasible and infeasible solutions ⋮ On some packing problem related to dynamic storage allocation ⋮ Embedding a novel objective function in a two-phased local search for robust vertex coloring ⋮ Dynamic storage allocation with known durations ⋮ An approximation result for a periodic allocation problem ⋮ A two-phase heuristic for strip packing: Algorithm and probabilistic analysis ⋮ Storage allocation under processor sharing II: Further asymptotic results ⋮ A provably efficient algorithm for dynamic storage allocation ⋮ Dynamic spectrum allocation: the impotency of duration notification. ⋮ A note on the dynamic storage allocation problem

This page was built for publication: An Introduction to Combinatorial Models of Dynamic Storage Allocation