In this paper we describe a scalable parallel formulation of interior point algorithms. Through our implementation on a 256-processor nCUBE 2 parallel computer, we show that our parallel formulation utilizes hundreds of processors efficiently and delivers much higher performance and speedups than reported earlier. These speedups are a result of our highly efficient parallel algorithm for solving a linear symmetric positive definite system using Cholesky factorization. We also evaluate a number of ordering algorithms for sparse matrix factorization in terms of their suitability for parallel Cholesky factorization.
|Original language||English (US)|
|Number of pages||10|
|Journal||Proceedings of the ACM/IEEE Supercomputing Conference|
|State||Published - Jan 1 1994|
|Event||Proceedings of the 1994 Supercomputing Conference - Washington, DC, USA|
Duration: Nov 14 1994 → Nov 18 1994