.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Graphics processing unit
GPU-computing
Incremental linear programming
Cooperative thread array
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
分享收藏Graphics processing unit (GPU) programming strategies and trends in GPU computing图形处理单元 (GPU) 编程策略和GPU计算趋势OAAI
OAAI分享收藏
分享收藏 没有更多内容
没有更多内容