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.
You can also create your personal schedule on the SC11 app (Boopsie) on your smartphone. Simply select a session you want to attend and "add" it to your plan. Continue in this manner until you have created your own personal schedule. All your events will appear under "My Event Planner" on your smartphone.
M02: Parallel Programming Techniques for Linked Data Structures
SESSION: M02: Parallel Programming Techniques for Linked Data Structures
EVENT TYPE: Tutorial
TIME: 8:30AM - 12:00PM
ABSTRACT: Linked data structures (LDS) such as linked lists, trees, graphs, and hash tables, are used heavily
in programs. They utilize pointers and rely on pointer chasing to traverse the data structures.
Traditional loop-level parallelization is ineffective for LDS due to loop-carried dependence in the
traversal loops. Consequently, a different parallelization strategy is needed. Parallelization can be
pursued at a higher level, among the LDS primitives, such as traversal, node insertion, and node
deletion. Pursuing parallelization at the LDS primitive level, however, requires a different way to
reason about the correctness of operations, and requires fine-grain locking along with all its
intricacies. LDS parallelization is a rarely covered topics in SC, and the aim of this tutorial is to
cover techniques that can be used to achieve an effective parallelization strategy for LDS.