Skip to main content
SpringerLink
Log in

The k-Server Problem with Parallel Requests and the Corresponding Generalized Paging Problem

  • Conference paper
  • First Online:
Operations Research Proceedings 2017

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

The (usual) k-server problem was introduced by Manasse, McGeoch and Sleator in 1988. Meanwhile it is the most studied problem in the area of competitive online problems. In [4] (Information Processing Letters, 114(5):239–246, 2014) we have created a generalized k-server problem with parallel requests. This research was initiated by an operations research problem which consists of optimal conversions of machines or moulds. In the present paper we give a first summary of “competitive” algorithms for solving the “k-server problems with parallel requests” or the generalized paging problem.

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

Notes

  1. 1.

    Diploma thesis, in preparation.

References

  1. Bartal, Y., & Grove, E. (2000). The Harmonic k-Server Algorithm Is Competive. Journal of the ACM, 47(1), 1–15.

    Article  Google Scholar 

  2. Borodin, A., & El-Yaniv, R. (1998). Online computation and competitive analysis. Cambrigde: University Press.

    Google Scholar 

  3. Langrock, P., & Jahn, W. (1979). Einführung in die Theorie der Markovschen Ketten und ihre Anwendungen. Leipzig: Teubner.

    Google Scholar 

  4. Hildenbrandt, R. (2014). A k-server problem with parallel requests and unit distances. Information Processing Letters, 114(5), 239–246. https://doi.org/10.1016/j.ipl.2013.12.011.

    Article  Google Scholar 

  5. Hildenbrandt, R. (2016). The k-server problem with parallel requests and the compound harmonic algorithm. Baltic Journal of Modern Computing, 4(3), 607–629.

    Google Scholar 

  6. Hildenbrandt, R. (2017). The k-Server Problem with Parallel Requests and the Compound Work Function Algorithm (pp. 17–04). Preprint No: Inst. f. Mathematik.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ilmenau Technical University, PF 10 06 65, 98684, Ilmenau, Germany

    R. Hildenbrandt

Authors
  1. R. Hildenbrandt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Hildenbrandt .

Editor information

Editors and Affiliations

  1. Department of Information Systems, Freie Universität Berlin, Berlin, Germany

    Natalia Kliewer

  2. Management Science Group, Otto-von-Guericke Universität Magdeburg, Magdeburg, Germany

    Jan Fabian Ehmke

  3. Department of Mathematics, Freie Universität Berlin, Berlin, Germany

    Ralf Borndörfer

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hildenbrandt, R. (2018). The k-Server Problem with Parallel Requests and the Corresponding Generalized Paging Problem. In: Kliewer, N., Ehmke, J., Borndörfer, R. (eds) Operations Research Proceedings 2017. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-89920-6_29

Download citation

Publish with us

Policies and ethics

Search

Navigation