Parallel implementations of the simplex algorithm

Author

Marciano, Richard ; Rus, Teodor

Author_Institution

Dept. of Comput. Sci., Iowa Univ., Iowa City, IA, USA

fYear

1988

fDate

10-12 Oct 1988

Firstpage

85

Lastpage

92

Abstract

Three parallel implementations of the simplex algorithm on three different parallel architectures are presented and compared. Each machine is the representative of one class of parallel computers. Performance comparisons and the major difficulties encountered by users of these machines are given. The potential for parallel programming of the array processors is investigated with the massively parallel processor (MPP) machine. Multiprocessor systems with asynchronous shared memory are studied by implementing the simplex algorithm on the Encore machine in both the process creation by fork() and the tasking environment. The class of supercomputers represented by the Alliant FX-8 minisupercomputer where a Fortran compiler can parallelize and vectorize DO loops is considered

Keywords

parallel algorithms; parallel architectures; parallel programming; Alliant FX-8 minisupercomputer; DO loops; Encore machine; Fortran compiler; array processors; asynchronous shared memory; massively parallel processor; parallel architectures; parallel implementations; parallel programming; performance comparison; simplex algorithm; tasking environment; Cities and towns; Computer science; Concurrent computing; Equations; Linear programming; Linear systems; Multiprocessing systems; Parallel architectures; Parallel programming; Supercomputers;

fLanguage

English

Publisher

ieee

Conference_Titel

Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of

Conference_Location

Fairfax, VA

Print_ISBN

0-8186-5892-4

Type

conf

DOI

10.1109/FMPC.1988.47417

Filename

47417