GraphIt: a high-performance graph DSL
Abstract
The performance bottlenecks of graph applications depend not only on the algorithm and the underlying hardware, but also on the size and structure of the input graph. As a result, programmers must try different combinations of a large set of techniques, which make tradeoffs among locality, work-efficiency, and parallelism, to develop the best implementation for a specific algorithm and type of graph. Existing graph frameworks and domain specific languages (DSLs) lack flexibility, supporting only a limited set of optimizations.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Oct 24, 2018
- Source ID
- 10.1145/3276491
Entities
People
- Julian Shun
- Mengjiao Yang
- Riyadh Baghdadi
- Saman Amarasinghe
- Shoaib Kamil
- Yunming Zhang
Organizations
- Adobe
- Defense Advanced Research Projects Agency
- Massachusetts Institute of Technology
- Toyota Research Institute
- Wind Energy Technologies Office