blob: ed1f9e5cafbc9bb3432c7da441514d2739d745c5 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
#include "mapreduce.h"
int main(int argc, char *argv[]) {
if(argc < 4) {
printf("Less number of arguments.\n");
printf("./mapreduce #mappers #reducers inputFile\n");
exit(0);
}
// ###### DO NOT REMOVE ######
int nMappers = strtol(argv[1], NULL, 10);
int nReducers = strtol(argv[2], NULL, 10);
char *inputFile = argv[3];
// ###### DO NOT REMOVE ######
bookeepingCode();
// ###### DO NOT REMOVE ######
pid_t pid = fork();
if(pid == 0){
//send chunks of data to the mappers in RR fashion
sendChunkData(inputFile, nMappers);
exit(0);
}
sleep(1);
pid_t mapperPid;
for (int i = 0; i < nMappers; i++) {
mapperPid = fork();
if (mapperPid != 0) {
//TODO: exec here
}
}
for (int i = 0; i < nMappers; i++) {
//Hopefully this works
wait(NULL);
}
// ###### DO NOT REMOVE ######
// shuffle sends the word.txt files generated by mapper
// to reducer based on a hash function
pid = fork();
if(pid == 0){
shuffle(nMappers, nReducers);
exit(0);
}
sleep(1);
pid_t reducerPid;
for (int i = 0; i < nReducers; i++) {
reducerPid = fork();
if (reducerPid != 0) {
//TODO: exec here
}
}
for (int i = 0; i < nReducers; i++) {
//Maybe this works too?
wait(NULL);
}
return 0;
}
|
