Sciweavers

1536 search results - page 15 / 308
» DPS - Dynamic Parallel Schedules
Sort
View
ICFP
2008
ACM
15 years 9 months ago
A scheduling framework for general-purpose parallel languages
The trend in microprocessor design toward multicore and manycore processors means that future performance gains in software will largely come from harnessing parallelism. To reali...
Matthew Fluet, Mike Rainey, John H. Reppy
ISPAN
2005
IEEE
15 years 3 months ago
Process Scheduling for the Parallel Desktop
Commodity hardware and software are growing increasingly more complex, with advances such as chip heterogeneity and specialization, deeper memory hierarchies, ne-grained power ma...
Eitan Frachtenberg
TOCS
2008
154views more  TOCS 2008»
14 years 9 months ago
Adaptive work-stealing with parallelism feedback
We present an adaptive work-stealing thread scheduler, ASTEAL, for fork-join multithreaded jobs, like those written using the Cilk multithreaded language or the Hood work-stealing...
Kunal Agrawal, Charles E. Leiserson, Yuxiong He, W...
INFOCOM
2011
IEEE
14 years 1 months ago
Scheduling in mapreduce-like systems for fast completion time
Abstract—Large-scale data processing needs of enterprises today are primarily met with distributed and parallel computing in data centers. MapReduce has emerged as an important p...
Hyunseok Chang, Murali S. Kodialam, Ramana Rao Kom...
83
Voted
WAOA
2004
Springer
132views Algorithms» more  WAOA 2004»
15 years 2 months ago
Stochastic Online Scheduling on Parallel Machines
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
Nicole Megow, Marc Uetz, Tjark Vredeveld