dc.creator | Biehle, Tyler Jered | |
dc.date.accessioned | 2016-09-05T14:28:21Z | |
dc.date.available | 2016-09-05T14:28:21Z | |
dc.date.created | 2014-05 | |
dc.date.issued | 2013-09-09 | |
dc.date.submitted | May 2014 | |
dc.identifier.uri | https://hdl.handle.net/1969.1/157557 | |
dc.description.abstract | The Standard Template Adaptive Parallel Library (STAPL) is a parallel programming framework for C++ that provides parallel algorithms and containers similar to those found in the Standard Template Library (STL). Currently STAPL is lacking implementations for three unordered associative containers: unordered set, unordered multiset, and unordered multimap. These are commonly used containers in the field of computer science; therefore, their implementations are a necessity for STAPL. The similarity of operations and structure between each container will allow a large portion of code to be reused. The goal of this work is to design and create a parallel implementation of these containers that provides the same user-level facilities as their STL equivalents and displays a high level of scalability when executed on a large number of processors. | en |
dc.format.mimetype | application/pdf | |
dc.subject | Parallel computing | en |
dc.subject | containers | en |
dc.title | Unordered Associative Containers in STAPL | en |
dc.type | Thesis | en |
thesis.degree.department | Computer Science and Engineering | en |
thesis.degree.discipline | Computer Sci. & Engr | en |
thesis.degree.grantor | Undergraduate Research Scholars Program | en |
dc.contributor.committeeMember | Amato, Nancy | |
dc.type.material | text | en |
dc.date.updated | 2016-09-05T14:28:21Z | |