SC13 Home > SC13 Schedule > SC13 Presentation - Load-Balanced Pipeline Parallelism

SCHEDULE: NOV 16-22, 2013

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.

Load-Balanced Pipeline Parallelism

SESSION: Load Balancing


TIME: 2:00PM - 2:30PM

SESSION CHAIR: Sriram Krishnamoorthy

AUTHOR(S):Md Kamruzzaman, Steven Swanson, Dean Tullsen


Accelerating a single thread in current parallel systems remains a challenging problem, because sequential threads do not naturally take advantage of the additional cores. Recent work shows that automatic extraction of pipeline parallelism is an effective way to speed up single thread execution. However, two problems remain challenging: load balancing and inter-thread communication. This work shows a new mechanism to exploit pipeline parallelism that naturally solves the load balancing and communication problems. This compiler-based technique automatically extracts the pipeline stages and executes them in a data parallel fashion, using token-based chunked synchronization to handle sequential stages. This technique provides linear speedup for several applications, and outperforms prior techniques to exploit pipeline parallelism by as much as 50%.

Chair/Author Details:

Sriram Krishnamoorthy (Chair) - Pacific Northwest National Laboratory

Md Kamruzzaman - University of California, San Diego

Steven Swanson - University of California, San Diego

Dean Tullsen - University of California, San Diego

Add to iCal  Click here to download .ics calendar file

Add to Outlook  Click here to download .vcs calendar file

Add to Google Calendarss  Click here to add event to your Google Calendar

The full paper can be found in the ACM Digital Library