{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:37Z","timestamp":1740123877364,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T00:00:00Z","timestamp":1648252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T00:00:00Z","timestamp":1648252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10766-022-00725-6","type":"journal-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T22:03:00Z","timestamp":1648504980000},"page":"381-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved\/Optimized Practical Non-Blocking PageRank Algorithm for Massive Graphs*"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3717-1749","authenticated-orcid":false,"given":"Hemalatha","family":"Eedi","sequence":"first","affiliation":[]},{"given":"Sahith","family":"Karra","sequence":"additional","affiliation":[]},{"given":"Sathya","family":"Peri","sequence":"additional","affiliation":[]},{"given":"Neha","family":"Ranabothu","sequence":"additional","affiliation":[]},{"given":"Rahul","family":"Utkoor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,26]]},"reference":[{"key":"725_CR1","volume-title":"Graph Theory and Its Applications","author":"J Gross","year":"1999","unstructured":"Gross, J., Yellen, J.: Graph Theory and Its Applications. CRC Press, Inc., Boca Raton (1999)"},{"key":"725_CR2","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Technical Report 1999-66, previous number = SIDL-WP-1999-0120. Stanford InfoLab (1999). http:\/\/ilpubs.stanford.edu:8090\/422\/"},{"key":"725_CR3","doi-asserted-by":"publisher","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 International Conference on Management of Data, New York, NY, USA, pp 135\u2013146 (2010). https:\/\/doi.org\/10.1145\/1807167.1807184","DOI":"10.1145\/1807167.1807184"},{"key":"725_CR4","doi-asserted-by":"publisher","unstructured":"Roy, A., Mihailovic, I., Zwaenepoel, W.: X-Stream: edge-centric graph processing using streaming partitions. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP \u201913, pp. 472\u2013488. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2517349.2522740","DOI":"10.1145\/2517349.2522740"},{"key":"725_CR5","doi-asserted-by":"publisher","unstructured":"Hong, S., Chafi, H., Sedlar, E., Olukotun, K.: Green-Marl: a DSL for easy and efficient graph analysis. In: ASPLOS XVII, pp. 349\u2013362. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2150976.2151013","DOI":"10.1145\/2150976.2151013"},{"key":"725_CR6","doi-asserted-by":"publisher","unstructured":"Sidiroglou-Douskos, S., Misailovic, S., Hoffmann, H., Rinard, M.: Managing performance vs. accuracy trade-offs with loop perforation. In: ESEC\/FSE \u201911, pp. 124\u2013134. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/2025113.2025133","DOI":"10.1145\/2025113.2025133"},{"key":"725_CR7","doi-asserted-by":"publisher","unstructured":"Panyala, A., Subasi, O., Halappanavar, M., Kalyanaraman, A., Chavarr,\u00eda-Miranda, D.G., Krishnamoorthy, S.: Approximate computing techniques for iterative graph algorithms. In: 24th IEEE International Conference on High Performance Computing, HiPC 2017, Jaipur, India, 18\u201321 December 2017, pp 23\u201332. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/HiPC.2017.00013","DOI":"10.1109\/HiPC.2017.00013"},{"issue":"5","key":"725_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/2020976.2021006","volume":"36","author":"J Vu","year":"2011","unstructured":"Vu, J.: The art of multiprocessor programming by Maurice Herlihy and Nir Shavit. ACM SIGSOFT Softw. Eng. Notes 36(5), 52\u201353 (2011). https:\/\/doi.org\/10.1145\/2020976.2021006","journal-title":"ACM SIGSOFT Softw. Eng. Notes"},{"key":"725_CR9","doi-asserted-by":"publisher","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. In: Nicolau, A., Shen, X., Amarasinghe, S.P., Vuduc, R.W. (eds) ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP \u201913, Shenzhen, China, 23\u201327 February 2013, pp. 135\u2013146. ACM (2013). https:\/\/doi.org\/10.1145\/2442516.2442530","DOI":"10.1145\/2442516.2442530"},{"key":"725_CR10","doi-asserted-by":"publisher","unstructured":"Garg, P., Kothapalli, K.: STIC-D: algorithmic techniques for efficient parallel PageRank computation on real-world graphs. In: Proceedings of the 17th International Conference on Distributed Computing and Networking, Singapore, 4\u20137 January 2016, pp. 15:1\u201315:10. ACM (2016). https:\/\/doi.org\/10.1145\/2833312.2833322","DOI":"10.1145\/2833312.2833322"},{"issue":"1","key":"725_CR11","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/3380942","volume":"7","author":"K Lakhotia","year":"2020","unstructured":"Lakhotia, K., Kannan, R., Pati, S., Prasanna, V.K.: GPOP: a scalable cache- and memory-efficient framework for graph processing over parts. ACM Trans. Parallel Comput. 7(1), 7:1-7:24 (2020). https:\/\/doi.org\/10.1145\/3380942","journal-title":"ACM Trans. Parallel Comput."},{"key":"725_CR12","doi-asserted-by":"publisher","unstructured":"Barrett, B.W., Berry, J.W., Murphy, R.C., Wheeler, K.B.: Implementing a portable multi-threaded graph library: the MTGL on Qthreads. In: 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, 23\u201329 May 2009, pp. 1\u20138. IEEE (2009). https:\/\/doi.org\/10.1109\/IPDPS.2009.5161102","DOI":"10.1109\/IPDPS.2009.5161102"},{"key":"725_CR13","unstructured":"Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C., Hellerstein, J.M.: GraphLab: a new framework for parallel machine learning. In: Gr\u00fcnwald, P., Spirtes, P. (eds) UAI 2010, Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence, Catalina Island, CA, USA, 8\u201311 July 2010, pp. 340\u2013349. AUAI Press (2010). https:\/\/dslpitt.org\/uai\/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=2126&proceeding_id=26"},{"key":"725_CR14","unstructured":"Mitliagkas, I., Borokhovich, M., Dimakis, A.G., Caramanis, C.: FrogWild!\u2014fast PageRank approximations on graph engines. CoRR abs\/1502.04281 (2015). arxiv:1502.04281"},{"key":"725_CR15","unstructured":"Wang, G., Xie, W., Demers, A.J., Gehrke, J.: Asynchronous large-scale graph processing made easy. In: CIDR 2013, Sixth Biennial Conference on Innovative Data Systems Research, Online Proceedings, Asilomar, CA, USA, 6\u20139 January 2013 (2013). www.cidrdb.org, http:\/\/cidrdb.org\/cidr2013\/Papers\/CIDR13_Paper58.pdf"},{"key":"725_CR16","doi-asserted-by":"publisher","unstructured":"Nguyen, D., Lenharth, A., Pingali, K.: A lightweight infrastructure for graph analytics. In: Kaminsky, M., Dahlin, M. (eds) ACM SIGOPS 24th Symposium on Operating Systems Principles, SOSP \u201913, Farmington, PA, USA, 3\u20136 November 2013, pp. 456\u2013471. ACM (2013). https:\/\/doi.org\/10.1145\/2517349.2522739","DOI":"10.1145\/2517349.2522739"},{"key":"725_CR17","doi-asserted-by":"publisher","unstructured":"Beamer, S., Asanovic, K., Patterson, D.A.: Reducing PageRank communication via propagation blocking. In: 2017 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2017, Orlando, FL, USA, 29 May\u20132 June 2017, pp. 820\u2013831. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/IPDPS.2017.112","DOI":"10.1109\/IPDPS.2017.112"},{"key":"725_CR18","doi-asserted-by":"publisher","unstructured":"Omar, H., Ahmad, M., Khan, O.: GraphTuner: an input dependence aware loop perforation scheme for efficient execution of approximated graph algorithms. In: 2017 IEEE International Conference on Computer Design, ICCD 2017, Boston, MA, USA, 5\u20138 November 2017, pp. 201\u2013208. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/ICCD.2017.38","DOI":"10.1109\/ICCD.2017.38"},{"key":"725_CR19","doi-asserted-by":"publisher","unstructured":"Peng, Z., Powell, A., Wu, B., Bicer, T., Ren, B.: GraphPhi: efficient parallel graph processing on emerging throughput-oriented architectures. In: Evripidou, S., Stenstr\u00f6m, P., O\u2019Boyle, M.F.P. (eds) Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques, PACT 2018, Limassol, Cyprus, 1\u20134 November 2018, pp. 9:1\u20139:14. ACM (2018). https:\/\/doi.org\/10.1145\/3243176.3243205","DOI":"10.1145\/3243176.3243205"},{"key":"725_CR20","doi-asserted-by":"publisher","unstructured":"Eedi, H., Peri, S., Ranabothu, N., Utkoor, R.: An efficient practical non-blocking PageRank algorithm for large scale graphs. In: 29th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2021, Valladolid, Spain, 10\u201312 March 2021, pp. 35\u201343. IEEE (2021). https:\/\/doi.org\/10.1109\/PDP52278.2021.00015","DOI":"10.1109\/PDP52278.2021.00015"},{"key":"725_CR21","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.future.2020.01.033","volume":"106","author":"L Luo","year":"2020","unstructured":"Luo, L., Liu, Y.: Processing graphs with barrierless asynchronous parallel model on shared-memory systems. Future Gener. Comput. Syst. 106, 641\u2013652 (2020). https:\/\/doi.org\/10.1016\/j.future.2020.01.033","journal-title":"Future Gener. Comput. Syst."},{"key":"725_CR22","doi-asserted-by":"publisher","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: Berry, M.W., Dayal, U., Kamath, C., Skillicorn, D.B. (eds) Proceedings of the Fourth SIAM International Conference on Data Mining, Lake Buena Vista, Florida, USA, 22\u201324 April 2004, pp. 442\u2013446. SIAM (2004). https:\/\/doi.org\/10.1137\/1.9781611972740.43","DOI":"10.1137\/1.9781611972740.43"},{"key":"725_CR23","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"key":"725_CR24","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"725_CR25","volume-title":"Introduction to Parallel Computing: Design and Analysis of Algorithms","author":"V Kumar","year":"1994","unstructured":"Kumar, V., Grama, A., Gupta, A., Karypis, G.: Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin-Cummings Publishing Co., Inc., San Francisco (1994)"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-022-00725-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10766-022-00725-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-022-00725-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T22:09:52Z","timestamp":1657231792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10766-022-00725-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,26]]},"references-count":25,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["725"],"URL":"https:\/\/doi.org\/10.1007\/s10766-022-00725-6","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2022,3,26]]},"assertion":[{"value":"31 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}