LLMapReduce: Multi-level map-reduce for high performance data analysis
Chansup Byun, Jeremy Kepner, William Arcand et al. · IEEE High Performance Extreme Computing Conference · 2016
The map-reduce parallel programming model has become extremely popular in the big data community. Many big data workloads can benefit from the enhanced performance offered by supercomputers. LLMapReduce provides the familiar map-reduce parallel programming model to big data users running on a supercomputer. LLMapReduce dramatically simplifies map-reduce programming by providing simple parallel programming capability in one line of code. LLMapReduce supports all programming languages and many schedulers. LLMapReduce can work with any application without the need to modify the application. Furthermore, LLMapReduce can overcome scaling limits in the map-reduce parallel programming model via options that allow the user to switch to the more efficient single-program-multiple-data (SPMD) parallel programming model. These features allow users to reduce the computational overhead by more than 10x compared to standard map-reduce for certain applications. LLMapReduce is widely used by hundreds of users at MIT. Currently LLMapReduce works with several schedulers such as SLURM, Grid Engine and LSF.
Cited by 17 works. doi:10.1109/hpec.2016.7761618 Open-access PDF
Authors
- Chansup Byun
- Jeremy Kepner
- William Arcand
- David Bestor
- Bill Bergeron
- Vijay N. Gadepally
- Matthew Hubbell
- Peter W. Michaleas
- Julie Mullen
- Andrew J. Prout
- Antonio De Rosa
- Charles Yee
- Albert Reuther
References
- A relational model of data for large shared data banks
- Basic Linear Algebra Subprograms for Fortran Usage
- Dynamo
- LAPACK Users' Guide
- Bigtable
- A set of level 3 basic linear algebra subprograms
- A high-performance, portable implementation of the MPI message passing interface standard
- ScaLAPACK Users' Guide
- Using MPI
- S12---The HPC Challenge (HPCC) benchmark suite