Year-end Sale % OFF 
Abstract
We describe an implementation of a parallel linear programming solver on the Cell BE processor. This implementation is based on GLPK C routines which solve LP problems using a serial implementation of one of the interior point methods. We have identified the computational kernels of the serial version and decided to implement a parallel version of Cholesky factorization and integrate it into GLPK. Our decision stemmed from the fact that Cholesky factorization is the most computationally expensive kernel that has the most potential to parallelize efficiently on the Cell BE processor. Compared to the execution time of serial GLPK on the Cell Power Processing Element (PPE), we were able to obtain a speedup of up to 7 when solving some of the large size Netlib problems on Sony’s PlayStation 3.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
