Wait-free Hyperobjects for Task-Parallel Programming Systems

Hyperobjects are efficient mechanisms to coordinate accesses to shared variables and data-structures in task-parallel programming models, where each thread can operate on its own coordinated local view of the shared data. Synchronization between local views is restricted to occur at well-defined poi...

Full description

Saved in:
Bibliographic Details
Published in:2013 IEEE 27th International Symposium on Parallel and Distributed Processing pp. 803 - 812
Main Author: Wimmer, Martin
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2013
Subjects:
Computational modeling
Computer languages
finish
hyperobjects
Instruction sets
Object oriented modeling
Programming
reduce
reference counting
Runtime
Synchronization
task parallelism
wait-free
ISBN:146736066X, 9781467360661
ISSN:1530-2075
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Hyperobjects are efficient mechanisms to coordinate accesses to shared variables and data-structures in task-parallel programming models, where each thread can operate on its own coordinated local view of the shared data. Synchronization between local views is restricted to occur at well-defined points in the execution, and can be left to the hyperobject implementation. This paper provides a general model for hyperobjects that does not require programming language or runtime support and may therefore be used with any task-parallel programming system. We show that hyperobjects can be efficiently implemented in a wait-free manner, meaning that all concurrent accesses to a hyperobject are guaranteed to complete in a bounded number of steps. The novel finisher hyperobject presented in this paper provides transitive termination detection for task-parallel programs. It can be used to efficiently implement task synchronization primitives like finish. However, finishers can also be used to manage reference-counted resources, e.g. shared pointers and copy-on-write pointers. Finally, we provide a wait-free variant of the associative reducer hyperobject known from the Cilk++ programming language.
ISBN:146736066X
9781467360661
ISSN:1530-2075
DOI:10.1109/IPDPS.2013.10