论文信息 - A VLSI Implementation of the Simplex Algorithm

A VLSI Implementation of the Simplex Algorithm

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.

Alan A. Bertossi | Maurizio A. Bonuccelli

[1] P. V. Remoortere. Linear and combinatorial programming : K.G. Murty: 1976,J. Wiley, New York, 310 pp , 1979 .

[2] S. N. Maheshwari,et al. Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees , 1983, IEEE Transactions on Computers.

[3] Fabrizio Luccio,et al. A VLSI tree machine for relational data bases , 1983, ISCA '83.

[4] Richard J. Lipton,et al. Linear Programming is Log-Space Hard for P , 1979, Inf. Process. Lett..

[5] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[6] Fabrizio Luccio,et al. VLSI Mesh of Trees for Data Base Processing , 1983, CAAP.

[7] Franco P. Preparata,et al. Area-Time Optimal VLSI Networks for Multiplying Matrices , 1980, Inf. Process. Lett..

[8] Lynn Conway,et al. Introduction to VLSI systems , 1978 .

[9] P.P.G. Kramer,et al. Systolic computation and VLSI , 1982 .

[10] H. T. Kung,et al. Systolic (VLSI) arrays for relational database operations , 1980, SIGMOD '80.

[11] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .