Sciweavers

82 search results - page 1 / 17
» A Simple Improvement of the Work-stealing Scheduling Algorit...
Sort
View
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
13 years 2 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
EUROPAR
2010
Springer
13 years 6 months ago
Hierarchical Work-Stealing
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
Jean-Noël Quintin, Frédéric Wag...
ICALP
2010
Springer
13 years 7 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
CISIS
2010
IEEE
12 years 8 months ago
A Simple Improvement of the Work-stealing Scheduling Algorithm
Work-stealing is the todays algorithm of choice for dynamic load-balancing of irregular parallel applications on multiprocessor systems. We have evaluated the algorithm’s effic...
Zeljko Vrba, Pål Halvorsen, Carsten Griwodz
IPPS
2009
IEEE
13 years 11 months ago
Work-first and help-first scheduling policies for async-finish task parallelism
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...
Yi Guo, Rajkishore Barik, Raghavan Raman, Vivek Sa...