ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1806.08092
  4. Cited By
GPOP: A cache- and work-efficient framework for Graph Processing Over
  Partitions
v1v2v3 (latest)

GPOP: A cache- and work-efficient framework for Graph Processing Over Partitions

21 June 2018
Kartik Lakhotia
Sourav Pati
Rajgopal Kannan
Viktor Prasanna
ArXiv (abs)PDFHTML

Papers citing "GPOP: A cache- and work-efficient framework for Graph Processing Over Partitions"

1 / 1 papers shown
Title
Cache-Efficient Fork-Processing Patterns on Large Graphs
Cache-Efficient Fork-Processing Patterns on Large Graphs
Shengliang Lu
Shixuan Sun
Johns Paul
Yuchen Li
Bingsheng He
71
12
0
27 Mar 2021
1