DocumentCode :
3143958
Title :
Toward VLSI Complexity : The DA Algorithm Scaling Problem : Can Special DA Hardware Help?
Author :
Adshead, H.G.
Author_Institution :
ICL Manchester, UK
fYear :
1982
fDate :
14-16 June 1982
Firstpage :
339
Lastpage :
344
Abstract :
With the increasing scale of integration we need to employ DA algorithms to assist us in managing the complexities involved. Many of our current techniques are already costly and slow and yet scale by some power law as the gate count increases. An analysis of the strategies open to us leads to the possibility that in many cases specialised DA hardware is cost effective. This paper then describes a series of trials to employ a 64 x 64 distributed array processor at DA tasks. Some unexpected results were obtained as algorithms evolved in the area of tracking, simulation, placement, test generation, fault simulation, and layout rule checking. The paper concludes with a discussion of the overheads incurred in employing unconventional hardware.
Keywords :
Capacitance; Circuit faults; Circuit testing; Cost function; Hardware; Partitioning algorithms; Routing; Very large scale integration; Wires; Wiring;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation, 1982. 19th Conference on
Conference_Location :
Las Vegas, NV, USA
ISSN :
0146-7123
Print_ISBN :
0-89791-020-6
Type :
conf
DOI :
10.1109/DAC.1982.1585521
Filename :
1585521
Link To Document :
بازگشت