Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation

Authors:
Kirk Pruhs;Eric Wiewiora
Affiliations:
-;-
Venue:
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Year:
2002

Citing 5
Cited 0

A polynomial time approximation algorithm for Dynamic Storage Allocation

Discrete Mathematics
Algorithms for compile-time memory optimization

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Dynamic Storage Allocation: A Survey and Critical Review

IWMM '95 Proceedings of the International Workshop on Memory Management
Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We empirically compare the local ratio algorithm for the profit maximization version of the dynamic storage allocation problem against various greedy algorithms. Our main conclusion is that, at least on our input distributions, the local ratio algorithms performed worse on average than the more naive greedy algorithms.