Elixir: A system for synthesizing concurrent graph programs ?

Dimitrios Prountzos, Roman Manevich, Keshav Pingali

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations


Algorithms in new application areas like machine learning and network analysis use "irregular" data structures such as graphs, trees and sets. Writing efficient parallel code in these problem domains is very challenging because it requires the programmer to make many choices: a given problem can usually be solved by several algorithms, each algorithm may have many implementations, and the best choice of algorithm and implementation can depend not only on the characteristics of the parallel platform but also on properties of the input data such as the structure of the graph. One solution is to permit the application programmer to experiment with different algorithms and implementations without writing every variant from scratch. Auto-tuning to find the best variant is a more ambitious solution. These solutions require a system for automatically producing efficient parallel implementations from high-level specifications. Elixir, the system described in this paper, is the first step towards this ambitious goal. Application programmers write specifications that consist of an operator, which describes the computations to be performed, and a schedule for performing these computations. Elixir uses sophisticated inference techniques to produce efficient parallel code from such specifications. We used Elixir to automatically generate many parallel implementations for three irregular problems: breadthfirst search, single source shortest path, and betweennesscentrality computation. Our experiments show that the best generated variants can be competitive with handwritten code for these problems from other research groups; for some inputs, they even outperform the handwritten versions.

Original languageEnglish
Title of host publicationSPLASH 2012
Subtitle of host publicationOOPSLA'12 - Proceedings of the 2012 ACM International Conference on Object Oriented Programming SystemsLanguages and Applications
Number of pages20
StatePublished - 27 Nov 2012
Externally publishedYes
Event2012 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2012 - Tucson, AZ, United States
Duration: 19 Oct 201226 Oct 2012

Publication series

NameProceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA


Conference2012 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2012
Country/TerritoryUnited States
CityTucson, AZ


  • Amorphous Data-parallelism
  • Compiler Optimization
  • Concurrency
  • Irregular Programs
  • Optimistic Parallelization.
  • Parallelism
  • Synthesis

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Elixir: A system for synthesizing concurrent graph programs ?'. Together they form a unique fingerprint.

Cite this