Figure 5. Running time of PageRank on a synthetic graph with 2 billion edges, using Giraph (left) and GraphX (right) with fixed total amount of memory and varying number of machines.
Figure 5. Running time of PageRank on a synthetic graph with 2 billion edges, using Giraph (left) and GraphX (right) with fixed total amount of memory and varying number of machines.

Leave a Reply

To help personalize content, tailor and measure ads and provide a safer experience, we use cookies. By clicking or navigating the site, you agree to allow our collection of information on and off Facebook through cookies. Learn more, including about available controls: Cookie Policy