254 search results - page 45 / 51 » Approximation Algorithms for Scheduling Parallel Jobs |
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
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 ...
109
click to vote
SIGCOMM
2012
ACM
12 years 12 months ago
2012
ACM
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...
100
click to vote
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
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 ...
69
Voted
JSSPP
2007
Springer
15 years 3 months ago
2007
Springer
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 ...
CCGRID
2006
IEEE
15 years 3 months ago
2006
IEEE
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...