메뉴 건너뛰기




Volumn , Issue , 2010, Pages

An efficient GPU implementation of the revised simplex method

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL POWER; GENERAL-PURPOSE COMPUTING; GPU IMPLEMENTATION; GRAPHICS PROCESSING UNITS; MASSIVE PARALLELISM; PARALLEL PROCESSING; PERFORMANCE GAIN; REVISED SIMPLEX METHODS;

EID: 77954052308     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2010.5470831     Document Type: Conference Paper
Times cited : (29)

References (21)
  • 2
    • 77953998137 scopus 로고    scopus 로고
    • Sparse matrix solvers on the GPU: Conjugate gradients and multigrid
    • J. Bolz, I. Farmer, E. Grinspun, and P. Schröder, "Sparse matrix solvers on the GPU: conjugate gradients and multigrid," ACM Transactions on Graphics, vol. 22, pp. 917-924, 2003.
    • (2003) ACM Transactions on Graphics , vol.22 , pp. 917-924
    • Bolz, J.1    Farmer, I.2    Grinspun, E.3    Schröder, P.4
  • 3
    • 77954024744 scopus 로고    scopus 로고
    • Linear algebra operators for GPU implementation of numerical algorithms
    • J. Krüger and R. Westermann, "Linear algebra operators for GPU implementation of numerical algorithms," ACM Transactions on Graphics, vol. 22, pp. 908-916, 2003.
    • (2003) ACM Transactions on Graphics , vol.22 , pp. 908-916
    • Krüger, J.1    Westermann, R.2
  • 5
    • 54549099252 scopus 로고    scopus 로고
    • Implementing an interior point method for linear programs on a CPU-GPU system
    • J. H. Jung and D. P. O'Leary, "Implementing an interior point method for linear programs on a CPU-GPU system," Electronic Transactions on Numerical Analysis, vol. 28, pp. 174-189, 2008.
    • (2008) Electronic Transactions on Numerical Analysis , vol.28 , pp. 174-189
    • Jung, J.H.1    O'Leary, D.P.2
  • 6
    • 77954065146 scopus 로고    scopus 로고
    • Stellenbosch University, South Africa, Honours Year Project
    • G. Greeff, "The revised simplex method on a GPU," Stellenbosch University, South Africa, Honours Year Project, 2004.
    • (2004) The Revised Simplex Method on a GPU
    • Greeff, G.1
  • 12
    • 51049091381 scopus 로고    scopus 로고
    • Parallel processing of matrix multiplication in a CPU and GPU heterogeneous environment
    • ser. Lecture Notes in Computer Science, Springer
    • S. Ohshima, K. Kise, T. Katagiri, and T. Yu, "Parallel processing of matrix multiplication in a CPU and GPU heterogeneous environment." in VECPAR, ser. Lecture Notes in Computer Science, vol. 4395. Springer, 2006.
    • (2006) VECPAR , vol.4395
    • Ohshima, S.1    Kise, K.2    Katagiri, T.3    Yu, T.4
  • 15
    • 0000564361 scopus 로고
    • A polynomial algorithm in linear programming
    • L. G. Khachiyan, "A polynomial algorithm in linear programming," Soviet Mathmatics Doklady, vol. 20, pp. 191-194, 1979.
    • (1979) Soviet Mathmatics Doklady , vol.20 , pp. 191-194
    • Khachiyan, L.G.1
  • 16
    • 51249181779 scopus 로고
    • A new polynomial-time algorithm for linear programming
    • N. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica, vol. 4, pp. 373-395, 1984.
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.1
  • 18
    • 0000726097 scopus 로고
    • A practicable steepest-edge simplex algorithm
    • D. Goldfarb and J. K. Reid, "A practicable steepest-edge simplex algorithm," Mathematical Programming, vol. 12, pp. 361-371, 1977.
    • (1977) Mathematical Programming , vol.12 , pp. 361-371
    • Goldfarb, D.1    Reid, J.K.2
  • 20
    • 77954070431 scopus 로고    scopus 로고
    • [Online]. Available
    • "GPGPU.org." [Online]. Available: http://www.gpgpu.org.
    • GPGPU.org
  • 21
    • 20944450471 scopus 로고
    • Steepest-edge simplex algorithms for linear programming
    • J. J. Forrest and D. Goldfarb, "Steepest-edge simplex algorithms for linear programming," Mathematical Programming, vol. 57, pp. 341-374, 1992.
    • (1992) Mathematical Programming , vol.57 , pp. 341-374
    • Forrest, J.J.1    Goldfarb, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.