Skip to main content

Linear Programming Computation Model Based on DPVM

  • Conference paper
  • First Online:
  • 1647 Accesses

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 421))

Abstract

Matrix manipulation of Linear Programming (LP) problems is a performance bottleneck in Single Instruction Single Data (SIMD) pattern. While, GPU is specialized for this compute-intensive and highly parallel computation, which is exactly what graphics rendering is about, due to the Single Instruction Multiple Data (SIMD) architecture. This paper introduces a Revised Simplex Method (RSM) on a GPU–Data Parallel Virtual Machine (DPVM). It assigns different routines for CPU and GPU according to respective characteristics: Iteration control and minimum value obtained are completed by CPU and Matrix multiplication by DPVM. In detail, we carefully organize the data as 4-channel textures, and efficiently implement the computation using Fetch4 technology of pixel shader. Numerical experiments are presented to verify the practical value and performance of this algorithm. The results are very promising. In particular, they reveal that our method not only can get correct optimal solution, but also is sixty-six faster than a traditional method on CPU, near 2.5 times faster than a lasted released MATLAB when LP problem size reaches 1200.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Pan, P.Q.: A primal deficient-basis simplex algorithm for linear programming. Appl. Math. Comput. 196(2), 898–912 (2008)

    MathSciNet  MATH  Google Scholar 

  2. Kebbiche, Z., Keraghel, A., Yassine, A.: Extension of a projective interior point method for linearly constrained convex programming. Appl. Math. Comput. 193(2), 553–559 (2007)

    MathSciNet  MATH  Google Scholar 

  3. Klee, V., Minty, G.J.: How good is the simplex algorithm. Washington University of Seattle, Department of Mathematics (1970)

    Google Scholar 

  4. Paparrizos, K., Samaras, N., Stephanides, G.: A new efficient primal dual simplex algorithm. Comput. Oper. Res. 30(9), 1383–1399 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Luh, H., Tsaih, R.: An efficient search direction for linear programming problems. Comput. Oper. Res. 29(2), 195–203 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Junior, H.V., Lins, M.P.E.: An improved initial basis for the simplex algorithm. Comput. Oper. Res. 32(8), 1983–1993 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Napoli, C., Pappalardo, G., Tramontana, E., et al.: A cloud-distributed gpu architecture for pattern identification in segmented detectors big-data surveys. Comput. J. 59(3), 338–352 (2014). doi:10.1093/comjnl/bxu147

  8. Georgieva, K., Koch, C., König, M.: Wavelet transform on Multi-GPU for real-time pavement distress detection. In: Computing in Civil Engineering 2015, pp. 99–106. ASCE (2015)

    Google Scholar 

  9. Ting, T.O., Ma, J., Kim, K.S., et al.: Multicores and GPU utilization in parallel swarm algorithm for parameter estimation of photovoltaic cell model. Appl. Soft Comput. 40, 58–63 (2016)

    Article  Google Scholar 

  10. Conti, F., Khatib, O.: A framework for real-time multi-contact multi-body dynamic simulation. In: Inaba, M., Corke, P. (eds.) Robotics Research. STAR, vol. 114, pp. 271–287. Springer, Heidelberg (2016). doi:10.1007/978-3-319-28872-7_16

    Chapter  Google Scholar 

  11. Peercy, M., Segal, M., Gerstmann, D.: A performance-oriented data parallel virtual machine for GPUs. In: ACM SIGGRAPH 2006 Sketches, p. 184. ACM (2006)

    Google Scholar 

  12. Lefohn, A., Kniss, J., Owens, J.: Implementing efficient parallel data structures on GPUs. GPU Gems 2, 521–545 (2005)

    Google Scholar 

Download references

Acknowledgements

The authors gratefully acknowledge the financial supports for this research from the National Natural Science Foundation of China (51409117, 61272208, 61572228), Jilin Province Department of Education “Thirteen Five” scientific and technological research projects [2016] No. 432, Fundamental Research Funds for the Central Universities Special (JCKY-QKJC47, JCKY-QKJC49).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongtao Bai .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Bai, H., He, L., Jiang, Y., Wang, J., Jiang, S. (2017). Linear Programming Computation Model Based on DPVM. In: Park, J., Pan, Y., Yi, G., Loia, V. (eds) Advances in Computer Science and Ubiquitous Computing. UCAWSN CUTE CSA 2016 2016 2016. Lecture Notes in Electrical Engineering, vol 421. Springer, Singapore. https://doi.org/10.1007/978-981-10-3023-9_74

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3023-9_74

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3022-2

  • Online ISBN: 978-981-10-3023-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics