{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:35Z","timestamp":1750308635659,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T00:00:00Z","timestamp":1330214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,2,26]]},"DOI":"10.1145\/2141702.2141714","type":"proceedings-article","created":{"date-parts":[[2012,2,28]],"date-time":"2012-02-28T12:58:45Z","timestamp":1330433925000},"page":"103-114","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Better speedups using simpler parallel programming for graph connectivity and biconnectivity"],"prefix":"10.1145","author":[{"given":"James A.","family":"Edwards","sequence":"first","affiliation":[{"name":"University of Maryland, Maryland"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[{"name":"University of Maryland, Maryland"}]}],"member":"320","published-online":{"date-parts":[[2012,2,26]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The ninth DIMACS implementation challenge: The shortest path problem. http:\/\/www.dis.uniroma1.it\/~challenge9\/ 2005.  The ninth DIMACS implementation challenge: The shortest path problem. http:\/\/www.dis.uniroma1.it\/~challenge9\/ 2005."},{"key":"e_1_3_2_1_2_1","unstructured":"NVIDIA's next generation CUDA compute architecture: Fermi. http:\/\/www.nvidia.com\/content\/PDF\/fermi_white_papers\/NVIDIA_Fermi_Compute_Architecture_Whitepaper.pdf 2009.  NVIDIA's next generation CUDA compute architecture: Fermi. http:\/\/www.nvidia.com\/content\/PDF\/fermi_white_papers\/NVIDIA_Fermi_Compute_Architecture_Whitepaper.pdf 2009."},{"volume-title":"http:\/\/snap.stanford.edu\/index.html","year":"2009","key":"e_1_3_2_1_3_1","unstructured":"Stanford network analysis platform. http:\/\/snap.stanford.edu\/index.html , 2009 . Stanford network analysis platform. http:\/\/snap.stanford.edu\/index.html, 2009."},{"key":"e_1_3_2_1_4_1","volume-title":"December","author":"TCPP","year":"2010","unstructured":"NSF\/IEEE- TCPP curriculum initiative on parallel and distributed computing - core topics for undergraduates. http:\/\/www.cs.gsu.edu\/~tcpp\/curriculum\/index.php , December 2010 . NSF\/IEEE-TCPP curriculum initiative on parallel and distributed computing - core topics for undergraduates. http:\/\/www.cs.gsu.edu\/~tcpp\/curriculum\/index.php, December 2010."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2005.55"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1302506.1303931"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391469.1391583"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/197912.197923"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989511"},{"key":"e_1_3_2_1_10_1","volume-title":"HotPar '10: Proceedings of the 2nd Workshop on Hot Topics in Parallelism. USENIX","author":"Caragea G. C.","year":"2010","unstructured":"G. C. Caragea , F. Keceli , A. Tzannes , and U. Vishkin . General-purpose vs. GPU: Comparison of many-cores on irregular workloads . In HotPar '10: Proceedings of the 2nd Workshop on Hot Topics in Parallelism. USENIX , June 2010 . G. C. Caragea, F. Keceli, A. Tzannes, and U. Vishkin. General-purpose vs. GPU: Comparison of many-cores on irregular workloads. In HotPar '10: Proceedings of the 2nd Workshop on Hot Topics in Parallelism. USENIX, June 2010."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12151"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.100"},{"key":"e_1_3_2_1_13_1","volume-title":"Morgan-Kaufmann","author":"Culler D.","year":"1999","unstructured":"D. Culler and J. Singh . Parallel Computer Architecture: A Hardware\/Software Approach . Morgan-Kaufmann , 1999 . D. Culler and J. Singh. Parallel Computer Architecture: A Hardware\/Software Approach. Morgan-Kaufmann, 1999."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/351827.384252"},{"key":"e_1_3_2_1_16_1","volume-title":"High Performance Computing for Computational Science - VECPAR.","author":"F\u00fcrlinger K.","year":"2006","unstructured":"K. F\u00fcrlinger and M. Gerndt . Analyzing overheads and scalability characteristics of OpenMP applications . In High Performance Computing for Computational Science - VECPAR. 2006 . K. F\u00fcrlinger and M. Gerndt. Analyzing overheads and scalability characteristics of OpenMP applications. In High Performance Computing for Computational Science - VECPAR. 2006."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"e_1_3_2_1_18_1","volume-title":"HADI: Fast diameter estimation and mining in massive graphs with Hadoop","author":"Kang U.","year":"2008","unstructured":"U. Kang , C. Tsourakakis , A. P. Appel , C. Faloutsos , and J. Leskovec . HADI: Fast diameter estimation and mining in massive graphs with Hadoop , 2008 . U. Kang, C. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec. HADI: Fast diameter estimation and mining in massive graphs with Hadoop, 2008."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_1_20_1","unstructured":"F. Keceli T. Moreshet and U. Vishkin. Power-performance comparison of single-task driven many-cores. Under review.  F. Keceli T. Moreshet and U. Vishkin. Power-performance comparison of single-task driven many-cores. Under review."},{"key":"e_1_3_2_1_21_1","volume-title":"Toolchain for programming, simulating and studying the XMT many-core architecture","author":"Keceli F.","year":"2010","unstructured":"F. Keceli , A. Tzannes , G. C. Caragea , R. Barua , and U. Vishkin . Toolchain for programming, simulating and studying the XMT many-core architecture , 2010 . Under review. F. Keceli, A. Tzannes, G. C. Caragea, R. Barua, and U. Vishkin. Toolchain for programming, simulating and studying the XMT many-core architecture, 2010. Under review."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2008.31"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195199"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2010.41"},{"key":"e_1_3_2_1_25_1","volume-title":"First NSF\/TCPP Workshop on Parallel and Distributed Computing Education (EduPar-11)","author":"Padua D.","year":"2011","unstructured":"D. Padua , U. Vishkin , and J. Carver . Joint UIUC\/UMD parallel algorithms\/programming course . In First NSF\/TCPP Workshop on Parallel and Distributed Computing Education (EduPar-11) , in conjunction with IPDPS, Anchorage, Alaska , May 16, 2011 . D. Padua, U. Vishkin, and J. Carver. Joint UIUC\/UMD parallel algorithms\/programming course. In First NSF\/TCPP Workshop on Parallel and Distributed Computing Education (EduPar-11), in conjunction with IPDPS, Anchorage, Alaska, May 16, 2011."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90024-9"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90013-X"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90013-X"},{"key":"e_1_3_2_1_29_1","first-page":"1","volume-title":"Workshops and PhD Forum (IPDPSW), 2010 IEEE International Symposium on","author":"Soman J.","year":"2010","unstructured":"J. Soman , K. Kishore , and P. Narayanan . A fast GPU algorithm for graph connectivity. In Parallel Distributed Processing , Workshops and PhD Forum (IPDPSW), 2010 IEEE International Symposium on , pages 1 -- 8 , April 2010 . J. Soman, K. Kishore, and P. Narayanan. A fast GPU algorithm for graph connectivity. In Parallel Distributed Processing, Workshops and PhD Forum (IPDPSW), 2010 IEEE International Symposium on, pages 1--8, April 2010."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626410000272"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214061"},{"key":"e_1_3_2_1_32_1","unstructured":"U. Vishkin. Thinking in parallel: Some basic data-parallel algorithms and techniques. http:\/\/www.umiacs.umd.edu\/users\/vishkin\/PUBLICATIONS\/classnotes.pdf February 2009.  U. Vishkin. Thinking in parallel: Some basic data-parallel algorithms and techniques. http:\/\/www.umiacs.umd.edu\/users\/vishkin\/PUBLICATIONS\/classnotes.pdf February 2009."},{"key":"e_1_3_2_1_33_1","volume-title":"Handbook on Parallel Computing: Models, Algorithms, and Applications","author":"Vishkin U.","year":"2008","unstructured":"U. Vishkin , G. Caragea , and B. Lee . Models for advancing PRAM and other algorithms into parallel programs for a PRAM-on-chip platform . In S. Rajasekaran and J. Reif, editors, Handbook on Parallel Computing: Models, Algorithms, and Applications , chapter 5. Chapman and Hall\/CRC Press , 2008 . U. Vishkin, G. Caragea, and B. Lee. Models for advancing PRAM and other algorithms into parallel programs for a PRAM-on-chip platform. In S. Rajasekaran and J. Reif, editors, Handbook on Parallel Computing: Models, Algorithms, and Applications, chapter 5. Chapman and Hall\/CRC Press, 2008."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214024"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1366230.1366240"}],"event":{"name":"PPoPP '12: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"New Orleans Louisiana","acronym":"PPoPP '12"},"container-title":["Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2141702.2141714","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2141702.2141714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:08:04Z","timestamp":1750273684000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2141702.2141714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,26]]},"references-count":34,"alternative-id":["10.1145\/2141702.2141714","10.1145\/2141702"],"URL":"https:\/\/doi.org\/10.1145\/2141702.2141714","relation":{},"subject":[],"published":{"date-parts":[[2012,2,26]]},"assertion":[{"value":"2012-02-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}