A fast implementation of the optimal off-line algorithm for solving the k-server problem

被引：0
|
作者：
Rudec, Tomislav [2 ]
Baumgartner, Alfonzo [2 ]
Manger, Robert [1 ]
机构：
[1] Univ Zagreb, Dept Math, Zagreb 10000, Croatia
[2] Univ Osijek, Fac Elect Engn, Osijek 31000, Croatia
来源：
MATHEMATICAL COMMUNICATIONS | 2009年 / 14卷 / 01期
关键词：
k-server problem; off-line algorithms; on-line algorithms; optimality; implementation; network flows; execution time; experiments; EFFICIENCY;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The optimal off-line algorithm for solving the k-server problem is usually implemented by network flows. In this paper, we first propose certain modifications to each step of the original network-flow implementation. Next, by experiments we demonstrate that the proposed modifications improve the speed of the algorithm. Finally, we investigate how similar ideas for improvement can also be applied to some related on-line algorithms.
引用
收藏
页码：119 / 134
页数：16
相关论文
共 50 条
  • [31] The k-Server Problem with Parallel Requests and the Compound Work Function Algorithm
    Hildenbrandt, R.
    BALTIC JOURNAL OF MODERN COMPUTING, 2020, 8 (01): : 1 - 20
  • [32] The CNN problem and other k-server variants
    Koutsoupias, E
    Taylor, DS
    THEORETICAL COMPUTER SCIENCE, 2004, 324 (2-3) : 347 - 359
  • [33] A general decomposition theorem for the k-server problem
    Seiden, SS
    INFORMATION AND COMPUTATION, 2002, 174 (02) : 193 - 202
  • [34] On Online Algorithms with Advice for the k-Server Problem
    Renault, Marc P.
    Rosen, Adi
    THEORY OF COMPUTING SYSTEMS, 2015, 56 (01) : 3 - 21
  • [35] Competitive algorithms for the bicriteria k-server problem
    Flammini, Michele
    Nicosia, Gaia
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (15) : 2117 - 2127
  • [36] On Online Algorithms with Advice for the k-Server Problem
    Marc P. Renault
    Adi Rosén
    Theory of Computing Systems, 2015, 56 : 3 - 21
  • [37] The k-server problem: A reinforcement learning approach
    Leandro, M
    Neto, ADD
    Melo, JD
    Proceedings of the International Joint Conference on Neural Networks (IJCNN), Vols 1-5, 2005, : 798 - 802
  • [38] The CNN problem and other k-server variants
    Koutsoupias, E
    Taylor, DS
    STACS 2000: 17TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2000, 1770 : 581 - 592
  • [39] A faster off-line algorithm for the TCP acknowledgement problem
    Noga, J
    Seiden, S
    Woeginger, GJ
    INFORMATION PROCESSING LETTERS, 2002, 81 (02) : 71 - 73
  • [40] The K-server problem via a modern optimization lens
    Bertsimas, Dimitris
    Jaillet, Patrick
    Korolko, Nikita
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 276 (01) : 65 - 78
12345