New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks

被引:0
作者
Angelelli, E
Speranza, MG
Tuza, Z
机构
[1] Univ Brescia, Dept Quantitat Methods, I-25122 Brescia, Italy
[2] Hungarian Acad Sci, Inst Comp & Automat, Budapest, Hungary
[3] Univ Veszprem, Dept Comp Sci, Veszprem, Hungary
关键词
semi on-line scheduling; parallel processors; competitive analysis;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper we study a semi on-line version of the classical multiprocessor scheduling problem on two identical processors. We assume that the sum of the tasks and an upper bound gamma on the size of each task are known. Each task has to be assigned upon arrival and the assignment cannot be changed later. The objective is the minimization of the maximum completion time on the processors. In this paper we propose new algorithms and improve known lower and upper bounds on the competitive ratio. Algorithms and bounds depend on the value of gamma. An optimal algorithm, with respect to the competitive ratio, is obtained for gamma is an element of [1/n, 2(n+1)/n(2n+1)] boolean OR{2n-1/2n(n-1)}, where n is any integer value, n >= 2.
引用
收藏
页码:1 / 15
页数:15
相关论文
共 8 条
[1]   Semi-on-line scheduling on two parallel processors with an upper bound on the items [J].
Angelelli, E ;
Speranza, MG ;
Tuza, Z .
ALGORITHMICA, 2003, 37 (04) :243-262
[2]  
Angelelli E., 2000, CEJOR CENT EUR J OPE, V8, P285
[3]   New algorithms for an ancient scheduling problem [J].
Bartal, Y ;
Fiat, A ;
Karloff, H ;
Vohra, R .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 51 (03) :359-366
[4]  
Faigle U., 1989, Acta Cybernetica, V9, P107
[5]   BOUNDS FOR CERTAIN MULTIPROCESSING ANOMALIES [J].
GRAHAM, RL .
BELL SYSTEM TECHNICAL JOURNAL, 1966, 45 (09) :1563-+
[6]   Semi on-line scheduling on two identical machines [J].
He, Y ;
Zhang, G .
COMPUTING, 1999, 62 (03) :179-187
[7]   Semi on-line algorithms for the partition problem [J].
Kellerer, H ;
Kotov, V ;
Speranza, MC ;
Tuza, Z .
OPERATIONS RESEARCH LETTERS, 1997, 21 (05) :235-242
[8]   AMORTIZED EFFICIENCY OF LIST UPDATE AND PAGING RULES [J].
SLEATOR, DD ;
TARJAN, RE .
COMMUNICATIONS OF THE ACM, 1985, 28 (02) :202-208