Handle URI:
http://hdl.handle.net/10754/599965
Title:
The STAPL pView
Authors:
Buss, Antal; Fidel, Adam; Harshvardhan,; Smith, Timmie; Tanase, Gabriel; Thomas, Nathan; Xu, Xiabing; Bianco, Mauro; Amato, Nancy M.; Rauchwerger, Lawrence
Abstract:
The Standard Template Adaptive Parallel Library (STAPL) is a C++ parallel programming library that provides a collection of distributed data structures (pContainers) and parallel algorithms (pAlgorithms) and a generic methodology for extending them to provide customized functionality. STAPL algorithms are written in terms of pViews, which provide a generic access interface to pContainer data by abstracting common data structure concepts. Briefly, pViews allow the same pContainer to present multiple interfaces, e.g., enabling the same pMatrix to be 'viewed' (or used) as a row-major or column-major matrix, or even as a vector. In this paper, we describe the stapl pView concept and its properties. pViews generalize the iterator concept and enable parallelism by providing random access to, and an ADT for, collections of elements. We illustrate how pViews provide support for managing the tradeoff between expressivity and performance and examine the performance overhead incurred when using pViews. © 2011 Springer-Verlag Berlin Heidelberg.
Citation:
Buss A, Fidel A, Harshvardhan, Smith T, Tanase G, et al. (2011) The STAPL pView. Lecture Notes in Computer Science: 261–275. Available: http://dx.doi.org/10.1007/978-3-642-19595-2_18.
Publisher:
Springer Science + Business Media
Journal:
Languages and Compilers for Parallel Computing
KAUST Grant Number:
KUS-C1-016-04
Issue Date:
2011
DOI:
10.1007/978-3-642-19595-2_18
Type:
Book Chapter
ISSN:
0302-9743; 1611-3349
Sponsors:
This research supported in part by NSF awards CRI-0551685, CCF-0833199, CCF-0830753, IIS-096053, IIS-0917266, NSF/DNDO award 2008-DN-077-ARI018-02, bythe DOE NNSA under the Predictive Science Academic Alliances Program by grantDE-FC52-08NA28616, by THECB NHARP award 000512-0097-2009, by Chevron,IBM, Intel, Oracle/Sun and by Award KUS-C1-016-04, made by King AbdullahUniversity of Science and Technology (KAUST). This research used resources of theNational Energy Research Scientific Computing Center, which is supported by theOffice of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231. Tanase is now a Research Staff Member at IBM T.J. Watson ResearchCenter. Bianco is now a scientist at the Swiss National Supercomputing Centre.
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorBuss, Antalen
dc.contributor.authorFidel, Adamen
dc.contributor.authorHarshvardhan,en
dc.contributor.authorSmith, Timmieen
dc.contributor.authorTanase, Gabrielen
dc.contributor.authorThomas, Nathanen
dc.contributor.authorXu, Xiabingen
dc.contributor.authorBianco, Mauroen
dc.contributor.authorAmato, Nancy M.en
dc.contributor.authorRauchwerger, Lawrenceen
dc.date.accessioned2016-02-28T06:33:24Zen
dc.date.available2016-02-28T06:33:24Zen
dc.date.issued2011en
dc.identifier.citationBuss A, Fidel A, Harshvardhan, Smith T, Tanase G, et al. (2011) The STAPL pView. Lecture Notes in Computer Science: 261–275. Available: http://dx.doi.org/10.1007/978-3-642-19595-2_18.en
dc.identifier.issn0302-9743en
dc.identifier.issn1611-3349en
dc.identifier.doi10.1007/978-3-642-19595-2_18en
dc.identifier.urihttp://hdl.handle.net/10754/599965en
dc.description.abstractThe Standard Template Adaptive Parallel Library (STAPL) is a C++ parallel programming library that provides a collection of distributed data structures (pContainers) and parallel algorithms (pAlgorithms) and a generic methodology for extending them to provide customized functionality. STAPL algorithms are written in terms of pViews, which provide a generic access interface to pContainer data by abstracting common data structure concepts. Briefly, pViews allow the same pContainer to present multiple interfaces, e.g., enabling the same pMatrix to be 'viewed' (or used) as a row-major or column-major matrix, or even as a vector. In this paper, we describe the stapl pView concept and its properties. pViews generalize the iterator concept and enable parallelism by providing random access to, and an ADT for, collections of elements. We illustrate how pViews provide support for managing the tradeoff between expressivity and performance and examine the performance overhead incurred when using pViews. © 2011 Springer-Verlag Berlin Heidelberg.en
dc.description.sponsorshipThis research supported in part by NSF awards CRI-0551685, CCF-0833199, CCF-0830753, IIS-096053, IIS-0917266, NSF/DNDO award 2008-DN-077-ARI018-02, bythe DOE NNSA under the Predictive Science Academic Alliances Program by grantDE-FC52-08NA28616, by THECB NHARP award 000512-0097-2009, by Chevron,IBM, Intel, Oracle/Sun and by Award KUS-C1-016-04, made by King AbdullahUniversity of Science and Technology (KAUST). This research used resources of theNational Energy Research Scientific Computing Center, which is supported by theOffice of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231. Tanase is now a Research Staff Member at IBM T.J. Watson ResearchCenter. Bianco is now a scientist at the Swiss National Supercomputing Centre.en
dc.publisherSpringer Science + Business Mediaen
dc.titleThe STAPL pViewen
dc.typeBook Chapteren
dc.identifier.journalLanguages and Compilers for Parallel Computingen
dc.contributor.institutionTexas A and M University, College Station, United Statesen
kaust.grant.numberKUS-C1-016-04en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.