Fig 1.
MRPack Architecture: The Map and Reduce functions are extended to In-Map and In-Reduce, which function for each algorithm under the umbrella of a single job.
Fig 2.
Composite Key Structure: This structure shows keys modeling in MRPack where it is used to differentiate the algorithms.
Fig 3.
The basic data flow of MRPack based on two algorithms, WordCount and InvertedIndex.
Fig 4.
Cluster-based analysis of MRPack performance compared to that of generic MapReduce.
Fig 5.
Analysis based on changing data size w.r.t overall job execution time.
Fig 6.
Analysis based on number of algorithms in an MRPack job with respect to time execution time in terms of I/O and network communication.