Implementing map reducer algorithm using kompics library
This is second computer assignment of Distributed System course
First read mst.txt file and running leader election algorithm to find root node and leaves.
Then running map reduce algorithm.
The input file should be a text file in a CA-text-file file and result would be came into result.txt
| Words | Number |
|---|---|
| word1 | 1000 |
| word2 | 304 |
| word3 | 2005 |
Kompics module visulization:
