Fine-Grained Task Scheduling Using Adaptive Data Structures

Authors:
Ralf Hoffmann;Thomas Rauber
Affiliations:
Department for Mathematics, Physics and Computer Science, University of Bayreuth, Germany;Department for Mathematics, Physics and Computer Science, University of Bayreuth, Germany
Venue:
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Year:
2008

Citing 12
Cited 0

A rapid hierarchical radiosity algorithm

Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Parallel Visualization Algorithms: Performance and Architectural Implications

Computer
The SPLASH-2 programs: characterization and methodological considerations

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
Load Balancing in Parallel Computers: Theory and Practice

Load Balancing in Parallel Computers: Theory and Practice
Non-blocking steal-half work queues

Proceedings of the twenty-first annual symposium on Principles of distributed computing
On the Scalability of Dynamic Scheduling Scientific Applications with Adaptive Weighted Factoring

Cluster Computing
Performance Evaluation of Task Pools Based on Hardware Synchronization

Proceedings of the 2004 ACM/IEEE conference on Supercomputing
X10: an object-oriented approach to non-uniform cluster computing

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
CellSs: a programming model for the cell BE architecture

Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Adaptive work stealing with parallelism feedback

Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
Carbon: architectural support for fine-grained parallelism on chip multiprocessors

Proceedings of the 34th annual international symposium on Computer architecture
Intel threading building blocks

Intel threading building blocks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Task pools have been shown to provide efficient load balancing for irregular applications on heterogeneous platforms. Often, distributed data structures are used to store the tasks and the actual load balancing is achieved by task stealing where an idle processor accesses tasks from another processor. In this paper we extent the concept of task pools to adaptive task pools which are able to adapt the number of tasks moved between the processor to the specific execution scenario, thus reducing the overhead for task stealing significantly. We present runtime experiments for different applications on two execution platforms.