Skip to content

Latest commit

 

History

History
8 lines (5 loc) · 448 Bytes

File metadata and controls

8 lines (5 loc) · 448 Bytes

HadoopProgramming

Parallel computing tasks using hadoop

Mapreduce is a parallel computation framework that is help in performing computation in large graph data. For example, social network. The following codes are two examples I created for graph analysis using mapreduce.

  1. Use mapreduce for Breadth first search in Social network, find the shortes path between individuals.

  2. Use map reduce for Pagerank calculation in Social network.