Please help to solve this parallel algorithm task, there is one txt file attached to the task which am not able to share on here but you can find that online if you search for Berkeley-Stanford web graph, And the variant described in Parallel PageRank: An overview of algorithms and their performance page Kindly please search for this txt file and for variant description from this website and help to solve this task. It will be really helpful. Thanks in advance!

(Google), but can be used to rank vertices in any directed graph. Page Rank can be defined recursively: for each vertex from the set of all vertices uV is given by: PR(u)=V1d+dvN(u)N+(v))PR(v), wheredis "teleportable" constant (let's set it to 0.85),N(u) is the set of all vertices from which an edge leads to u and N+(v) is the set of all vertices to which edge z leadsv. from it. stabilizes (i.e. the change in PR for individual vertices is not less than a predetermined threshold). approaches is quite trivial. therefore better to represent the adjacency matrix as a sparse binary matrix, i.e. for each vertex, store a list of vertices to which an edge leads from it. Based on this, we can formulate the following assignment of the third task. Input. Implement a parallel Page Rank calculation for the Berkely-Stanford web graph that 1. correctly loads the adjacency matrix into memory using multiple threads 2. it will also use multiple threads to calculate the PR value for all vertices It is possible to implement any . variant described here part of the file) and simultaneous access to the data structure representing the sparse matrix