Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithm Engineering and Experimentation

ALENEX 2002: Algorithm Engineering and Experiments pp 60–70Cite as

Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation

  • Conference paper
  • First Online:

  • 567 Accesses

Part of the book series: Lecture Notes in Computer Science ((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.

Supported in part by NSF grants CCR-9734927, CCR-0098752, ANIR-0123705, and by a grant from the US Air Force.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. E. Coffman, “An introduction to combinatorial models of dynamic storage allocation”, SIAM Review, 25, 311–325, 1999.

    Article  MathSciNet  Google Scholar 

  3. J. Gergov, “Algorithms for compile-time memory allocation”, ACM/SIAM Symposium on Discrete Algorithms, S907–S908, 1999.

    Google Scholar 

  4. H. Kierstead, “A polynomial time approximation algorithm for dynamic storage allocation”, Discrete Mathematics, 88, 231–237, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA, 15260, USA

    Kirk Pruhs

  2. Computer Science and Engineering Department, University of California, San Diego

    Eric Wiewiora

Authors
  1. Kirk Pruhs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eric Wiewiora
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, MD, 20742, USA

    David M. Mount

  2. Department of IEOR, Columbia University, 500W. 120 St., MC 4704, New York, NY, 10027, USA

    Clifford Stein

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pruhs, K., Wiewiora, E. (2002). Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation. In: Mount, D.M., Stein, C. (eds) Algorithm Engineering and Experiments. ALENEX 2002. Lecture Notes in Computer Science, vol 2409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45643-0_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45643-0_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43977-6

  • Online ISBN: 978-3-540-45643-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation