Sciweavers

62 search results - page 2 / 13
» On Choosing a Task Assignment Policy for a Distributed Serve...
Sort
View
SPAA
2003
ACM
13 years 10 months ago
Cycle stealing under immediate dispatch task assignment
We consider the practical problem of task assignment in a server farm, where each arriving job is immediately dispatched to a server in the farm. We look at the benefit of cycle ...
Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, ...
WOSP
2000
ACM
13 years 9 months ago
Analytic modeling of load balancing policies for tasks with heavy-tailed distributions
We present an analytic technique for modeling load balancing policies on a cluster of servers conditioned on the fact that the service times of arriving tasks are drawn from heavy...
Alma Riska, Evgenia Smirni, Gianfranco Ciardo
ANSS
1997
IEEE
13 years 9 months ago
Performance Issues of Task Routing and Task Scheduling with Resequencing in Homogeneous Distributed Systems
An important part of a distributed system design is the workload sharing among the processors. This includes partitioningthe arriving jobs into tasks that can be executed in paral...
Anthony Karageorgos, Helen D. Karatza
NETWORKING
2004
13 years 6 months ago
Distributed Scheduling of Recording Tasks with Interconnected Servers
We consider a system with multiple interconnected video servers storing TV programs that are received through satellite antennas. Users, equipped with set-top boxes, submit request...
Sergios Soursos, George D. Stamoulis, Theodoros Bo...
ICPADS
2007
IEEE
13 years 11 months ago
On the relative value of local scheduling versus routing in parallel server systems
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
Rong Wu, Douglas G. Down