In this submission, we explore the use of equality saturation to optimize concurrent computations. A concurrent environment gives rise to new optimization opportunities, like extracting a common concurrent subcomputation. To our knowledge, no existing equality saturation framework allows such an optimization. The challenge with concurrent environments is that they require non-local reasoning since parallel computations are inherently unrelated and disjoint. This submission presents a new approach to optimizing equivalent concurrent computations: extending e-graphs to capture equal concurrent computations in order to replace them with a single computation.
@article{arxiv.2208.06295,
title = {On the Optimization of Equivalent Concurrent Computations},
author = {Henrich Lauko and Lukáš Korenčik and Peter Goodman},
journal= {arXiv preprint arXiv:2208.06295},
year = {2022}
}