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

R. Hildenbrandt ()
Additional contact information
R. Hildenbrandt: Ilmenau Technical University

A chapter in Operations Research Proceedings 2017, 2018, pp 205-211 from Springer

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

Keywords: Generalized k-server problems; Competitive algorithms; Generalized paging (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-89920-6_29

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

DOI: 10.1007/978-3-319-89920-6_29

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().