Brief Announcement: Wait-free Programming for General Purpose Computations on Graphics Processors
Paper i proceeding, 2008

This paper aims at bridging the gap between the lack of synchronization mechanisms in recent graphics processor (GPU) architectures and the need of synchronization mechanisms in parallel applications. Based on the intrinsic features of recent GPU architectures, we construct strong synchronization objects like wait-free and t-resilient read-modify-write objects for a general model of recent GPU architectures without strong hardware synchronization primitives like test-and-set and compare-and-swap. Accesses to the new wait-free objects have time complexity O(N), where N is the number of concurrent processes. The wait-free objects have space complexity O(N2), which is optimal. Our result demonstrates that it is possible to construct wait-free synchronization mechanisms for GPUs without the need of strong synchronization primitives in hardware and that wait-free programming is possible for GPUs.

consensus

many-core architectures

graphics processors.

synchronization

read-modify-write objects

Författare

Phuong Ha

Philippas Tsigas

Chalmers, Data- och informationsteknik, Nätverk och system

Otto Anshus

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing

452-

Ämneskategorier

Datorteknik

Programvaruteknik

Datavetenskap (datalogi)

ISBN

978-1-59593-989-0

Mer information

Skapat

2017-10-08