SCHEDULE: NOV 15-20, 2015

When viewing the Technical Program schedule, on the far righthand side is a column labeled "PLANNER." Use this planner to build your own schedule. Once you select an event and want to add it to your personal schedule, just click on the calendar icon of your choice (outlook calendar, ical calendar or google calendar) and that event will be stored there. As you select events in this manner, you will have your own schedule to guide you through the week.

CilkSpec: Optimistic Concurrency for Cilk

SESSION: Programming Systems

EVENT TYPE: Papers

EVENT TAG(S): Programming Systems

TIME: 4:30PM - 5:00PM

SESSION CHAIR(S): Dries Kimpe

AUTHOR(S):Shaizeen Aga, Sriram Krishnamoorthy, Satish Narayanasamy

ROOM:18AB

ABSTRACT:

Recursive parallel programming models such as Cilk strive to simplify the task of parallel programming by enabling a simple divide-and-conquer model of programming. This model is effective in recursively partitioning work into smaller parts and combining their results. However, recursive work partitioning can impose additional constraints on concurrency than is implied by the true dependencies in a program. In this paper, we present a speculation-based approach to alleviate the concurrency constraints imposed by such recursive parallel programs. We design a runtime infrastructure that supports speculative execution and a predictor to accurately learn and identify opportunities to relax extraneous concurrency constraints. Experimental evaluation demonstrates that speculative relaxation of concurrency constraints can deliver gains of up to 1.6 times on 30 cores over baseline Cilk.

Chair/Author Details:

Dries Kimpe (Chair) - KCG Holdings, Inc.|

Shaizeen Aga - University of Michigan, Ann Arbor

Sriram Krishnamoorthy - Pacific Northwest National Laboratory

Satish Narayanasamy - University of Michigan, Ann Arbor

  Click here to download .ics calendar file

  Click here to download .vcs calendar file

  Click here to add event to your Google Calendar

Paper provided by the ACM Digital Library

Paper also available from IEEE Computer Society