# LDRD final report on massively-parallel linear programming : the parPCx system.

@inproceedings{Parekh2005LDRDFR, title={LDRD final report on massively-parallel linear programming : the parPCx system.}, author={Ojas Parekh and Cynthia A. Phillips and Erik G. Boman}, year={2005} }

- Published 2005
DOI:10.2172/921147

This report summarizes the research and development performed from October 2002 to September 2004 at Sandia National Laboratories under the Laboratory-Directed Research and Development (LDRD) project ''Massively-Parallel Linear Programming''. We developed a linear programming (LP) solver designed to use a large number of processors. LP is the optimization of a linear objective function subject to linear constraints. Companies and universities have expended huge efforts over decades to produce… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-5 OF 5 CITATIONS

## Partitioning Models for Scaling Parallel Sparse Matrix-Matrix Multiplication

VIEW 6 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Simultaneous Input and Output Matrix Partitioning for Outer-Product-Parallel Sparse Matrix-Matrix Multiplication

VIEW 5 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Exploiting Locality in Sparse Matrix-Matrix Multiplication on Many-Core Architectures

VIEW 3 EXCERPTS

CITES BACKGROUND & METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 43 REFERENCES

## Expected losses

VIEW 1 EXCERPT

## Maximum-weight-basis preconditioners

VIEW 1 EXCERPT

## Nearly linear time algorithms for graph par-titioning

VIEW 2 EXCERPTS

## Polyhedral combinatorics

VIEW 1 EXCERPT