2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PHD Forum 2011
DOI: 10.1109/ipdps.2011.362
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Implementation of the Simplex Method on a CPU-GPU System

Abstract: The Simplex algorithm is a well known method to solve linear programming (LP) problems. In this paper, we propose a parallel implementation of the Simplex on a CPU-GPU systems via CUDA. Double precision implementation is used in order to improve the quality of solutions. Computational tests have been carried out on randomly generated instances for non-sparse LP problems. The tests show a maximum speedup of 12.5 on a GTX 260 board.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
37
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 27 publications
(37 citation statements)
references
References 10 publications
0
37
0
Order By: Relevance
“…In our hybrid approach, part of the corresponding operations are being performed in the GPU, using appropriate reduction techniques. Our experiments showed (as opposed to [19] and [20]) that the performance obtained by sharing these reduction steps in both the CPU and GPU, was at least equivalent (and in any case note worse) to the alternative followed there (of performing the reduction operations totally in the CPU). The relatively large size of the tested problems, the double precision operations, and the limitations of the NVIDIA architecture itself, lead to limited efficiency when the GPU participates in the reduction computations.…”
Section: Iterate/finalizationmentioning
confidence: 71%
See 4 more Smart Citations
“…In our hybrid approach, part of the corresponding operations are being performed in the GPU, using appropriate reduction techniques. Our experiments showed (as opposed to [19] and [20]) that the performance obtained by sharing these reduction steps in both the CPU and GPU, was at least equivalent (and in any case note worse) to the alternative followed there (of performing the reduction operations totally in the CPU). The relatively large size of the tested problems, the double precision operations, and the limitations of the NVIDIA architecture itself, lead to limited efficiency when the GPU participates in the reduction computations.…”
Section: Iterate/finalizationmentioning
confidence: 71%
“…In [32] another implementation of the revised simplex method on GPU was proposed, which permits one to speed up solution with a maximum factor of 18 in single precision on a GeForce 9600 GT GPU card as compared with GLPK solver run on Intel Core 2 Duo 3GHz CPU. Lalami et al [19] have presented a GPU mainly based parallel implementation via CUDA of the standard simplex algorithm for dense LP problems. Experiments carried out on an Intel Xeon 3GHz and a GTX 260 GPU have shown substantial speedup of 12.5 in double precision, for randomly generated LP problems of size up to 8000x8000.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations