A New Partitioning Algorithm for Optimizing Parallelization of Flow Networks |SciPy 2020| Tiernan

Parallelization of previously serial code is a critical step in developing the next generation of modeling software. Civil engineering models have been slow to parallelize, and thus have not been considered in many algorithms to optimize parallelization. Unique characteristics of civil engineering networks require unique solutions, which the novel BIPquick optimization algorithm addresses. BIPquick is a general partitioning algorithm which enforces a part size equality condition, while seeking to minimize part interconnectedness. It can be used to partition any directed graph object, but it's intended target is networks which are not well suited for power-law or recursive bi-section partitioning.

*****************