{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:22:15Z","timestamp":1732033335121,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,6]]},"DOI":"10.1145\/1807167.1807184","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"135-146","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2326,"title":["Pregel"],"prefix":"10.1145","author":[{"given":"Grzegorz","family":"Malewicz","sequence":"first","affiliation":[{"name":"Gogle, Inc., Mountain View, CA, USA"}]},{"given":"Matthew H.","family":"Austern","sequence":"additional","affiliation":[{"name":"Google, Inc., Mountain View, CA, USA"}]},{"given":"Aart J.C","family":"Bik","sequence":"additional","affiliation":[{"name":"Google, Inc., Mountain View, CA, USA"}]},{"given":"James C.","family":"Dehnert","sequence":"additional","affiliation":[{"name":"Google, Inc., Mountain View, CA, USA"}]},{"given":"Ilan","family":"Horn","sequence":"additional","affiliation":[{"name":"Google, Inc., Mountain View, CA, USA"}]},{"given":"Naty","family":"Leiser","sequence":"additional","affiliation":[{"name":"Google, Inc., Mountain View, CA, USA"}]},{"given":"Grzegorz","family":"Czajkowski","sequence":"additional","affiliation":[{"name":"Google, Inc., Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/161541.161736"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.34"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2003.1196112"},{"key":"e_1_3_2_1_4_1","volume-title":"Max-Product Belief Propagation. in Proc. IEEE Intl. Symp. on Information Theory","author":"Bayati Mohsen","year":"2005","unstructured":"Mohsen Bayati , Devavrat Shah , and Mayank Sharma , Maximum Weight Matching via Max-Product Belief Propagation. in Proc. IEEE Intl. Symp. on Information Theory , 2005 , 1763--1767. Mohsen Bayati, Devavrat Shah, and Mayank Sharma, Maximum Weight Matching via Max-Product Belief Propagation. in Proc. IEEE Intl. Symp. on Information Theory, 2005, 1763--1767."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(02)00218-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/297805.297827"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342005051196"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592101"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. First Workshop on Multithreaded Architectures and Applications","author":"Crobak Joseph R.","year":"2007","unstructured":"Joseph R. Crobak , Jonathan W. Berry , Kamesh Madduri , and David A . Bader, Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture . in Proc. First Workshop on Multithreaded Architectures and Applications , 2007 , 1--8. Joseph R. Crobak, Jonathan W. Berry, Kamesh Madduri, and David A. Bader, Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture. in Proc. First Workshop on Multithreaded Architectures and Applications, 2007, 1--8."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2004.11.016"},{"key":"e_1_3_2_1_14_1","volume-title":"MapReduce: Simplified Data Processing on Large Clusters. in Proc. 6th USENIX Symp. on Operating Syst. Design and Impl.","author":"Dean Jeffrey","year":"2004","unstructured":"Jeffrey Dean and Sanjay Ghemawat , MapReduce: Simplified Data Processing on Large Clusters. in Proc. 6th USENIX Symp. on Operating Syst. Design and Impl. , 2004 , 137--150. Jeffrey Dean and Sanjay Ghemawat, MapReduce: Simplified Data Processing on Large Clusters. in Proc. 6th USENIX Symp. on Operating Syst. Design and Impl., 2004, 137--150."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796801004075"},{"key":"e_1_3_2_1_17_1","volume-title":"Flows in Networks","author":"Ford Lester R.","year":"1962","unstructured":"Lester R. Ford , L. R. and Delbert R . Fulkerson , Flows in Networks . Princeton University Press , 1962 . Lester R. Ford, L. R. and Delbert R. Fulkerson, Flows in Networks. Princeton University Press, 1962."},{"key":"e_1_3_2_1_18_1","volume-title":"The Grid 2: Blueprint for a New Computing Infrastructure","author":"Foster Ian","year":"2003","unstructured":"Ian Foster and Carl Kesselman (Eds) , The Grid 2: Blueprint for a New Computing Infrastructure ( 2 nd edition). Morgan Kaufmann , 2003 . Ian Foster and Carl Kesselman (Eds), The Grid 2: Blueprint for a New Computing Infrastructure (2nd edition). Morgan Kaufmann, 2003.","edition":"2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_3_2_1_20_1","volume-title":"Goodrich and Roberto Tamassia, Data Structures and Algorithms in JAVA","author":"Michael","year":"2001","unstructured":"Michael T. Goodrich and Roberto Tamassia, Data Structures and Algorithms in JAVA . ( second edition). John Wiley and Sons, Inc. , 2001 . Michael T. Goodrich and Roberto Tamassia, Data Structures and Algorithms in JAVA. (second edition). John Wiley and Sons, Inc., 2001."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.780876"},{"key":"e_1_3_2_1_22_1","volume-title":"The Parallel BGL: A Generic Library for Distributed Graph Computations. Proc. of Parallel Object-Oriented Scientific Computing (POOSC)","author":"Gregor Douglas","year":"2005","unstructured":"Douglas Gregor and Andrew Lumsdaine , The Parallel BGL: A Generic Library for Distributed Graph Computations. Proc. of Parallel Object-Oriented Scientific Computing (POOSC) , July 2005 . Douglas Gregor and Andrew Lumsdaine, The Parallel BGL: A Generic Library for Distributed Graph Computations. Proc. of Parallel Object-Oriented Scientific Computing (POOSC), July 2005."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094844"},{"key":"e_1_3_2_1_24_1","volume-title":"Gross and Jay Yellen, Graph Theory and Its Applications","author":"Jonathan","year":"2005","unstructured":"Jonathan L. Gross and Jay Yellen, Graph Theory and Its Applications . ( 2 nd Edition). Chapman and Hall\/CRC , 2005 . Jonathan L. Gross and Jay Yellen, Graph Theory and Its Applications. (2nd Edition). Chapman and Hall\/CRC, 2005.","edition":"2"},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. 7th Python in Science Conf.","author":"Hagberg Aric A.","year":"2008","unstructured":"Aric A. Hagberg , Daniel A. Schult , and Pieter J . Swart, Exploring network structure, dynamics, and function using NetworkX . in Proc. 7th Python in Science Conf. , 2008 , 11--15. Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart, Exploring network structure, dynamics, and function using NetworkX. in Proc. 7th Python in Science Conf., 2008, 11--15."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(98)00093-3"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/548729"},{"key":"e_1_3_2_1_29_1","volume-title":"Stanford GraphBase: A Platform for Combinatorial Computing","author":"Knuth Donald E.","year":"1994","unstructured":"Donald E. Knuth , Stanford GraphBase: A Platform for Combinatorial Computing . ACM Press , 1994 . Donald E. Knuth, Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, 1994."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_1_32_1","volume-title":"Parallel Shortest Path Algorithms for Solving Large-Scale Graph Instances. DIMACS Implementation Challenge - The Shortest Path Problem","author":"Madduri Kamesh","year":"2006","unstructured":"Kamesh Madduri , David A. Bader , Jonathan W. Berry , and Joseph R . Crobak , Parallel Shortest Path Algorithms for Solving Large-Scale Graph Instances. DIMACS Implementation Challenge - The Shortest Path Problem , 2006 . Kamesh Madduri, David A. Bader, Jonathan W. Berry, and Joseph R. Crobak, Parallel Shortest Path Algorithms for Solving Large-Scale Graph Instances. DIMACS Implementation Challenge - The Shortest Path Problem, 2006."},{"key":"e_1_3_2_1_33_1","volume-title":"Proc. 3rd Workshop on Multithreaded Architectures and Applications (MTAAP'09)","author":"Madduri Kamesh","year":"2009","unstructured":"Kamesh Madduri , David Ediger , Karl Jiang , David A. Bader , and Daniel Chavarria-Miranda , A Faster Parallel Algorithm and Efficient Multithreaded Implementation for Evaluating Betweenness Centrality on Massive Datasets , in Proc. 3rd Workshop on Multithreaded Architectures and Applications (MTAAP'09) , Rome, Italy , May 2009 . Kamesh Madduri, David Ediger, Karl Jiang, David A. Bader, and Daniel Chavarria-Miranda, A Faster Parallel Algorithm and Efficient Multithreaded Implementation for Evaluating Betweenness Centrality on Massive Datasets, in Proc. 3rd Workshop on Multithreaded Architectures and Applications (MTAAP'09), Rome, Italy, May 2009."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703428014"},{"key":"e_1_3_2_1_35_1","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"Mehlhorn Kurt","year":"1999","unstructured":"Kurt Mehlhorn and Stefan N\u00e4her , The LEDA Platform of Combinatorial and Geometric Computing . Cambridge University Press , 1999 . Kurt Mehlhorn and Stefan N\u00e4her, The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972894.9"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_38_1","volume-title":"Miller, A Library for Bulk-Synchronous Parallel Programming. in Proc. British Computer Society Parallel Processing Specialist Group Workshop on General Purpose Parallel Computing","author":"Richard","year":"1993","unstructured":"Richard Miller, A Library for Bulk-Synchronous Parallel Programming. in Proc. British Computer Society Parallel Processing Specialist Group Workshop on General Purpose Parallel Computing , 1993 . Richard Miller, A Library for Bulk-Synchronous Parallel Programming. in Proc. British Computer Society Parallel Processing Specialist Group Workshop on General Purpose Parallel Computing, 1993."},{"key":"e_1_3_2_1_39_1","volume-title":"Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms","author":"Munagala Kameshwar","year":"1999","unstructured":"Kameshwar Munagala and Abhiram Ranade , I\/O-complexity of graph algorithms . in Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms , 1999 , 687--694. Kameshwar Munagala and Abhiram Ranade, I\/O-complexity of graph algorithms. in Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms, 1999, 687--694."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_3_2_1_41_1","first-page":"298","volume":"227","author":"Pike Rob","year":"2005","unstructured":"Rob Pike , Sean Dorward , Robert Griesemer , and Sean Quinlan , Interpreting the Data: Parallel Analysis with Sawzall . Scientific Programming Journal 13(4) , Special Issue on Grids and Worldwide Computing Programming Models and Infrastructure , 2005 , 227 -- 298 . Rob Pike, Sean Dorward, Robert Griesemer, and Sean Quinlan, Interpreting the Data: Parallel Analysis with Sawzall. Scientific Programming Journal 13(4), Special Issue on Grids and Worldwide Computing Programming Models and Infrastructure, 2005, 227--298.","journal-title":"Special Issue on Grids and Worldwide Computing Programming Models and Infrastructure"},{"key":"e_1_3_2_1_42_1","volume-title":"http:\/\/code.google.com\/p\/protobuf\/","author":"Protocol","year":"2009","unstructured":"Protocol Buffers-Google's data interchange format. http:\/\/code.google.com\/p\/protobuf\/ 2009 . Protocol Buffers-Google's data interchange format. http:\/\/code.google.com\/p\/protobuf\/ 2009."},{"key":"e_1_3_2_1_43_1","volume-title":"The Boost Graph Library: User Guide and Reference Manual","author":"Siek Jeremy G.","year":"2002","unstructured":"Jeremy G. Siek , Lie-Quan Lee , and Andrew Lumsdaine , The Boost Graph Library: User Guide and Reference Manual . Addison Wesley , 2002 . Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine, The Boost Graph Library: User Guide and Reference Manual. Addison Wesley, 2002."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316548"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.4"},{"key":"e_1_3_2_1_47_1","volume-title":"Proc. 8th USENIX Symp. on Operating Syst. Design and Implementation","author":"Yu Yuan","year":"2008","unstructured":"Yuan Yu , Michael Isard , Dennis Fetterly , Mihai Budiu , Ulfar Erlingsson , Pradeep Kumar Gunda , and Jon Currey , DryadLINQ : A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language . in Proc. 8th USENIX Symp. on Operating Syst. Design and Implementation , 2008 , 10--14. Yuan Yu, Michael Isard, Dennis Fetterly, Mihai Budiu, Ulfar Erlingsson, Pradeep Kumar Gunda, and Jon Currey, DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language. in Proc. 8th USENIX Symp. on Operating Syst. Design and Implementation, 2008, 10--14."}],"event":{"name":"SIGMOD\/PODS '10: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Indianapolis Indiana USA","acronym":"SIGMOD\/PODS '10"},"container-title":["Proceedings of the 2010 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807167.1807184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T06:52:03Z","timestamp":1673074323000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807167.1807184"}},"subtitle":["a system for large-scale graph processing"],"short-title":[],"issued":{"date-parts":[[2010,6,6]]},"references-count":47,"alternative-id":["10.1145\/1807167.1807184","10.1145\/1807167"],"URL":"https:\/\/doi.org\/10.1145\/1807167.1807184","relation":{},"subject":[],"published":{"date-parts":[[2010,6,6]]},"assertion":[{"value":"2010-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}