{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:36:44Z","timestamp":1761917804121},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,2,13]],"date-time":"2014-02-13T00:00:00Z","timestamp":1392249600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s11227-014-1118-9","type":"journal-article","created":{"date-parts":[[2014,2,12]],"date-time":"2014-02-12T13:29:30Z","timestamp":1392211770000},"page":"637-648","source":"Crossref","is-referenced-by-count":6,"title":["Parallel relaxed and extrapolated algorithms for computing PageRank"],"prefix":"10.1007","volume":"70","author":[{"given":"Josep","family":"Arnal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00e9ctor","family":"Migall\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Violeta","family":"Migall\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Palomino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Penad\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,13]]},"reference":[{"issue":"1","key":"1118_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1080\/15427951.2005.10129098","volume":"2","author":"P Berkhin","year":"2005","unstructured":"Berkhin P (2005) A survey on PageRank computing. Internet Math 2(1):73\u2013120","journal-title":"Internet Math"},{"key":"1118_CR2","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1002\/spe.587","volume":"34","author":"P Boldi","year":"2004","unstructured":"Boldi P, Codenotti B, Santini M, Vigna S (2004) Ubicrawler: a scalable fully distributed Web crawler. Softw Pract Exp 34:711\u2013726","journal-title":"Softw Pract Exp"},{"key":"1118_CR3","volume-title":"MPI: the complete reference","author":"J Dongarra","year":"1996","unstructured":"Dongarra J, Huss-Lederman S, Otto S, Snir M, Walkel D (1996) MPI: the complete reference. The MIT Press, Cambridge"},{"issue":"1","key":"1118_CR4","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/080727397","volume":"32","author":"D Gleich","year":"2010","unstructured":"Gleich D, Gray A, Greif C, Lau T (2010) An inner-outer iteration for computing PageRank. SIAM J Sci Comput 32(1):349\u2013371","journal-title":"SIAM J Sci Comput"},{"key":"1118_CR5","unstructured":"Gleich D, Zhukov L, Berkhin P (2005) Fast parallel PageRank: a linear system approach. In: The fourteenth international world wide web conference. ACM Press, New York"},{"key":"1118_CR6","doi-asserted-by":"crossref","DOI":"10.1515\/9781400837069","volume-title":"Numerical algorithms for personalized search in self-organizing information networks","author":"SD Kamvar","year":"2010","unstructured":"Kamvar SD (2010) Numerical algorithms for personalized search in self-organizing information networks. Princeton University Press, New Jersey"},{"key":"1118_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.laa.2003.12.008","volume":"386","author":"SD Kamvar","year":"2004","unstructured":"Kamvar SD, Haveliwala TH, Golub GH (2004) Adaptive methods for the computation of PageRank. Linear Algebra Appl 386:51\u201365","journal-title":"Linear Algebra Appl"},{"key":"1118_CR8","unstructured":"Kamvar SD, Haveliwala TH, Manning CD, Golub GH (2003) Exploiting the block structure of the web for computing PageRank. Stanford University Technical, Report, SCCM-03-02"},{"key":"1118_CR9","doi-asserted-by":"crossref","unstructured":"Kamvar SD, Haveliwala TH, Manning CD, Golub GH (2003) Extrapolation methods for accelerating PageRank computations. In: Twelfth international world wide web conference, pp 261\u2013270","DOI":"10.1145\/775152.775190"},{"key":"1118_CR10","doi-asserted-by":"crossref","unstructured":"Migall\u00f3n H, Migall\u00f3n V, Palomino JA, Penad\u00e9s J (2010) Parallelization strategies for computing PageRank. In: Proceedings of the seventh international conference on engineering computational technology. Civil-Comp Press, Stirlingshire, Paper 29. doi: 10.4203\/ccp.94.29","DOI":"10.4203\/ccp.94.29"},{"key":"1118_CR11","unstructured":"OpenMP official site (2008) http:\/\/www.openmp.org"},{"key":"1118_CR12","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: Bringing order to the Web. Technical Report, Stanford Digital Library Technologies Project"},{"key":"1118_CR13","doi-asserted-by":"crossref","unstructured":"Rungsawang A, Manaskasemsak B (2012) Fast PageRank computation on a GPU cluster. In: 20th Euromicro international conference on parallel, distributed and network-based processing, pp 450\u2013456","DOI":"10.1109\/PDP.2012.78"},{"key":"1118_CR14","doi-asserted-by":"crossref","unstructured":"Rungsawang A, Manaskasemsak B (2006) Parallel adaptive technique for computing PageRank. In: Proceedings of the 14th euromicro international conference on parallel, distributed, and network-based processing, PDP\u201906, pp 15\u201320","DOI":"10.1109\/PDP.2006.55"},{"key":"1118_CR15","volume-title":"The algebraic eigenvalue problem","author":"JH Wilkinson","year":"1998","unstructured":"Wilkinson JH (1998) The algebraic eigenvalue problem. Oxford University Press, Oxford"},{"key":"1118_CR16","doi-asserted-by":"crossref","first-page":"3196","DOI":"10.1016\/j.cam.2010.02.009","volume":"234","author":"G Wu","year":"2010","unstructured":"Wu G, Wei Y (2010) An Arnoldi-Extrapolation algorithm for computing PageRank. J Comput Appl Math 234:3196\u20133212","journal-title":"J Comput Appl Math"},{"key":"1118_CR17","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/978-3-540-30216-2_8","volume":"3243","author":"H Zhang","year":"2004","unstructured":"Zhang H, Goel A, Govindan R, Mason K, Van Roy B (2004) Making Eigenvector-based reputation systems robust to collusion. Lect Notes Comput Sci 3243:92\u2013104","journal-title":"Lect Notes Comput Sci"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1118-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1118-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1118-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:38:06Z","timestamp":1565177886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1118-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,13]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["1118"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1118-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,13]]}}}