.png){kind=icon}
.png){kind=icon}
Return
Two-dimensional batch linear programming on the GPU
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2019.01.001.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. Crown Copyright (C) 2019 Published by Elsevier Inc. All rights reserved.
Keywords:
Graphics processing unit
GPU-computing
Incremental linear programming
Cooperative thread array
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K