Sciweavers

534 search results - page 38 / 107
» On Scheduling Parallel Tasks at Twilight
Sort
View
SPAA
2009
ACM
15 years 10 months ago
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gib...
IPPS
2007
IEEE
15 years 4 months ago
Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors
Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can b...
Björn Andersson, Eduardo Tovar
JSSPP
2010
Springer
14 years 7 months ago
Dynamic Proportional Share Scheduling in Hadoop
We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mech...
Thomas Sandholm, Kevin Lai
ICPADS
2007
IEEE
15 years 4 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
JSSPP
2001
Springer
15 years 2 months ago
Coscheduling under Memory Constraints in a NOW Environment
Networks of Workstations (NOW) have become important and cost-effective parallel platforms for scientific computations. In practice, a NOW system is heterogeneous and non-dedicat...
Francesc Giné, Francesc Solsona, Porfidio H...