WG211/M3Rauchwerger: Difference between revisions
m 1 revision |
No edit summary |
||
| Line 1: | Line 1: | ||
[[Category:WG211]] | [[Category:WG211]] | ||
Lawrence Rauchwerger | |||
Title: STAPL: A High Productivity Parallel Programming Environment | Title: STAPL: A High Productivity Parallel Programming Environment | ||
<br>Speaker: Lawrence Rauchwerger | <br>Speaker: Lawrence Rauchwerger | ||
< | <br> | ||
Abstract:<br> | Abstract:<br> | ||
The Standard Template Adaptive Parallel Library (STAPL) is a collection | The Standard Template Adaptive Parallel Library (STAPL) is a collection | ||
| Line 24: | Line 18: | ||
algorithm selection, and show that several common applications can be | algorithm selection, and show that several common applications can be | ||
written with relative ease in STAPL and still have scalable performance. | written with relative ease in STAPL and still have scalable performance. | ||
Latest revision as of 14:51, 16 December 2011
Lawrence Rauchwerger
Title: STAPL: A High Productivity Parallel Programming Environment
Speaker: Lawrence Rauchwerger
Abstract:
The Standard Template Adaptive Parallel Library (STAPL) is a collection
of generic data structures and algorithms that provides a high
productivity, parallel programming infrastructure with an approach that
draws heavily in design from the C++ Standard Template Library (STL).
By abstracting much of the complexity of parallelism from the end
user, STAPL provides a platform for high productivity by enabling
the user to focus on algorithmic design instead of lower level
parallel implementation issues. In this talk, we provide an overview
of the major STAPL components, discuss its framework for adaptive
algorithm selection, and show that several common applications can be
written with relative ease in STAPL and still have scalable performance.
