GPOP: a cache and memory-efficient framework for graph processing over partitions

Kartik Lakhotia, Rajgopal Kannan, Sourav Pati, Viktor K. Prasanna. GPOP: a cache and memory-efficient framework for graph processing over partitions. In Jeffrey K. Hollingsworth, Idit Keidar, editors, Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019. pages 393-394, ACM, 2019. [doi]

Authors

Kartik Lakhotia

This author has not been identified. Look up 'Kartik Lakhotia' in Google

Rajgopal Kannan

This author has not been identified. Look up 'Rajgopal Kannan' in Google

Sourav Pati

This author has not been identified. Look up 'Sourav Pati' in Google

Viktor K. Prasanna

This author has not been identified. Look up 'Viktor K. Prasanna' in Google