{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T16:32:03Z","timestamp":1774801923307,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540772194","type":"print"},{"value":"9783540772200","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77220-0_21","type":"book-chapter","created":{"date-parts":[[2008,1,21]],"date-time":"2008-01-21T20:07:56Z","timestamp":1200946076000},"page":"197-208","source":"Crossref","is-referenced-by-count":395,"title":["Accelerating Large Graph Algorithms on the GPU Using CUDA"],"prefix":"10.1007","author":[{"given":"Pawan","family":"Harish","sequence":"first","affiliation":[]},{"given":"P. J.","family":"Narayanan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Nineth DIMACS implementation challange - Shortest paths http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Madduri, K.: Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In: ICPP, pp. 523\u2013530 (2006)","DOI":"10.1109\/ICPP.2006.34"},{"key":"21_CR3","first-page":"539","volume-title":"ICPP 2006","author":"D.A. Bader","year":"2006","unstructured":"Bader, D.A., Madduri, K.: Parallel algorithms for evaluating centrality indices in real-world networks. In: ICPP 2006. Proceedings of the 2006 International Conference on Parallel Processing, pp. 539\u2013550. IEEE Computer Society Press, Los Alamitos (2006)"},{"issue":"11","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1109\/12.736440","volume":"47","author":"J.-D. Cho","year":"1998","unstructured":"Cho, J.-D., Raje, S., Sarrafzadeh, M.: Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for vlsi applications. IEEE Transactions on Computers\u00a047(11), 1253\u20131266 (1998)","journal-title":"IEEE Transactions on Computers"},{"key":"21_CR5","first-page":"47","volume-title":"SC 2004","author":"Z. Fan","year":"2004","unstructured":"Fan, Z., Qiu, F., Kaufman, A., Yoakum-Stover, S.: GPU cluster for high performance computing. In: SC 2004. Proceedings of the 2004 ACM\/IEEE conference on Supercomputing, p. 47. IEEE Computer Society, Los Alamitos (2004)"},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1145\/882262.882363","volume":"22","author":"J. Kr\u00fcger","year":"2003","unstructured":"Kr\u00fcger, J., Westermann, R.: Linear algebra operators for GPU implementation of numerical algorithms. ACM Transactions on Graphics (TOG)\u00a022(3), 908\u2013916 (2003)","journal-title":"ACM Transactions on Graphics (TOG)"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/1122501.1122505","volume":"25","author":"A. Lefohn","year":"2006","unstructured":"Lefohn, A., Kniss, J.M., Strzodka, R., Sengupta, S., Owens, J.D.: Glift: Generic, efficient, random-access GPU data structures. ACM Transactions on Graphics\u00a025(1), 60\u201399 (2006)","journal-title":"ACM Transactions on Graphics"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/357062.357071","volume":"1","author":"T. Lengauer","year":"1979","unstructured":"Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst.\u00a01(1), 121\u2013141 (1979)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"21_CR9","unstructured":"Micikevicius, P.: General parallel computation on commodity graphics hardware: Case study with the all-pairs shortest paths problem. PDPTA, 1359\u20131365 (2004)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Narayanan, P.J.: Single Source Shortest Path Problem on Processor Arrays. In: Proceedings of the Fourth IEEE Symposium on the Frontiers of Massively Parallel Computing, pp. 553\u2013556 (1992)","DOI":"10.1109\/FMPC.1992.234924"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Narayanan, P.J.: Processor Autonomy on SIMD Architectures. In: Proceedings of the Seventh International Conference on Supercomputing, pp. 127\u2013136 (1993)","DOI":"10.1145\/165939.165963"},{"issue":"1-4","key":"21_CR12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/FI-2000-43123412","volume":"43","author":"A.S. Nepomniaschaya","year":"2000","unstructured":"Nepomniaschaya, A.S., Dvoskina, M.A.: A simple implementation of dijkstra\u2019s shortest path algorithm on associative parallel processors. Fundam. Inf.\u00a043(1-4), 227\u2013243 (2000)","journal-title":"Fundam. Inf."},{"key":"21_CR13","unstructured":"Owens, J.D., Sengupta, S., Horn, D.: Assessment of Graphic Processing Units (GPUs) for Department of Defense (DoD) Digital Signal Processing (DSP) Applications. Technical Report ECE-CE-2005-3, Department of Electrical and Computer Engineering, University of California, Davis (October 2005)"},{"issue":"3-4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1002\/cav.24","volume":"15","author":"W. Wu","year":"2004","unstructured":"Wu, W., Heng, P.A.: A hybrid condensed finite element model with GPU acceleration for interactive 3D soft tissue cutting: Research Articles. Comput. Animat. Virtual Worlds\u00a015(3-4), 219\u2013227 (2004)","journal-title":"Comput. Animat. Virtual Worlds"},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1109\/TVCG.2007.24","volume":"13","author":"Y. Zhao","year":"2007","unstructured":"Zhao, Y., Han, Y., Fan, Z., Qiu, F., Kuo, Y.-C., Kaufman, A.E., Mueller, K.: Visual simulation of heat shimmering and mirage. IEEE Transactions on Visualization and Computer Graphics\u00a013(1), 179\u2013189 (2007)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2013 HiPC 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77220-0_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:09:12Z","timestamp":1606183752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77220-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772194","9783540772200"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77220-0_21","relation":{},"subject":[]}}