Tight Bounds for Dynamic Storage Allocation

DOI10.1137/S089548019325647XzbMATH Open0843.60014MaRDI QIDQ4875443FDOQ4875443

Ariel Orda, Michael Luby, Joseph (Seffi) Naor

Publication date: 13 August 1996

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

Recommendations

• scientific article
• 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

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)

Cited In (9)

• Title not available (Why is that?)
• A coloring problem for weighted graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dynamic storage allocation with known durations
• Title not available (Why is that?)
• 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)