Skip to main content
SpringerLink
Log in

Extending the Accommodating Function

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2387))

Included in the following conference series:

Abstract

The applicability of the accommodating function, a relatively new measure for the quality of on-line algorithms, is extended. If a limited amount n of some resource is available, the accommodating function \( \mathcal{A} \) (α) is the competitive ratio when input sequences are restricted to those for which the amount α n of resources suffices for an optimal off-line algorithm. The accommodating function was originally used only for α ≥ 1. We focus on α < 1, observe that the function now appears interesting for a greater variety of problems, and use it to make new distinctions between known algorithms and to find new ones.

Supported in part by the Future and Emerging Technologies program of the EU under contract number IST-1999-14186 (ALCOM-FT) and in part by the Danish Natural Science Research Council (SNF).

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Azar, J. Boyar, L. Epstein, L. M. Favrholdt, K. S. Larsen, and M. N. Nielsen. Fair versus Unrestricted Bin Packing. Algorithmica. To appear. Preliminary version in SWAT 2000.

    Google Scholar 

  2. Y. Azar, L. Epstein, and R. van Stee. Resource Augmentation in Load Balancing. In SWAT 2000, volume 1851 of LNCS, pages 189–199, 2000.

    Chapter  Google Scholar 

  3. E. Bach, J. Boyar, L. Epstein, L. M. Favrholdt, T. Jiang, K. S. Larsen, G.-H. Lin, and R. van Stee. Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. Journal of Scheduling. To appear. Preliminary version in COCOON 2000.

    Google Scholar 

  4. J. Boyar, L. M. Favrholdt, K. S. Larsen, and M. N. Nielsen. Extending the Accommodating Function. Technical report PP-2002-02, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, 2002.

    Google Scholar 

  5. J. Boyar and K. S. Larsen. The Seat Reservation Problem. Algorithmica, 25:403–417, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  6. Joan Boyar, Kim S. Larsen, and Morten N. Nielsen. The Accommodating Function: a generalization of the competitive ratio. SIAM Journal on Computing, 31(1):233–258, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Brehop, E. Torng, and P. Uthaisombut. Applying Extra Resource Analysis to Load Balancing. Journal of Scheduling, 3:273–288, 2000.

    Article  MathSciNet  Google Scholar 

  8. M. Chrobak and M. Slusarek. On Some Packing Problems Related to Dynamic Storage Allocation. RAIRO Informatique Théoretique et Applications, 22:487–499, 1988.

    MathSciNet  MATH  Google Scholar 

  9. E. Koutsoupias. Weak Adversaries for the k-Server Problem. In FOCS, pages 444–449, 1999.

    Google Scholar 

  10. R. L. Graham. Bounds for Certain Multiprocessing Anomalies. Bell Systems Technical Journal, 45:1563–1581, 1966.

    Google Scholar 

  11. T. R. Jensen and B. Toft. Graph Coloring Problems. John Wiley & Sons, 1995.

    Google Scholar 

  12. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. In FOCS, pages 214–221, 1995.

    Google Scholar 

  13. H. A. Kierstead and J. Qin. Coloring Interval Graphs with First-Fit. Discrete Mathematics, 144:47–57, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  14. H. A. Kierstead and W. T. Trotter. An Extremal Problem in Recursive Combinatorics. Congressus Numerantium, 33:143–153, 1981.

    MathSciNet  Google Scholar 

  15. M. S. Manasse, L. A. McGeoch, and D. D. Sleator. Competitive Algorithms for Server Problems. Journal of Algorithms, 11(2):208–230, June 1990.

    Google Scholar 

  16. D. D. Sleator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM, 28(2):202–208, 1985.

    Article  MathSciNet  Google Scholar 

  17. N. Young. On-Line Caching as Cache Size Varies. In SODA, pages 241–250, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Southern Denmark, Odense

    Joan Boyar, Lene M. Favrholdt, Kim S. Larsen & Morten N. Nielsen

Authors
  1. Joan Boyar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lene M. Favrholdt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kim S. Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Morten N. Nielsen
    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 California, Santa Barbara, California, 93106, USA

    Oscar H. Ibarra

  2. Department of Mathematics, National University of Singapore, Singapore, Singapore, 117543

    Louxin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boyar, J., Favrholdt, L.M., Larsen, K.S., Nielsen, M.N. (2002). Extending the Accommodating Function. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-45655-4_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43996-7

  • Online ISBN: 978-3-540-45655-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation