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