A VLSI Implementation of the Simplex Algorithm
- 1 February 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (2) , 241-247
- https://doi.org/10.1109/TC.1987.1676889
Abstract
The use of a special-purpose VLSI chip for solving a linear programming problem is presented. The chip is structured as a mesh of trees and is designed to implement the well-known simplex algorithm. A high degree of parallelism is introduced in each pivot step, which can be carried out in O (log n) time using an m × n mesh of trees having an O(mn log m log3 n) area where m − 1 and n − 1 are the number of constraints and variables, respectively. Two variants of the simplex algorithm are also considered: the two-phase method and the revised one. The proposed chip is intended as being a possible basic block for a VLSI operations research machine.Keywords
This publication has 8 references indexed in Scilit:
- A new polynomial-time algorithm for linear programmingPublished by Association for Computing Machinery (ACM) ,1984
- Efficient VLSI Networks for Parallel Processing Based on Orthogonal TreesIEEE Transactions on Computers, 1983
- VLSI mesh of trees for data base processingPublished by Springer Nature ,1983
- A VLSI tree machine for relational data basesPublished by Association for Computing Machinery (ACM) ,1983
- New lower bound techniques for VLSIPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Area-time optimal VLSI networks for multiplying matricesInformation Processing Letters, 1980
- Systolic (VLSI) arrays for relational database operationsPublished by Association for Computing Machinery (ACM) ,1980
- Linear programming is log-space hard for PInformation Processing Letters, 1979