BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20121115T173000Z
DTEND:20121115T190000Z
LOCATION:255-D
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Some problems exhibit inherent parallelism which is so obvious that learning parallel programming is all that is necessary to develop parallel solutions for them. A vast majority of problems do not fall under this category. Much of the teaching in parallel computing courses is centered on ingenious solutions developed for such problems, and this is often difficult for students to grasp. This HPC Educators Session will present a novel way of teaching parallel computing through the prefix sum problem. The session will first introduce prefix sums and present a simple and practically efficient parallel algorithm for solving it. Then a series of interesting and seemingly unrelated problems are solved by clever applications of parallel prefix. The applications range from generating random numbers, to computing edit distance between two strings using dynamic programming, to the classic N-body simulations that have long been a staple of research in the SC community.
SUMMARY:Teaching Parallel Computing through Parallel Prefix
PRIORITY:3
END:VEVENT
END:VCALENDAR