aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorAndrea Smith <smit9523@umn.edu>2020-10-05 23:05:28 -0500
committerAndrea Smith <smit9523@umn.edu>2020-10-05 23:05:28 -0500
commita895de5449f57734f870209f2c82b6fb0a23e8fb (patch)
tree529b31bd7008b76f29fff4f26a5eb53ce645cbad
parentMerge branch 'master' of github.umn.edu:STRAP012/csci4061Projects (diff)
downloadcsci4061-a895de5449f57734f870209f2c82b6fb0a23e8fb.tar
csci4061-a895de5449f57734f870209f2c82b6fb0a23e8fb.tar.gz
csci4061-a895de5449f57734f870209f2c82b6fb0a23e8fb.tar.bz2
csci4061-a895de5449f57734f870209f2c82b6fb0a23e8fb.tar.lz
csci4061-a895de5449f57734f870209f2c82b6fb0a23e8fb.tar.xz
csci4061-a895de5449f57734f870209f2c82b6fb0a23e8fb.tar.zst
csci4061-a895de5449f57734f870209f2c82b6fb0a23e8fb.zip
README formatting
Diffstat (limited to '')
-rw-r--r--P1/README.md8
1 files changed, 5 insertions, 3 deletions
diff --git a/P1/README.md b/P1/README.md
index ea3f362..b36573e 100644
--- a/P1/README.md
+++ b/P1/README.md
@@ -1,19 +1,21 @@
+# CSCI 4061: Project 1
+
test machine: apollo.cselabs.umn.edu
date: 10/3/2020
name: Andrea Smith , Matt Strapp
x500: smit9523, strap012
-The purpose of this program is to recreate the mapreduce programming model for Big Data Analytics. In order to compile this program, simply run the included Makefile, which takes no arguments.
+The purpose of this program is to recreate the mapreduce programming model for Big Data Analytics. In order to compile this program, simply run the included Makefile, which takes no arguments.
Program structure:
mapreduce.c:
Mapreduce is the master phase of this program. It is responsible for calling the mapper and reducer processes. It will wait for each process to finish executing before exiting the code.
mapper.c:
- Mapper receives a chunk of data and emits it into an intermediate data structure, which is a two-level linked list. writeIntermediateDS() formats the data, writing each word and its associated "1's" in the form "word 1 1 1..." to its own file, word.txt.
+ Mapper receives a chunk of data and emits it into an intermediate data structure, which is a two-level linked list. writeIntermediateDS() formats the data, writing each word and its associated "1's" in the form "word 1 1 1..." to its own file, word.txt.
reducer.c:
Reducer receives the word.txt files and "reduces" them into n files (where n is an input) containing the words and amount of 1's associated with the word in the format "word number_of_1's"
Team Contributions:
-As can be seen by the number of back-and-forth GitHub commits, this project was thoroughly a team effort. However, for the purposes of appropriating (what I am sure will be) praise from the professors and TA's (just kidding!), Matt wrote mapreduce, Andrea wrote reducer, and mapper was written by both of us. \ No newline at end of file
+As can be seen by the number of back-and-forth GitHub commits, this project was thoroughly a team effort. However, for the purposes of appropriating (what I am sure will be) praise from the professors and TA's (just kidding!), Matt wrote mapreduce, Andrea wrote reducer, and mapper was written by both of us.