ON FAST ALGORITHMS FOR 2 SERVERS

被引：12
|
作者：
CHROBAK, M [1 ]
LARMORE, LL [1 ]
机构：
[1] UNIV CALIF RIVERSIDE,DEPT COMP SCI,RIVERSIDE,CA 92521
来源：
JOURNAL OF ALGORITHMS | 1991年 / 12卷 / 04期
关键词：
D O I：
10.1016/0196-6774(91)90035-W
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider 2-server algorithms with time complexity O(1) per each request. We show that the previously known algorithm BALANCE2 has competitiveness constant not better than 6, and we present another algorithm whose competitiveness constant is 4. © 1991.
引用
收藏
页码：607 / 614
页数：8
相关论文
共 50 条
  • [31] ALLOCATION OF SERVERS IN A TIME-SHARING SYSTEM - OBJECTS AND ALGORITHMS
    LUHMANN, S
    ANGEWANDTE INFORMATIK, 1978, (11): : 474 - 481
  • [32] MediaMesh: An architecture for integrating isochronous processing algorithms into media servers
    Amini, L
    Lepre, J
    Kienzle, M
    MULTIMEDIA COMPUTING AND NETWORKING 2000, 2000, 3969 : 14 - 25
  • [33] On the Robustness of the 2Sum and Fast2Sum Algorithms
    Boldo, Sylvie
    Graillat, Stef
    Muller, Jean-Michel
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2017, 44 (01):
  • [34] FAST SUBSUMPTION ALGORITHMS
    GOTTLOB, G
    LEITSCH, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 204 : 64 - 77
  • [35] Fast Genetic Algorithms
    Doerr, Benjamin
    Huu Phuoc Le
    Makhmara, Regis
    Ta Duy Nguyen
    PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'17), 2017, : 777 - 784
  • [36] Approximations and fast algorithms
    Beylkin, G
    WAVELETS: APPLICATIONS IN SIGNAL AND IMAGE PROCESSING IX, 2001, 4478 : 1 - 8
  • [37] Fast Algorithms For PTFTs
    Bi, Guoan
    Li, Gang
    2011 6TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA), 2011, : 2534 - 2537
  • [38] FAST DIVISIBILITY ALGORITHMS
    GORDON, HT
    DR DOBBS JOURNAL, 1983, 8 (06): : 14 - &
  • [39] FAST ENVELOPE ALGORITHMS
    Cook, R. Dennis
    Zhang, Xin
    STATISTICA SINICA, 2018, 28 (03) : 1179 - 1197
  • [40] Multi-CPU servers promise fast analysis, graphics
    不详
    MACHINE DESIGN, 1997, 69 (11) : 31 - 31
12345