Advertisement

Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation

  • Kirk Pruhs
  • Eric Wiewiora
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2409)

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.

Keywords

Greedy Algorithm Competitive Ratio Experimental Space Input Distribution Horizontal Slice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Barnoy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber, ”A unified approach to approximating resource allocation and scheduling”, ACM Symposium on Theory of Computing, 2000. To appear in JACM.Google Scholar
  2. 2.
    E. Coffman, “An introduction to combinatorial models of dynamic storage allocation”, SIAM Review, 25, 311–325, 1999.CrossRefMathSciNetGoogle Scholar
  3. 3.
    J. Gergov, “Algorithms for compile-time memory allocation”, ACM/SIAM Symposium on Discrete Algorithms, S907–S908, 1999.Google Scholar
  4. 4.
    H. Kierstead, “A polynomial time approximation algorithm for dynamic storage allocation”, Discrete Mathematics, 88, 231–237, 1991.CrossRefMathSciNetzbMATHGoogle Scholar
  5. 5.
    S. Leonardi, A. Marchetti-Spaccamela and A. Vitaletti, “Approximation algorithms for bandwidth and storage allocation problems under real time constraints”, Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2000.Google Scholar
  6. 6.
    P. Wilson, M. Johnstone, M. Neely, and D. Boles, “Dynamic storage allocation: a survey and critical review”, International Workshop on Memory Management, Lecture Notes in Computer Science, 986, 1–116, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Kirk Pruhs
    • 1
  • Eric Wiewiora
    • 2
  1. 1.Dept. of Computer ScienceUniversity of PittsburghPittsburghUSA
  2. 2.Computer Science and Engineering DepartmentUniversity of CaliforniaSan Diego

Personalised recommendations