Sciweavers

68 search results - page 13 / 14
» Online scheduling of parallel jobs on two machines is 2-comp...
Sort
View
JCO
2010
70views more  JCO 2010»
13 years 4 months ago
Worst-case analysis for on-line service policies
This paper considers an on-line scheduling problem occurred in a service system with two classes (normal and special) of customers and two types (dedicated and flexible) of serve...
Zhenbo Wang, Wenxun Xing
APPROX
2006
Springer
89views Algorithms» more  APPROX 2006»
13 years 9 months ago
Online Algorithms to Minimize Resource Reallocations and Network Communication
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
Sashka Davis, Jeff Edmonds, Russell Impagliazzo
FOCS
2007
IEEE
13 years 9 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
BIRTHDAY
2009
Springer
13 years 9 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
HPDC
2003
IEEE
13 years 11 months ago
SODA: A Service-On-Demand Architecture for Application Service Hosting Utility Platforms
The Grid is realizing the vision of providing computation as utility: computation jobs can be scheduled on-demand in Grid hosts based on available computation capacity. In this pa...
Xuxian Jiang, Dongyan Xu