An efficient programming model for memory-intensive recursive algorithms using parallel disks

Vlad Slavici, Daniel Kunkle, Gene D. Cooperman, Stephen Linton · 2012

In order to keep up with the demand for solutions to problems with ever-increasing data sets, both academia and industry have embraced commodity computer clusters with locally attached disks or SANs as an inexpensive alternative to supercomputers. With the advent of tools for parallel disks programming, such as MapReduce, STXXL and Roomy --- that allow the developer to focus on higher-level algorithms --- the programmer productivity for memory-intensive programs has increased many-fold. However, such parallel tools were primarily targeted at iterative programs.

Read the paper · More papers on PaperTik