Parallelizing the dual simplex method:

Abstract: "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 co...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bixby, Robert E. (VerfasserIn), Martin, Alexander 1965- (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Berlin-Wilmersdorf Konrad-Zuse-Zentrum für Informationstechnik Berlin 1995
Schriftenreihe:Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1995,45
Schlagworte:
Zusammenfassung:Abstract: "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, Sun S20- 502, Silicon Graphics multi-processors, and an IBM SP2. We report on our computational experience."
Beschreibung:21 S.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!