Elixir: synthesis of parallel irregular algorithms
| dc.contributor.advisor | Pingali, Keshav | en |
| dc.contributor.committeeMember | Misra, Jayadev | en |
| dc.contributor.committeeMember | Batory, Don | en |
| dc.contributor.committeeMember | Cook, William | en |
| dc.contributor.committeeMember | Sagiv, Mooly | en |
| dc.contributor.committeeMember | Gulwani, Sumit | en |
| dc.creator | Prountzos, Dimitrios | en |
| dc.creator.orcid | 0000-0002-5275-5590 | en |
| dc.date.accessioned | 2016-02-11T19:25:18Z | en |
| dc.date.accessioned | 2018-01-22T22:29:30Z | |
| dc.date.available | 2016-02-11T19:25:18Z | en |
| dc.date.available | 2018-01-22T22:29:30Z | |
| dc.date.issued | 2015-05 | en |
| dc.date.submitted | May 2015 | en |
| dc.date.updated | 2016-02-11T19:25:18Z | en |
| dc.description.abstract | Algorithms in new application areas like machine learning and data analytics usually operate on unstructured sparse graphs. Writing efficient parallel code to implement these algorithms is very challenging for a number of reasons. First, there may be many algorithms to solve a problem and each algorithm may have many implementations. Second, synchronization, which is necessary for correct parallel execution, introduces potential problems such as data-races and deadlocks. These issues interact in subtle ways, making the best solution dependent both on the parallel platform and on properties of the input graph. Consequently, implementing and selecting the best parallel solution can be a daunting task for non-experts, since we have few performance models for predicting the performance of parallel sparse graph programs on parallel hardware. This dissertation presents a synthesis methodology and a system, Elixir, that addresses these problems by (i) allowing programmers to specify solutions at a high level of abstraction, and (ii) generating many parallel implementations automatically and using search to find the best one. An Elixir specification consists of a set of operators capturing the main algorithm logic and a schedule specifying how to efficiently apply the operators. Elixir employs sophisticated automated reasoning to merge these two components, and uses techniques based on automated planning to insert synchronization and synthesize efficient parallel code. Experimental evaluation of our approach demonstrates that the performance of the Elixir generated code is competitive to, and can even outperform, hand-optimized code written by expert programmers for many interesting graph benchmarks. | en |
| dc.description.department | Computer Sciences | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier | doi:10.15781/T2PD72 | en |
| dc.identifier.uri | http://hdl.handle.net/2152/33278 | en |
| dc.language.iso | en | en |
| dc.subject | Parallel programming | en |
| dc.subject | Programming languages | en |
| dc.subject | Compilers | en |
| dc.subject | Static analysis | en |
| dc.subject | Synthesis | en |
| dc.title | Elixir: synthesis of parallel irregular algorithms | en |
| dc.type | Thesis | en |