Two-dimensional batch linear programming on the GPU
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 program...
Saved in:
| Published in: | Journal of parallel and distributed computing 2019-04, Vol.126, p.152-160 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | eng |
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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.
•Novel algorithm based on incremental linear programming, optimized for GPU.•Distributes computational workload evenly between threads in blocks.•Up to 22 times faster against a state-of-the-art GPU linear program solver.•Up to 63 times faster against a state-of-the-art CPU linear program solver. |
|---|---|
| ISSN: | 0743-7315 1096-0848 |