Greedy multiprocessor server scheduling

被引:12
|
作者
Bussema, Carl [1 ]
Torng, Eric [1 ]
机构
[1] Michigan State Univ, Dept Comp Sci & Engn, E Lansing, MI 48824 USA
关键词
online scheduling; algorithms; flow; multiprocessor; l(p) norm; greedy;
D O I
10.1016/j.orl.2005.07.005
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We show that the greedy highest density first (HDF) algorithm is (1 + epsilon)-speed O(1) -competitive for the problem of minimizing the lp norms of weighted flow time on in identical machines. Similar results for minimizing unweighted flow provide insight into the power of migration. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:451 / 458
页数:8
相关论文
共 50 条