Optimizing ordered graph algorithms with GraphIt

  title={Optimizing ordered graph algorithms with GraphIt},
  author={Yunming Zhang and Ajay Brahmakshatriya and Xinyi Chen and L. Dhulipala and S. Kamil and Saman P. Amarasinghe and Julian Shun},
  journal={Proceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization},
  • Yunming Zhang, Ajay Brahmakshatriya, +4 authors Julian Shun
  • Published 2020
  • Computer Science
  • Proceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization
  • Many graph problems can be solved using ordered parallel graph algorithms that achieve significant speedup over their unordered counterparts by reducing redundant work. This paper introduces a new priority-based extension to GraphIt, a domain-specific language for writing graph applications, to simplify writing high-performance parallel ordered graph algorithms. The extension enables vertices to be processed in a dynamic order while hiding low-level implementation details from the user. We… CONTINUE READING
    4 Citations
    Compliation Techniques for Graphs Algorithms on GPUs
    GraphPulse: An Event-Driven Hardware Accelerator for Asynchronous Graph Processing
    • 1
    • PDF
    Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite
    • 2
    • Highly Influenced


    Gluon: a communication-optimizing substrate for distributed heterogeneous graph analytics
    • 62
    • Highly Influential
    • PDF
    A lightweight infrastructure for graph analytics
    • 372
    • Highly Influential
    • PDF