BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20131117T153000Z
DTEND:20131118T000000Z
LOCATION:302
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Parallel programming is important for performance, and developers need a comprehensive set of strategies and technologies for tackling it.  This tutorial is intended for C++ programmers who want to better grasp how to envision, describe and write efficient parallel algorithms at the single shared-memory node level.=0A=0AThis tutorial will present a set of algorithmic patterns for parallel programming.   Patterns describe best known methods for solving recurring design problems.  Algorithmic patterns in particular are the building blocks of algorithms. Using these patterns to develop parallel algorithms will lead to better structured, more scalable, and more maintainable programs.  This course will discuss when and where to use a core set of parallel patterns, how to best implement them, and how to analyze the performance of algorithms built using them.  Patterns to be presented include map, reduce, scan, pipeline, fork-joint, stencil, tiling, and recurrence.   Each pattern will be demonstrated using working code in one or more of Cilk Plus, Threading Building Blocks, OpenMP, or OpenCL.  Attendees also will have the opportunity to test the provided examples themselves on an HPC cluster for the time of the SC13 conference.
SUMMARY:Structured Parallel Programming with Patterns
PRIORITY:3
END:VEVENT
END:VCALENDAR