Modern accelerator programming frameworks, such as OpenCL, organise threads into work-groups. Remote-scope promotion (RSP) is a language extension recently proposed by AMD researchers that is designed to enable applications, for the first time, both to optimise for the common case of intra-work-group communication (using memory scopes to provide consistency only within a work-group) and to allow occasional inter-work-group communication (as required, for instance, to support the popular load-balancing idiom of work stealing).
We present the first formal, axiomatic memory model of OpenCL extended with RSP. We have extended the Herd memory model simulator with support for OpenCL kernels that exploit RSP, and used it to discover bugs in several litmus tests and a work-stealing queue, that have been used previously in the study of RSP. We have also formalised the proposed GPU implementation of RSP. The formalisation process allowed us to identify bugs in the description of RSP that could result in well-synchronised programs experiencing memory inconsistencies. We present and prove sound a new implementation of RSP that incorporates bug fixes and requires less non-standard hardware than the original implementation.
This work, a collaboration between academia and industry, clearly demonstrates how, when designing hardware support for a new concurrent language feature, the early application of formal tools and techniques can help to prevent errors, such as those we have found, from making it into silicon.
Fri 30 Oct Times are displayed in time zone: Eastern Time (US & Canada) change
|13:30 - 13:52|
|Remote-Scope Promotion: Clarified, Rectified, and Verified|
John WickersonImperial College London, Mark BattyUniversity of Cambridge, Bradford M. BeckmannAdvanced Micro Devices, Inc, Alastair DonaldsonImperial College LondonDOI Media Attached
|13:52 - 14:15|
|Incremental Computation with Names|
Matthew HammerUniversity of Maryland, College Park, Jana DunfieldUniversity of British Columbia, Canada, Kyle HeadleyUniversity of Maryland, College Park, Nicholas LabichUniversity of Maryland at College Park, USA, Jeffrey S. FosterUniversity of Maryland at College Park, USA, Michael HicksUniversity of Maryland at College Park, USA, David Van HornUniversity of Maryland at College Park, USADOI
|14:15 - 14:37|
|Checks and Balances: Constraint Solving without Surprises in Object-Constraint Programming Languages|
Tim FelgentreffHPI, Germany, Todd MillsteinUniversity of California at Los Angeles, USA, Alan BorningUniversity of Washington, USA, Robert HirschfeldHPIDOI
|14:37 - 15:00|
|Optimizing Hash-Array Mapped Tries for Fast and Lean Immutable JVM Collections|
OOPSLALink to publication