By Topic

Parallel implementations of the simplex algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Marciano, R. ; Dept. of Comput. Sci., Iowa Univ., Iowa City, IA, USA ; Rus, T.

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

Published in:

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

Date of Conference:

10-12 Oct 1988