Sciweavers

254 search results - page 45 / 51
» Approximation Algorithms for Scheduling Parallel Jobs
Sort
View
SPAA
2003
ACM
14 years 20 days 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, ...
SIGCOMM
2012
ACM
11 years 10 months ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey
EUROPAR
2005
Springer
14 years 28 days ago
Hierarchical Scheduling for Moldable Tasks
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
Pierre-François Dutot
JSSPP
2007
Springer
14 years 1 months ago
Enhancing an Open Source Resource Manager with Multi-core/Multi-threaded Support
Current resource managers do not have adequate node allocation and distribution strategies to efficiently schedule jobs on multi-core multi-threaded systems. Clusters composed of ...
Susanne M. Balle, Daniel J. Palermo
CCGRID
2006
IEEE
14 years 1 months ago
Imprecise Computation Grid Application Model for Flexible Market-Based Resource Allocation
Market-based resource management is becoming an emerging issue as the utilization of Grid computing is growing rapidly, particularly in the business field. In this paper, we prov...
Kyong Hoon Kim, Rajkumar Buyya, Jong Kim