Mapping High Level Parallel Programming Models to Asynchronous Many-Task (AMT) Runtimes
| dc.contributor.advisor | Sarkar, Vivek | en_US |
| dc.creator | Paul, Sri Raj | en_US |
| dc.date.accessioned | 2019-05-16T18:06:23Z | en_US |
| dc.date.available | 2019-05-16T18:06:23Z | en_US |
| dc.date.created | 2019-05 | en_US |
| dc.date.issued | 2018-12-20 | en_US |
| dc.date.submitted | May 2019 | en_US |
| dc.date.updated | 2019-05-16T18:06:23Z | en_US |
| dc.description.abstract | Asynchronous Many-Task (AMT) runtimes have recently been proposed as a promising software foundation for managing the increasing complexity of node architectures in current and future extreme-scale computing systems because of their ability to express fine-grained parallelism, to decouple computation and data from underlying machine resources, to support resilience, and to deliver scalable performance. The Open Community Runtime (OCR) is a community-led effort to explore AMT runtime principles that can support a broad range of higher-level programming models. The Habanero C/C++ library (HClib) is a library-based AMT runtime and programming interface, which focuses on lightweight task creation/termination and flexible synchronization. Unlike other AMT runtimes, both OCR and HClib include first-class support for event-driven task execution, which can help with hiding communication latencies and with reducing the number of blocking operations performed. In this thesis, we focus on the problem of mapping high-level parallel programming models to AMT runtimes. As an exemplar of modern Partitioned Global Address Space (PGAS) parallel programming models, we show how Chapel programs can be efficiently mapped on to OCR and HClib, and also how Legion, a data-centric parallel programming model, can be mapped on to OCR. Next, we show how PGAS and event-driven execution models can be synergistically integrated in a unique combination of server-side JavaScript and HClib, yielding new levels of programming productivity for high performance computing. Finally, we show how the promise of supporting resilience in AMT runtimes can be realized through programming model extensions to HClib. All these contributions are accompanied by performance evaluations of prototype implementations. Our results show that AMT runtimes can support high-level parallel programming models with comparable or improved performance relative to existing runtimes, while also providing the potential for improved resilience. | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.citation | Paul, Sri Raj. "Mapping High Level Parallel Programming Models to Asynchronous Many-Task (AMT) Runtimes." (2018) Diss., Rice University. <a href="https://hdl.handle.net/1911/105350">https://hdl.handle.net/1911/105350</a>. | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/105350 | en_US |
| dc.language.iso | eng | en_US |
| dc.rights | Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. | en_US |
| dc.subject | Parallel Programming | en_US |
| dc.subject | High-Performance Computing | en_US |
| dc.subject | Distributed Systems | en_US |
| dc.subject | Asynchronous Many-Task (AMT) Runtimes | en_US |
| dc.subject | Resiliency | en_US |
| dc.subject | Communication Latency | en_US |
| dc.title | Mapping High Level Parallel Programming Models to Asynchronous Many-Task (AMT) Runtimes | en_US |
| dc.type | Thesis | en_US |
| dc.type.material | Text | en_US |
| thesis.degree.department | Computer Science | en_US |
| thesis.degree.discipline | Engineering | en_US |
| thesis.degree.grantor | Rice University | en_US |
| thesis.degree.level | Doctoral | en_US |
| thesis.degree.name | Doctor of Philosophy | en_US |
Files
Original bundle
1 - 1 of 1