Please use this identifier to cite or link to this item: doi:10.22028/D291-26096
Title: The communication complexity of VLSI circuits
Author(s): Lengauer, Thomas
Language: English
Year of Publication: 1982
OPUS Source: Saarbrücken, 1983
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: Very Large Scale Integration (VLSI) is a quickly emerging discipline in Computer Science that also raises many theoretical questions. The concept of a VLSI computation is very much different from classical concepts of a (sequential) computation. A VLSI computation is performed by many switching elements {s.e.'s) that are laid out on the planar chip surface and connected among each other with wires. These s.e.'s can perform computations in parallel. The computation of any s.e. depends on data received over wires from other s.e.'s. Several measures of complexity are of interest in this context: The chip area A, i.e., the area of wires and s.e.'s, the computing time T and the switching energy E. Clearly there exist tradeoffs between A and T. In this paper we survey lower bounds on the combined complexity measure AT2. The lower bounds are proved by accounting for the amount of work necessary just to communicate intermediate results between s.e.'s. In many cases the lower bounds we get are {asymptotically) tight, giving evidence for the fact that communication cost dominates the complexity of many VLSI computations.
Link to this record: urn:nbn:de:bsz:291-scidok-40731
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1982/14
Date of registration: 3-Aug-2011
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1982_14.pdf8,34 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.