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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.