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 条
  • [41] Deep reinforcement learning applied to the k-server problem
    Sousa Lins, Ramon Augusto
    Neto Doria, Adriao Duarte
    de Melo, Jorge Dantas
    EXPERT SYSTEMS WITH APPLICATIONS, 2019, 135 : 212 - 218
  • [42] The k-Server Problem with Advice in d Dimensions and on the Sphere
    Elisabet Burjons
    Dennis Komm
    Marcel Schöngens
    Algorithmica, 2019, 81 : 1859 - 1880
  • [43] The k-Server Problem with Advice in d Dimensions and on the Sphere
    Burjons, Elisabet
    Komm, Dennis
    Schongens, Marcel
    ALGORITHMICA, 2019, 81 (05) : 1859 - 1880
  • [44] A k-server problem with parallel requests and unit distances
    Hildenbrandt, R.
    INFORMATION PROCESSING LETTERS, 2014, 114 (05) : 239 - 246
  • [45] On the additive constant of the k-server Work Function Algorithm
    Emek, Yuval
    Fraigniaud, Pierre
    Korman, Amos
    Rosen, Adi
    INFORMATION PROCESSING LETTERS, 2010, 110 (24) : 1120 - 1123
  • [46] On Randomized Memoryless Algorithms for the Weighted k-server Problem
    Chiplunkar, Ashish
    Vishwanathan, Sundar
    2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 11 - 19
  • [47] The k-Server Problem with Advice in d Dimensions and on the Sphere
    Burjons, Elisabet
    Komm, Dennis
    Schoengens, Marcel
    SOFSEM 2018: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2018, 10706 : 396 - 409
  • [48] A DETERMINISTIC O(K(3))-COMPETITIVE K-SERVER ALGORITHM FOR THE CIRCLE
    FIAT, A
    RABANI, Y
    RAVID, Y
    SCHIEBER, B
    ALGORITHMICA, 1994, 11 (06) : 572 - 578
  • [49] The k-Server Problem with Parallel Requests and the Corresponding Generalized Paging Problem
    Hildenbrandt, R.
    OPERATIONS RESEARCH PROCEEDINGS 2017, 2018, : 205 - 211
  • [50] An On-line Routing Algorithm Based on the Off-line Optimal Computing in MPLS
    Hao, Kun
    Jin, Zhigang
    2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 4224 - +
12345