SC13 Home > SC13 Schedule > SC13 Presentation - Advanced PGAS Programming in UPC

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.

Advanced PGAS Programming in UPC

SESSION: Advanced PGAS Programming in UPC

EVENT TYPE: Tutorials

TIME: 8:30AM - 12:00PM

Presenter(s):Katherine Yelick, Yili Zheng

ROOM:303

ABSTRACT:
Partitioned Global Address Space (PGAS) languages combine the convenience of shared memory programming with the locality control needed for scalability. There are several PGAS languages based on a variety of serial languages (e.g., Fortran, C, and Java) and different parallel control constructs, but all with a similar model for building shared data structures. This tutorial will focus on performance programming in the UPC language, which has a strict superset of ISO C. Following a short introduction to the basic constructs in UPC, the tutorial will cover effective parallel programming idioms used in UPC applications and performance optimization techniques. This will include the design of pointer-based data structures, the proper use of locks, and the memory consistency model. The tutorial will also cover the latest extensions of the language, both those in the current specification and others being considered for the next version of the language specification.

Chair/Presenter Details:

Katherine Yelick - University of California, Berkeley

Yili Zheng - Lawrence Berkeley National Laboratory

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