Tight Bounds for Dynamic Storage Allocation

DOI10.1137/S089548019325647XMaRDI QIDQ4875443zbMATH OpenFDO

Authors Michael Luby, Joseph (Seffi) Naor, Ariel Orda

Publication date 13 August 1996

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S089548019325647X

zbMATH Keywords

interval graphon-line algorithmsbandwidth allocationmemory managementfirst fitdynamic storage allocation

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05)

Recommendations

• scientific article; zbMATH DE number 1003306
• Approximation algorithms for dynamic storage allocation
• Dynamic storage allocation with known durations
• A provably efficient algorithm for dynamic storage allocation
• Dynamic storage allocation with known durations

Cited in

(12)

• scientific article; zbMATH DE number 1926660 (Why is no real title available?)
• Approximation algorithms for dynamic storage allocation
• A coloring problem for weighted graphs
• Cost-oblivious storage reallocation
• scientific article; zbMATH DE number 1003306 (Why is no real title available?)
• scientific article; zbMATH DE number 2080221 (Why is no real title available?)
• Dynamic storage allocation with known durations
• Dynamic storage allocation with known durations
• scientific article; zbMATH DE number 6399332 (Why is no real title available?)
• Reallocation problems in scheduling
• Analysis of space allocation in a generally fragmented linear store
• Dynamic spectrum allocation: the impotency of duration notification.

This page was built for publication: Tight Bounds for Dynamic Storage Allocation

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