VLSI f-models which allow the switching time to decrease to f(D) when the length of all wires is restricted by D are called `fast' if the decrease is slightly superlinear. The fast models are so strong and robust that their computational power cannot be increased by and combination of the following: (1) making zero the width of each wire of length d, except for its log d segment, thus eliminating layout and area considerations; (2) allowing wires to transmit log d bits simultaneously; (3) making the switching time f(d) of each node depend only on the length d of its own input wires, thus enabling small subcircuits to run faster; (4) changing f while preserving Σk 1/f(k); (5) enabling the nodes to change connections arbitrarily in the run time. The authors construct a kind of operating system link server (linx, for short) that simulates all these powers online. The condition of superlinearity cannot be weakened
Published in:
Foundations of Computer Science, 1989., 30th Annual Symposium on
Date of Conference:
30 Oct-1 Nov 1989
- Page(s):
-
402
-
407
- Meeting Date :
-
30 Oct 1989-01 Nov 1989
- Print ISBN:
-
0-8186-1982-1
- INSPEC Accession Number:
-
3730939
- Conference Location :
-
Research Triangle Park, NC
- Digital Object Identifier :
-
10.1109/SFCS.1989.63510
- Product Type:
-
Conference Publications