32 search results - page 3 / 7 » Balanced Scheduling Algorithm Considering Availability in Mo... |
HPDC
2006
IEEE
13 years 11 months ago
2006
IEEE
Consider a workload in which massively parallel tasks that require large resource pools are interleaved with short tasks that require fast response but consume fewer resources. We...
IWCMC
2009
ACM
13 years 10 months ago
2009
ACM
We consider the problem of scheduling emergency responders to geospatially located finite duration temporally bounded tasks. We consider two different schedulers, Greedy and Mee...
PVM
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Domain decomposition for regular meshes on parallel computers has traditionally been performed by attempting to exactly partition the work among the available processors ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in co...
EUROPAR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...