Stratified sampling for even workload partitioning

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 w...

Full description

Saved in:
Bibliographic Details
Published in:PACT '14 : proceedings of the 23rd International Conference on Parallel Architectures and Compilation Techniques : August 24-27, 2014, Edmonton, AB, Canada pp. 503 - 504
Main Authors: Paudel, Jeeva, Amaral, Jose Nelson
Format: Conference Proceeding
Language:English
Published: ACM 01.08.2014
Subjects:
APGAS
Clustering algorithms
Load balancing
Load management
Partitioning algorithms
PGAS
Processor scheduling
Programming
Scheduling
Stratified sampling
X10
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1145/2628071.2671422