User 158 | 3/26/2014, 12:34:01 PM
As the paper says, page rank can run faster with the asynchronous execution. I tried it, and found it ran faster with the synchronous execution. I'm just wondering if I did something wrong. ./pagerank --graph graphfile --format tsv --engine asynchronous For my graph (100M vertices and 2B edges), the synchronous execution took around 600 seconds and the asynchronous execution took around 900 seconds. I don't know if I should use a special scheduler, so I tried the priority scheduler with the asynchronous execution. It took hours and still couldn't terminate.
I guess my question is how to run page rank in order to get its maximal performance? I think the same question also goes to the implementation of weakly connected components. It doesn't converge very fast with the default setting. BTW, I ran the page rank on a single machine.