Back to Results
First PageMeta Content
Graph coloring / Vertex / Graph / Bellman–Ford algorithm / Connected component / Shortest path problem / Tree / Clique / Matching / Graph theory / Graph connectivity / Path


Pregel: A System for Large-Scale Graph Processing Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski Google, Inc. {malewicz,austern,ajcbik,dehnert,il
Add to Reading List

Document Date: 2011-10-18 16:44:37

Open Document

File Size: 473,87 KB

Share Result on Facebook

City

Columbus / Indianapolis / RAM / /

Company

John Wiley and Sons Inc. / Future Generation Computer Systems / IEEE Intl / Princeton University Press / Local-Area Networks / Target / Grzegorz Czajkowski Google Inc. / Google / Ford / Reusable Software / Pregel / Vertex / /

Country

United States / /

Currency

USD / /

/

Event

Person Communication and Meetings / /

Facility

The Pregel library / Oxford BSP Library / Paderborn University BSP library / Parallel Boost Graph Library / Pregel library / That checkpoint / Green BSP library / /

IndustryTerm

randomized maximal matching algorithm / arbitrary graph algorithms / parallel algorithms / largescale computing problems / distributed processing / social networking site / parallel greedy semi-clustering algorithm / graph processing / minimum spanning tree algorithm / highperformance torus network / Graph algorithms / graph algorithm / transportation routes / shortest paths algorithm / obvious practical applications / user algorithm / Web graph / social networks / computing / paths algorithms / stream processing / parallel graph algorithms / large-scale graph computing / road networks / large scale distributed systems / graph mining algorithm / applied algorithms / maximum-weight bipartite matching algorithm / breadth-first search / graph computing problems / Web Search Engine / given algorithm / asynchronous systems / Web search / bipartite matching algorithm / /

MusicGroup

The Grid / /

NaturalFeature

Sierra Michels-Slettvet / Pregel river / /

Organization

Princeton University / /

Person

Fay Chang / Mark W. Goudreau / Robert E. Gruber / Leonhard Euler / Douglas Gregor / Lorenz Huelsbergen / Roberto Tamassia / Boris V. Cherkassky / Richard Bellman / Lawrence Page / Martin Erwig / Yossi Matias / Robert Henry / Lester R. Ford / Howard Gobioff / Ingo von Otte / Susan Owicki / James Saxe / Tushar Chandra / Urs Hoelzle / Andrew Fikes / Charles Thacker / Deborah A. Wallach / Ben H.H. Juurlink / Delbert R. Fulkerson / Kevin Lang / Tomasz Radzik / Mike Burrows / Jeffrey Dean / Olaf Bonorden / Galina Shubina / Satish B. Rao / Andrew Lumsdaine / John T. Daly / Jeff Dean / Jonathan W. Berry / Sanjay Ghemawat / Sergey Brin / Petar Maymounkov / Punyashloka Biswal / Mohsen Bayati / Andrew V. Goldberg / Luiz Barroso / Joseph R. Crobak / Kamesh Madduri / Stanford GraphBase / Jonathan Cohen / Morgan Kaufmann / Frank Dehne / Devavrat Shah / Wilson C. Hsieh / Mayank Sharma / Charles Reiss / David A. Bader / Steffen Meschkat / Ian Foster / Carl Kesselman (Eds) / Thomas Anderson / Adnan Aziz / Albert Chan / Michael T. Goodrich / Matthew H. Austern / James C. Dehnert / Ilan Horn / /

Position

model / having no associated computation / same worker / representative / destination worker / Writer / /

ProgrammingLanguage

C++ / /

ProvinceOrState

Indiana / /

Technology

Functional Programming / object-oriented programming / parallel greedy semi-clustering algorithm / RAM / arbitrary graph algorithms / user algorithm / API / Frequently applied algorithms / shared memory / minimum spanning tree algorithm / 200 processors / JAVA / 112 processors / randomized maximal matching algorithm / maximum-weight bipartite matching algorithm / Nondeterministic algorithms / Topology Mutations Some graph algorithms / CGM Graph Algorithms / parallel graph algorithms / Shortest paths algorithms / Functional Graph Algorithms / programming graph algorithms / 40 processors / relational database / clustering algorithm / 32 / 768 PowerPC processors / Search Engine / bipartite matching algorithm / Graph algorithms / graph mining algorithm / load balancing / PageRank algorithm / graph algorithm / given algorithm / HTTP / stepping shortest paths algorithm / Semi-Clustering algorithm / 32 processors / 142 algorithm / Parallel Processing / /

SocialTag