I did this or a parallel class project
| non parallel page rank tests |
|---|
| 1329 |
| 1279 |
| 1369 |
| 1337 |
| 1200 |
| 1495 |
| 1333 |
| 1293 |
| 1187 |
| 1418 |
| Average 1324 |
| parallel page rank tests |
|---|
| 337 |
| 342 |
| 346 |
| 323 |
| 328 |
| 372 |
| 351 |
| 334 |
| 328 |
| 334 |
| Average 339.5 |
the code could run faster using more primative ways.\
my code used to use a separate vector in the main function to hold the page ranks compared to having the nodes hold the page rank
in that case it would run much much faster
However, the method I used was this way
Also I couldnt figure out how to parallel iterate through all nodes and update the pagerank vector using ^ method.
hence I stuck with each node holding the pagerank\