Abstract:
1.1. Parallel Processing for CAD As the sizes of VLSI circuits increases in the future, the computational requirements for performing various computer-aided design (CAD) tasks such as simulation, design-rule checking, circuit extraction, cell placement and wire routing will increase tremendously. There will be an increasing
Citations
|
187
|
Optimization and approximation in deterministic sequencing and scheduling: A survey
– Graham, Lawler, et al.
- 1979
|
|
35
|
Placement by simulated annealing on a multiprocessor
– Kravitz, Rutenbar
- 1987
|
|
14
|
A survey of hardware accelerators used in computer-aided design
– Blank
- 1984
|
|
5
|
Hypercube and ShuffleExchange Algorithms for Image Component Labeling
– Cypher, Sanz, et al.
- 1989
|
|
4
|
Mask Verification on the Connection Machine
– Carlson, Rutenbar
- 1988
|
|
1
|
Cleemput, "Automated partitioning of hierarchically specified digital systems
– Payne, Van
- 1982
|
|
1
|
Algorithm 2
– General
|
|
1
|
Study : Circuit Extraction
– Case
|
|
1
|
based (a) Slice Partitioning (b) Rectangular Partitioning
– Area
|
|
1
|
based (a) Slice Partitioning (b) Rectangular Partitioning
– Point
|
|
1
|
HPEX model) with rectangular partitioning (area versus point
– PACE
|
|
1
|
HPEX model) with point based partitioning (slice versus rectangular
– PACE
|
|
1
|
P=G (i , j ) in an x axis communication with Q
– Proc
|
|
1
|
i ,0) communicating with O=G (r ,0), Q=G (s ,0) for the k th stage
– PG
|
|
1
|
i , j ) in a x axis communication with O=G (r
– PG
|
|
1
|
2 of the decompose algorithm
– Step
|
|
1
|
code mapping
– Gray
|
|
1
|
curve used in the implementation
– Speedup
|
|
1
|
of time for sequential and parallel hierarchical extraction
– Breakup
|
|
