A task-based approach to parallel parametric linear programming solving, and application to polyhedral computations
Computational Geometry
2020-10-01 v1 Distributed, Parallel, and Cluster Computing
Abstract
Parametric linear programming is a central operation for polyhedral computations, as well as in certain control applications.Here we propose a task-based scheme for parallelizing it, with quasi-linear speedup over large problems.This type of parallel applications is challenging, because several tasks mightbe computing the same region. In this paper, we are presenting thealgorithm itself with a parallel redundancy elimination algorithm, andconducting a thorough performance analysis.
Cite
@article{arxiv.2009.14435,
title = {A task-based approach to parallel parametric linear programming solving, and application to polyhedral computations},
author = {Camille Coti and David Monniaux and Hang Yu},
journal= {arXiv preprint arXiv:2009.14435},
year = {2020}
}
Comments
arXiv admin note: text overlap with arXiv:1904.06079