<--- Back to Details
First PageDocument Content
Distributed computing architecture / MapReduce / Parallel computing / NP-complete problems / PageRank / Eulerian path / Graph / Topological graph theory / Connected component / Graph theory / Mathematics / Theoretical computer science
Date: 2010-08-02 09:34:23
Distributed computing architecture
MapReduce
Parallel computing
NP-complete problems
PageRank
Eulerian path
Graph
Topological graph theory
Connected component
Graph theory
Mathematics
Theoretical computer science

Design Patterns for Efficient Graph Algorithms in MapReduce Jimmy Lin and Michael Schatz University of Maryland, College Park {jimmylin,mschatz}@umd.edu

Add to Reading List

Source URL: www.umiacs.umd.edu

Download Document from Source Website

File Size: 911,87 KB

Share Document on Facebook

Similar Documents

CVA Memo #138  Sikker: A High-Performance Distributed System Architecture for Secure Service-Oriented Computing  Nicholas McDonald and William J. Dally

CVA Memo #138 Sikker: A High-Performance Distributed System Architecture for Secure Service-Oriented Computing Nicholas McDonald and William J. Dally

DocID: 1uuaH - View Document

CVA Memo #137  Sikker: A Distributed System Architecture for Secure High Performance Computing Nicholas McDonald

CVA Memo #137 Sikker: A Distributed System Architecture for Secure High Performance Computing Nicholas McDonald

DocID: 1uivM - View Document

<Insert Picture Here>  Hudson Execution and Scheduling Architecture

Hudson Execution and Scheduling Architecture

DocID: 1rtYD - View Document

Microsoft Word - HotPower_camera_ready_ACM_format

Microsoft Word - HotPower_camera_ready_ACM_format

DocID: 1rtKl - View Document

SplitStream: High-bandwidth content distribution in cooperative environments Miguel Castro1 Peter Druschel2 Antony Rowstron1

SplitStream: High-bandwidth content distribution in cooperative environments Miguel Castro1 Peter Druschel2 Antony Rowstron1

DocID: 1rry7 - View Document