164
click to vote
DAC
15 years 10 months ago
1989 ACM 
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
152
Voted
DAC
15 years 10 months ago
1989 ACM 
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
172
click to vote
DAC
15 years 10 months ago
1989 ACM 
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
170
click to vote
DAC
15 years 9 months ago
1989 ACM
We present an accurate and efficient method for extraction of parasitic capacitances in submicron integrated circuits. The method uses a 3-D finite element model in which the cond...
|
Computer Architecture