The Community for Technology Leaders
2014 23rd International Conference on Parallel Architecture and Compilation (PACT) (2014)
Edmonton, Canada
Aug. 23, 2014 to Aug. 27, 2014
ISBN: 978-1-5090-6607-0
pp: 503-504
Jeeva Paudel , University of Alberta, Edmonton, Canada
Jose Nelson Amaral , University of Alberta, Edmonton, Canada
ABSTRACT
This work presents a novel algorithm, Workload Partitioning and Scheduling (WPS), for evenly partitioning the computational workload of large implicitly-defined work-list based applications on distributed/shared-memory systems. WPS uses stratified sampling to estimate the number of work items that will be processed in each step of an application. WPS uses such estimation to evenly partition and distribute the computational workload. An empirical evaluation on large applications — Iterative-Deepening A∗ (IDA∗) applied to (4×4)-Sliding-Tile Puzzles, Delaunay Mesh Generation, and Delaunay Mesh Refinement — shows that WPS is applicable to a range of problems, and yields 28% to 49% speedups over existing work-stealing schedulers alone.
INDEX TERMS
Partitioning algorithms, Scheduling, Clustering algorithms, Processor scheduling, Programming, Load management,APGAS, Stratified sampling, Load balancing, X10, PGAS
CITATION
Jeeva Paudel, Jose Nelson Amaral, "Stratified sampling for even workload partitioning", 2014 23rd International Conference on Parallel Architecture and Compilation (PACT), vol. 00, no. , pp. 503-504, 2014, doi:10.1145/2628071.2671422
90 ms
(Ver 3.3 (11022016))