English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Based on the study about the basic idea of PageRank algorithm, combining with the MapReduce distributed programming concepts, the paper first proposed a parallel PageRank algorithm based on adjacency list which is suitable for massive data processing. Then, after examining the essential characteristics of iteration hidden behind the PageRank, it provided an iteration acceleration model based on vector computing. Following, using such acceleration model, the paper again brought forward a parallel PageRank algorithm with power iteration acceleration with MapReduce. Finally, after abundant experimental analyses, it has been proved that the both the two proposed algorithm can be suitable for massive data processing and the 2 nd one can significantly

A Parallel PageRank Algorithm with Power Iteration Acceleration