Green-Marl
| Autor: | Edic Sedlar, Kunle Olukotun, Hassan Chafi, Sungpack Hong |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Power graph analysis
Domain-specific language Theoretical computer science Computer science Programming language business.industry General Medicine computer.software_genre Computer Graphics and Computer-Aided Design Graph Software Digital subscriber line High-level programming language Graph (abstract data type) Compiler Implicit parallelism business computer |
| Zdroj: | ASPLOS |
| ISSN: | 1558-1160 0362-1340 |
| DOI: | 10.1145/2248487.2151013 |
| Popis: | The increasing importance of graph-data based applications is fueling the need for highly efficient and parallel implementations of graph analysis software. In this paper we describe Green-Marl, a domain-specific language (DSL) whose high level language constructs allow developers to describe their graph analysis algorithms intuitively, but expose the data-level parallelism inherent in the algorithms. We also present our Green-Marl compiler which translates high-level algorithmic description written in Green-Marl into an efficient C++ implementation by exploiting this exposed data-level parallelism. Furthermore, our Green-Marl compiler applies a set of optimizations that take advantage of the high-level semantic knowledge encoded in the Green-Marl DSL. We demonstrate that graph analysis algorithms can be written very intuitively with Green-Marl through some examples, and our experimental results show that the compiler-generated implementation out of such descriptions performs as well as or better than highly-tuned hand-coded implementations. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|