Answers are grounded in this paper and cite their sources.
We study the parallelization of the steepest-edge version of the dual simplex algorithm. Three different parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on different parallel platforms, including heterogeneous workstation clusters, Silicon Graphics multi-processors, and an IBM SP2. We report on our computational experience.
No takes yet. Share an insight, caveat, or question.
Bixby et al. (2000) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: