Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Introduction to VLSI Systems
Systolic (VLSI) arrays for relational database operations
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
VLSI Mesh of Trees for Data Base Processing
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
A VLSI tree machine for relational data bases
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
A new polynomial-time algorithm for linear programming
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
IEEE Transactions on Computers
New lower bound techniques for VLSI
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
A Gracefully Degradable VLSI System for Linear Programming
IEEE Transactions on Computers
| Hi-index | 14.98 |
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.