A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research w orks. However, these approaches su er from unscalability and load imbalance since they exploit only the existing block angular structure of the LP constraint matrix. In this paper, we consider decomposing LP constraint matrices to obtain block angular structures with speci ed number of blocks for scalable parallelization. We proposedoi:10.1007/3-540-60902-4_50 fatcat:ofxvs7o6yjduzdnprvtgjh4gzu