swMATH ID: 2174
Software Authors: Hall, J.A.J.; McKinnon, K.I.M.
Description: This paper describes ASYNPLEX, an asynchronous variant of the revised simplex method which is suitable for parallel implementation on a shared memory multiprocessor or MIMD computer with fast inter-processor communication. The method overlaps simplex iterations on different processors. Candidates to enter the basis are tentatively selected using reduced costs which may be out of date. Later, the up-to-date reduced costs of the tentative candidates are calculated and candidates are either discarded or accepted to enter the basis. The implementation of this algorithm on a Cray T3D is described and results demonstrating significant speed-up are presented
Homepage: http://www.maths.ed.ac.uk/hall/MS-95/MS-95-050b-abstract.html
Keywords: linear programming; revised simplex method; parallel implementation; Cray T3D
Related Software: PARSMI; DEVEX; HiGHS; ParISS; Benchmarks for Optimization Software; SoPlex; KORBX; SYNPLEX; SIMPAR; CLP; XPRESS; COIN-OR; CPLEX; Pannon Optimizer; Netlib; CUDA; MUMPS; SuperLU; SuperLU-DIST
Cited in: 8 Publications

Citations by Year