DocumentCode
2187065
Title
Census functions: An approach to VLSI upper bounds
Author
Lipton, Richard J. ; Valdes, Jacobo
fYear
1981
fDate
28-30 Oct. 1981
Firstpage
13
Lastpage
22
Abstract
A model of VLSI computation suitable for the description of algorithms at a high level is introduced. The model is basically a language to express parallel computations which can be efficiently implemented by a VLSI circuit. This language is used to describe area-time efficient algorithms for a few well known graph problems. The exact complexity of these algorithms and their relevance to recent work on the inherent limitations of VLSI computations are also presented.
Keywords
Circuits; Computational modeling; Concurrent computing; Jacobian matrices; Microprocessors; Processor scheduling; Scheduling algorithm; Systolic arrays; Upper bound; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1981. SFCS '81. 22nd Annual Symposium on
Conference_Location
Nashville, TN, USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1981.13
Filename
4568312
Link To Document