Optimizing ordered graph algorithms with GraphIt
- 22 February 2020
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (#CCF-1845763)
- U.S. Department of Energy (#DE-SC0008923, #DE-SC0018947)
- Applications Driving Architectures (ADA) Research Center
- Defense Advanced Research Projects Agency (#HR0011-18-3-0007, #FA8750-17-2-0126)
- Toyota Research Institute
This publication has 22 references indexed in Scilit:
- KickStarterPublished by Association for Computing Machinery (ACM) ,2017
- GroutePublished by Association for Computing Machinery (ACM) ,2017
- GraphMatProceedings of the VLDB Endowment, 2015
- OpenTunerPublished by Association for Computing Machinery (ACM) ,2014
- A lightweight infrastructure for graph analyticsPublished by Association for Computing Machinery (ACM) ,2013
- Defining and evaluating network communities based on ground-truthKnowledge and Information Systems, 2013
- Parallel and I/O efficient set covering algorithmsPublished by Association for Computing Machinery (ACM) ,2012
- Δ-stepping: a parallelizable shortest path algorithmJournal of Algorithms, 2003
- Smallest-last ordering and clustering and graph coloring algorithmsJournal of the ACM, 1983
- On a routing problemQuarterly of Applied Mathematics, 1958