André DeHon
ABSTRACT
A Rent's Rule characterization of recursive bisection captures a measure of the locality in a netlist or graph. From this characterization, we know we can establish a lower bound on layout area implied by wiring. When applying this lower bound to the design of programmable or switched networks, we are ultimately concerned for both the switching requirements and the wiring requirements. Switch requirements are particularly important in conventional VLSI where (a) a switchpoint consumes considerably more area than a wire crossing and (b) switchpoints must reside on the active surface, whereas wiring may take place on any of several wire layers. The most straight-forward, limited-bisection switching networks have switching requirements which grow as $O(N^{2p})$, similar to wiring requirements. In practice, however, this leaves switching dominating wiring. We show that there are limited-bisection networks with $O(N)$ switching growth and highlight some of the tradeoffs between wire utilization and switching, routing complexity, routing guarantees, and switch latency within this design space.
- 1.V.Benes Permutation groups,complexes,and rearrangeable multistage connecting networks.Bell System Technical Journal ,43:1619-1640,July 1964.Google Scholar
Cross Ref
- 2.V.Benes Mathematical Theory of Connecting Networks and Telephone Tra .c .Academic Press,New York,NY,1965.Google Scholar
- 3.S.Bhatt and F.T.Leighton.Afamewokforsolving vlsi graph layout problems.Journal of Computer System Sciences ,28:300-343,1984.Google ScholarCross Ref
- 4.A.DeHon. Entropy,counting,and programmable interconnect.In Proceedings of the 1996 International Symposium on Field Programmable Gate Arrays . ACM/SIGDA,Feb uary 1996.See extended version <http://www.cs.caltech.edu/~andre/abstracts/ entropy fpga96.html . Google ScholarDigital Library
- 5.A.DeHon.Balancing interconnect and computation in a econ .gurable computing array (o ,why you don 't really want 100% lut utilization).In Proceedings of the International Symposium on Field Programmable Gate Arrays ,pages 69-78,Feb uary 1999. Google ScholarDigital Library
- 6.A.DeHon.Compact,multilaye layout for butter .y fat-tree.In Proceedings of the Twel fth ACM Symposium on Parallel Algorithms and Architectures (SPAA '2000),pages 206-215.ACM,July 2000. Google ScholarDigital Library
- 7.K.Fujiyoshi,Y.Kajitani,and H.Niitsu.Design of minimum and uniform bipartites fo optimum connection blocks of fpga.IEEE Transactions on Computer-Aided Design of Integrated Circuits , 16(11):1377-1383,November 1997. Google ScholarDigital Library
- 8.R.I.Greenberg and C.E.Leiserson.Randomness in Computation ,volume 5 of Advances in Computing Research ,chapte Randomized Routing on Fat-T ees. JAI Press,1988.Earlier version MIT/LCS/TM-307.Google Scholar
- 9.B.S.Landman and R .L.Russo.On pinvesus block relationship for partitions of logic circuits.IEEE Transactions on Computers ,20:1469-1479,1971.Google ScholarDigital Library
- 10.F.T.Leighton.New lowe bound techniques fo vlsi. In Twenty-Second Annual Symposium on the Foundations of Computer Science .IEEE,1981.Google Scholar
- 11.N.Pippenger.Superconcent ators.SIAM Journal of Computing ,6(2):298-304,1977.Google Scholar
- 12.C.Thompson.Area-time complexity for vlsi.In Proceedings of the El eventh Annual ACM Symposium on Theory of Computing ,pages 81-88,May 1979. Google ScholarDigital Library
- 13.Y.-L.Wu,D.Chang,M.Marek-Sadowska, and S.Tsukiyama.Not necessarily more switches more routability.In Proceedings of the 1996 Asia Paci .c Design Automation Conference ,1996.Google Scholar
- 14.Y.-L.Wu,S.Tsukiyama,and M.Marek-Sadowska. Graph based analysis of 2-d fpga outing.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ,15(1):33-44,January 1996. Google ScholarDigital Library
Index Terms
- Rent's rule based switching requirements
Recommendations
Rent's rule based FPGA packing for routability optimization
FPGA '14: Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arraysPacking is a critical step in the CAD flow for cluster-based FPGA architectures, and has a significant impact on the quality of the final placement and routing results. One basic quality metric is routability. Traditionally, minimizing cut (the number ...
On partitioning vs. placement rent properties
SLIP '01: Proceedings of the 2001 international workshop on System-level interconnect predictionRent's rule can be derived by direct partitioning of the circuit netlist, by indirect partitioning of the placed layout, or by averaging the number of terminals for various equally large regions of the placed circuit. It is shown that all three methods ...
Calibration of rent's rule models for three-dimensional integrated circuits
In this paper, we determine the accuracy of Rahman's interconnect prediction model for three-dimensional (3-D) integrated circuits. Utilizing this model, we calculate the wiring requirement for a set of benchmark standard-cell circuits. We then obtain ...
Comments