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 条
  • [1] A fast work function algorithm for solving the k-server problem
    Rudec, Tomislav
    Baumgartner, Alfonzo
    Manger, Robert
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2013, 21 (01) : 187 - 205
  • [2] A fast work function algorithm for solving the k-server problem
    Tomislav Rudec
    Alfonzo Baumgartner
    Robert Manger
    Central European Journal of Operations Research, 2013, 21 : 187 - 205
  • [3] A randomized on-line algorithm for the k-server problem on a line
    Csaba, Bala
    Lodha, Sachin
    RANDOM STRUCTURES & ALGORITHMS, 2006, 29 (01) : 82 - 104
  • [4] A network flow implementation of a modified work function algorithm for solving the k-server problem
    Baumgartner, Alfonzo
    Manger, Robert
    Hocenski, Zeljko
    SOR'07: PROCEEDINGS OF THE 9TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH IN SLOVENIA, 2007, : 83 - +
  • [5] On the competitiveness of a modified work function algorithm for solving the on-line k-server problem
    Rudec, Tomislav
    Manger, Robert
    PROCEEDINGS OF THE ITI 2008 30TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2008, : 779 - +
  • [6] Work function algorithm with a moving window for solving the on-line k-server problem
    Baumgartner, Alfonzo
    Manger, Robert
    Hocenski, Zeljko
    PROCEEDINGS OF THE ITI 2007 29TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2007, : 591 - +
  • [7] Work function algorithm with a moving window for solving the on-line k-server problem
    Baumgartner, Alfonzo
    Manger, Robert
    Hocenski, Željko
    Journal of Computing and Information Technology, 2007, 15 (04) : 325 - 330
  • [8] THE DESIGN AND ANALYSIS OF A MODIFIED WORK FUNCTION ALGORITHM FOR SOLVING THE ON-LINE K-SERVER PROBLEM
    Baumgartner, Alfonzo
    Rudec, Tomislav
    Manger, Robert
    COMPUTING AND INFORMATICS, 2010, 29 (04) : 681 - 700
  • [9] A Polylogarithmic-Competitive Algorithm for the k-Server Problem
    Bansal, Nikhil
    Buchbinder, Niv
    Madry, Aleksander
    Naor, Joseph
    JOURNAL OF THE ACM, 2015, 62 (05)
  • [10] The k-server problem
    Koutsoupias, Elias
    COMPUTER SCIENCE REVIEW, 2009, 3 (02) : 105 - 118
12345