arrow
Return

Accelerating Revised Simplex Method Using GPU-Based Basis Update

delete2020-01-01
delete4
delete
OA
AI
U
Usman Ali Shah
S
Suhail Yousaf
I
Iftikhar Ahmad
S
Safi Ur Rehman
M
Muhammad Ovais Ahmad *
DOI:10.1109/ACCESS.2020.2980309delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Optimization problems lie at the core of scientific and engineering endeavors. Solutions to these problems are often compute-intensive. To fulfill their compute-resource requirements, graphics processing unit (GPU) technology is considered a great opportunity. To this end, we focus on linear programming (LP) problem solving on GPUs using revised simplex method (RSM). This method has potentially GPU-friendly tasks, when applied to large dense problems. Basis update (BU) is one such task, which is performed in every iteration to update a matrix called basis-inverse matrix. The contribution of this paper is two-fold. Firstly, we experimentally analyzed the performance of existing GPU-based BU techniques. We discovered that the performance of a relatively old technique, in which each GPU thread computed one element of the basis-inverse matrix, could be significantly improved by introducing a vector-copy operation to its implementation with a sophisticated programming framework. Second, we extended the adapted element-wise technique to develop a new BU technique by using three inexpensive vector operations. This allowed us to reduce the number of floating-point operations and conditional processing performed by GPU threads. A comparison of BU techniques implemented in double precision showed that our proposed technique achieved 17.4 & x0025; and 13.3 & x0025; average speed-up over its closest competitor for randomly generated and well-known sets of problems, respectively. Furthermore, the new technique successfully updated basis-inverse matrix in relatively large problems, which the competitor was unable to update. These results strongly indicate that our proposed BU technique is not only efficient for dense RSM implementations but is also scalable.
Keywords:
Graphics processing units
Linear programming
Sparse matrices
Standards
Task analysis
Memory management
Iterative methods
Dense matrices
GPU
GPGPU
linear programming
revised simplex method
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

Karakoram International University cover
Karakoram International University
Scholars:
283
Papers: 269
Citations: 516
U
University of Peshawar
Scholars:
3.4K
Papers: 2.8K
Citations: 3.1K
K
Karlstad University
Scholars:
1.6K
Papers: 1.7K
Citations: 2.0K
researcher View more organizations