ouyanguf/hadoop-word-count ouyanguf/hadoop-word-count

  • Stars
    star
    1
  • Language
    Java
  • Created almost 11 years ago
  • Updated almost 11 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
ouyanguf/hadoop-word-count
github

ouyanguf

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Three versions of word count using Hadoop distributed computing: (1) Basic Word Count (2) Two-Word Count (3) Word Count Using Specified Word List

More Repositories

1

hadoop-page-rank

Iterative MapReduce program to implement Page Rank using Amazon EC2 and FutureGrid given sample graphs(each line starts with the node id and then its adjacency list).
Java
3
star
2

hadoop-page-rank-new

Page Rank
Java
1
star
3

code-practice

Code Practice in Java(Still Updating)
Java
1
star
4

pastry-protocol

The goal of this project is to implement the Pastry protocol in Scala using the actor model and use a simple object access service to prove its usefulness.
Scala
1
star
5

ouyanguf.github.io

Personal Website
CSS
1
star
6

movie-time

Movie Time is a movie related website with a huge movie database that supports DVD sale, movie ranking, movie rating. And a movie related social network is attached.
PHP
1
star
7

distributed-debugger

Logging information about what actors send what message to what other actor can help in figuring out problems. This project consists in two phases. In phase I, logging capabilities were added to Scala so that information is captured about the execution. these logs were used to produce useful information for the user to figure out what could have gone wrong.
Scala
1
star
8

gossip-simulator

Gossip type algorithms can be used both for group communication and for aggregate computation. The goal of this project is to determine the convergence of such algorithms through a simulator based on actors written in Scala. Since actors in Scala are fully asynchronous, the particular type of Gossip implemented is the so called Asynchronous Gossip.
Scala
1
star
9

find-perfect-square

Input: The input provided (as command line to your project1.scala) will be two numbers: N and k. The overall goal of your program is to find all k consecutive numbers, starting at 1, such that the sum of squares is itself a perfect square (square of an integer). Output: Print, on independent lines, the first number in the sequence for each solution.
1
star