This paper presents a novel, high-performance, graphical processing unit-based algorithm for efficiently solving two-dimensional linear programs in batches. The domain of two-dimensional linear programs is particularly useful due to the prevalence of relevant geometric problems. Batch linear programming refers to solving numerous different linear programs within one operation. By solving many linear programs simultaneously and distributing workload evenly across threads, graphical processing unit utilization can be maximized. Speedups of over 22 times and 63 times are obtained against state-of-the-art graphics processing unit and CPU linear program solvers, respectively.
@article{arxiv.1902.04995,
title = {Two-Dimensional Batch Linear Programming on the GPU},
author = {John Charlton and Steve Maddock and Paul Richmond},
journal= {arXiv preprint arXiv:1902.04995},
year = {2019}
}