Dynamic storage allocation with known durations

DOI10.1016/S0166-218X(99)00175-4zbMath0948.68004MaRDI QIDQ5918029

Ariel Orda, Yael Petruschka, Joseph (Seffi) Naor

Publication date: 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

on-line storage allocation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Mathematical problems of computer architecture (68M07)

Related Items (1)

Single and multiple device DSA problems, complexities and online algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial time approximation algorithm for dynamic storage allocation
• On-Line Load Balancing of Temporary Tasks
• An Introduction to Combinatorial Models of Dynamic Storage Allocation
• Shelf Algorithms for Two-Dimensional Packing Problems
• The Linearity of First-Fit Coloring of Interval Graphs
• Orthogonal Packings in Two Dimensions
• A algorithm for two-dimensional packing
• Bandwidth Allocation with Preemption
• Approximation algorithms for dynamic storage allocation
• Bounds for Some Functions Concerning Dynamic Storage Allocation
• Tight Bounds for Dynamic Storage Allocation
• An Estimate of the Store Size Necessary for Dynamic Storage Allocation

This page was built for publication: Dynamic storage allocation with known durations