
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A.A. Bertossi, M.A. Bonuccelli, "A Gracefully Degradable VLSI System for Linear Programming," IEEE Transactions on Computers, vol. 38, no. 6, pp. 853861, June, 1989.  
BibTex  x  
@article{ 10.1109/12.24294, author = {A.A. Bertossi and M.A. Bonuccelli}, title = {A Gracefully Degradable VLSI System for Linear Programming}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {6}, issn = {00189340}, year = {1989}, pages = {853861}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.24294}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Gracefully Degradable VLSI System for Linear Programming IS  6 SN  00189340 SP853 EP861 EPD  853861 A1  A.A. Bertossi, A1  M.A. Bonuccelli, PY  1989 KW  gracefully degradable; faulttolerant VLSI system; linear programming problems; multiple faults; interconnection pattern; complete binary tree; cousin nodes; ternary tree; faulty processing elements; simplex algorithm; computational complexity; fault tolerant computing; linear programming; VLSI. VL  38 JA  IEEE Transactions on Computers ER   
[1] I. Adler and R. Saigal, Eds., "Special Issue on Probabilistic Analysis of Simplex and Related Methods,"Math. Programming, vol. 35, June 1986.
[2] J. M. Atallah and S. R. Kosaraju, "A generalized dictionary machine for VLSI,"IEEE Trans. Comput., vol. C34, pp. 151155, Feb. 1985.
[3] A. A. Bertossi and M. A. Bonuccelli, "A VLSI implementation of the simplex algorithm,"IEEE Trans. Comput., vol. C36, pp. 241247, Feb. 1987.
[4] G. Bilardi and F. P. Preparata, "A minimum area VLSI network forO(logn) time sorting,"IEEE Trans. Comput., vol. C34, no. 4, Apr. 1985.
[5] M. A. Bonncelliet al., "A VLSI tree machine for relational data bases," inProc. 10th Annu. Symp. Comput. Architecture, June 1983, pp. 6773.
[6] R. P. Brent and H. T. Kung, "On the area of binary tree layouts,"Inform. Proc. Lett., vol. 11, pp. 4446, Jan. 1980.
[7] J. A. B. Fortes and C. S. Raghavendra, "Gracefully degradable processor arrays,"IEEE Trans. Comput., vol. C34, pp. 10331044, Nov. 1985.
[8] J. W. Greene and A. El Gamal, "Configuration of VLSI arrays in the presence of defects,"J. ACM, vol. 31, no. 4, pp. 694717, 1984.
[9] B. O. A. Grey, A. Avizienis, and D. A. Rennels, "A faulttolerant architecture for network storage systems," inProc. 14th FTCS Conf., 1984, pp. 232239.
[10] A. S. M. Hassan and V. K. Agarwal, "A fault tolerant modular architecture for binary trees,"IEEE Trans. Comput., vol. C35, no. 4, pp. 356361, Apr. 1986.
[11] D. K. Hsiao, "Database computers," inAdvances in Computers, Vol. 19, M. C. Yovits, Ed. New York: Academic, 1982.
[12] F. T. Leighton and C. E. Leiserson, "Waferscale integration of systolic arrays,"IEEE Trans. Comput., vol. C34, pp. 448461, May 1985.
[13] R. Negrini, M. Sami, and Stefanelli, "Fault tolerance techniques for array structures used in supercomputing,"IEEE Comput. Mag., pp. 7887, Feb. 1986.
[14] T. A. Ottman, A. L. Rosenberg, and L. J. Stockmeyer, "A dictionary machine (for VLSI),"IEEE Trans. Comput., vol. C31, pp. 892 898, Sept. 1982.
[15] C. H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: PrenticeHall, 1982.
[16] F. P. Preparata and J. Vuillemin, "Areatime optimal VLSI networks for multiplying matrices,"Inform. Proc. Lett., vol. 11, pp. 7780, Oct. 1980.
[17] F. P. Preparata and J. Vuillemin, "Areatime optimal VLSI networks for computing integer multiplication and discrete Fourier transform," inProc. ICALP Conf., Haifa, Israel, 1981, pp. 3940.
[18] C. S. Raghavendra, A. Avizienis, and M. Ercegovac, "Faulttolerance in binary tree architectures,"IEEE Trans. Comput., vol. C33, pp. 568572, June 1984.
[19] A. L. Rosenberg, "The Diogenes approach to testable faulttolerant arrays of processors,"IEEE Trans. Comput., vol. C32, pp. 902 910, Oct. 1983.
[20] A. L. Rosenberg, "A hypergraph model for faulttolerant VLSI processor arrays,"IEEE Trans. Comput., vol. C34, pp. 578584, June 1985.
[21] A. K. Somani and V. K. Agarwal, "An efficient unsorted VLSI dictionary machine,"IEEE Trans. Comput., vol. C34, pp. 841852, Sept. 1985.
[22] C. D. Thompson, "The VLSI complexity of sorting,"IEEE Trans. Comput., vol. C32, pp. 11711184, Dec. 1983.
[23] J. D. Ullman,Computational Aspects of VLSI. Rockville, MD: Computer Science Press, 1984.
[24] P. J. Varman and D. S. Fussell, "Realizing faulttolerant binary trees in VLSI," inProc. 12th Allerton Conf. Commun., Comput., Contr., 1982, pp. 10081017.
[25] P. J. Varman, I. V. Ramakrishnan, and D. S. Fussell, "A robust matrixmultiplication array,"IEEE Trans. Comput., vol. C33, pp. 919922, Oct. 1984.