| A heuristic algorithm for the fanout problem |
| Full text |
Pdf
(652 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 27th ACM/IEEE Design Automation Conference
table of contents
Orlando, Florida, United States
Pages: 357 - 360
Year of Publication: 1991
ISBN:0-89791-363-9
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 8, Downloads (12 Months): 24, Citation Count: 28
|
|
|
ABSTRACT
We present an algorithm to optimally distribute a signal to its required destinations. The choice of the buffers and the topology of the distribution tree depends on the availability of different strength gates and on the load and the required times at the destinations. The general problem is to construct a fanout-tree for a signal so that the required time constraint at the source node is met and the fanout-tree has a minimum area. Since the area constrained fanout problem is NP-complete and area is not a major consideration in present high density designs, we restrict our attention to the simpler problem of designing fast fanout circuits without any area constraint. The proposed algorithm builds the fanout tree by partitioning the fanout signals into subsets and then recursively solving each sub-problem. At each stage the algorithm generates a fanout tree that is an improvement over the previous stage. This feature allows the user to specify the improvement desired by the fanout correction process. The performance of the algorithm, when run on randomly generated distributions of required times and on real design examples, is very promising.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
G. De Micheli. Performance-Oriented Synthesis of Large-Scale Domino CMOS Circuits. IEEE Transactions on CAD, CAD- 6(5): 751-765, 1987.
|
 |
3
|
|
| |
4
|
K. Keutzer and M. Vancura. Timing Cq3tlmization in a Logic Synthesis System. In G. Saucier, editor, ,Proceedings of International Workshop on Logic and Arch. Synthesis for Silicon Compil. ers, pages 1-13, Grenoble, France, May 1988. Inst. Nat. Polytechnique.
|
| |
5
|
E.L. Lawler. Combinatorial Optinu'zation: Networks and Matroids. Holt, Rinehart and Winston, 1976.
|
| |
6
|
P. G. Paulin and F. Poirot. Logic Decomposition Algorithms for the Timing Optimization of Multi-Level l~gic. In Proceedings of ICCD 89, pages 329-333, 1989.
|
| |
7
|
K. J. Singh, A. R. Wang, R. K. Brayton, and A. Sangiovanni- Vincentelli. Timing Optimization of Combinational Logic. In lCCAD-88, pages 282-285. IEEE, 1988.
|
CITED BY 29
|
|
Koichi Sato , Masamichi Kawarabayashi , Hideyuki Emura , Naotaka Maeda, Post-layout optimization for deep submicron design, Proceedings of the 33rd annual conference on Design automation, p.740-745, June 03-07, 1996, Las Vegas, Nevada, United States
|
|
|
|
|
|
|
|
|
Narendra V. Shenoy , Robert K. Brayton , Alberto L. Sangiovanni-Vincentelli, Resynthesis of multi-phase pipelines, Proceedings of the 30th international conference on Design automation, p.490-496, June 14-18, 1993, Dallas, Texas, United States
|
|
|
Maggie Kang , Wayne W.-M. Dai , Tom Dillinger , David LaPotin, Delay bounded buffered tree construction for timing driven floorplanning, Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, p.707-712, November 09-13, 1997, San Jose, California, United States
|
|
|
|
|
|
|
|
|
Juho Kim , Cyrus Bamji , Yanbin Jiang , Sachin Sapatnekar, Concurrent transistor sizing and buffer insertion by considering cost-delay tradeoffs, Proceedings of the 1997 international symposium on Physical design, p.130-135, April 14-16, 1997, Napa Valley, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
G. Saucier , D. Brasen , J. P. Hiol, Partitioning with cone structures, Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, p.236-239, November 07-11, 1993, Santa Clara, California, United States
|
|
|
P. Cocchini , M. Pedram , G. Piccinini , M. Zamboni, Fanout optimization under a submicron transistor-level delay model, Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, p.551-556, November 08-12, 1998, San Jose, California, United States
|
|
|
K. Kodandapani , J. Grodstein , A. Domic , H. Touati, A simple algorithm for fanout optimization using high-performance buffer libraries, Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, p.466-471, November 07-11, 1993, Santa Clara, California, United States
|
|
|
|
|
|
Lalgudi N. Kannan , Peter R. Suaris , Hong-Gee Fang, A methodology and algorithms for post-placement delay optimization, Proceedings of the 31st annual conference on Design automation, p.327-332, June 06-10, 1994, San Diego, California, United States
|
|
|
Kurt Keutzer , A. Richard Newton , Narendra Shenoy, The future of logic synthesis and physical design in deep-submicron process geometries, Proceedings of the 1997 international symposium on Physical design, p.218-224, April 14-16, 1997, Napa Valley, California, United States
|
|
|
|
|
|
Ko Yoshikawa , Hiroshi Ichiryu , Hisato Tanishita , Sigenobu Suzuki , Nobuyoshi Nomizu , Akira Kondoh, Timing optimization on mapped circuits, Proceedings of the 28th conference on ACM/IEEE design automation, p.112-117, June 17-22, 1991, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
Charles Alpert , Andrew B. Kahng , Bao Liu , Ion Măndoiu , Alexander Zelikovsky, Minimum-buffered routing of non-critical nets for slew rate and reliability control, Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, November 04-08, 2001, San Jose, California
|
|
|
|
|
|
|
|
|
Eric Lehman , Yosinori Watanabe , Joel Grodstein , Heather Harkness, Logic decomposition during technology mapping, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.264-271, November 05-09, 1995, San Jose, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|