<span class="var-sub_title">Distributed L-Shaped Algorithms in Julia</span> SC18 Proceedings

The International Conference for High Performance Computing, Networking, Storage, and Analysis

PAW-ATM: Parallel Applications Workshop - Alternatives to MPI


Distributed L-Shaped Algorithms in Julia

Abstract: We present L-Shaped Solvers, a suite of scalable stochastic programming solvers implemented in the Julia programming language. The solvers, which are based on the L-shaped algorithm, run efficiently in parallel, exploit problem structure, and operate on distributed data. The implementation introduces several flexible high-level abstractions that result in a modular design and simplify the development of algorithm variants. In addition, we demonstrate how the abstractions available in the Julia module for distributed computing are exploited to simplify the implementation of the parallel algorithms. The performance of the solvers is evaluated on large-scale problems for finding optimal orders on the Nordic day-ahead electricity market. With 16 worker cores, the fastest algorithm solves a distributed problem with 2.5 million variables and 1.5 million linear constraints about 19 times faster than Gurobi is able to solve the extended form directly.

Website: http://sourceryinstitute.github.io/PAW/

Archive Materials


Back to PAW-ATM: Parallel Applications Workshop - Alternatives to MPI Archive Listing

Back to Full Workshop Archive Listing