Decomposing Linear Programs for Parallel Solution

Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. 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 propose hypergraph models to represent LP constraint matrices for decomposition. In these models, the decomposition problem reduces to the well-known hypergraph partitioning problem. A Kernighan-Lin based multiway hypergraph partitioning heuristic is implemented for experimenting with the performance of the proposed hypergraph models on the decomposition of the LP problems selected from NETLIB suite. Initial results are promising and justify further research on other hypergraph partitioning heuristics fo...

• Type: Conference
• Year: 1995
• Where: PARA
• Authors: Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat, Mustafa Pinar
• Keywords: Applied Computing, Hypergraph, LP Constraint, LP Constraint Matrices, PARA 1995