Approximate Computing Techniques for Iterative Graph Algorithms

Conference · Mon Dec 18 00:00:00 EST 2017

DOI:https://doi.org/10.1109/HiPC.2017.00013· OSTI ID:1434885

Panyala, Ajay R.; Subasi, Omer; Halappanavar, Mahantesh; Kalyanaraman, Anantharaman; Chavarria Miranda, Daniel G.; Krishnamoorthy, Sriram

Approximate computing enables processing of large-scale graphs by trading off quality for performance. Approximate computing techniques have become critical not only due to the emergence of parallel architectures but also the availability of large scale datasets enabling data-driven discovery. Using two prototypical graph algorithms, PageRank and community detection, we present several approximate computing heuristics to scale the performance with minimal loss of accuracy. We present several heuristics including loop perforation, data caching, incomplete graph coloring and synchronization, and evaluate their efficiency. We demonstrate performance improvements of up to 83% for PageRank and up to 450x for community detection, with low impact of accuracy for both the algorithms. We expect the proposed approximate techniques will enable scalable graph analytics on data of importance to several applications in science and their subsequent adoption to scale similar graph algorithms.

• Research Organization: Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
• Sponsoring Organization: USDOE
• DOE Contract Number: AC05-76RL01830
• OSTI ID: 1434885
• Report Number(s): PNNL-SA-129904; 830403000
• Resource Relation: Conference: IEEE 24th International Conference on High Performance Computing (HiPC 2017), December 18-21, 2017, Jaipur, India, 23 - 30
• Country of Publication: United States
• Language: English