Многокритериальный синтез топологии цифровых и аналоговых БИС на основе операторной модели свичбокса
Диссертация
На большом количестве примеров показаны возможности настройки программы на различные критерии оптимизации трассировки. В то же время сохраняется актуальность выяснения связи между критерием и размерами области трассировки. На алгебраическом уровне введено понятие Хпростейшей трассировки. Обоснован синтез топологии в классе X-простейших трассировок. Показаны возможности ухода от №-полноты задачи… Читать ещё >
Содержание
- ГЛАВА 1. МЕТОДЫ ФИЗИЧЕСКОГО ПРОЕКТИРОВАНИЯ БИС
- 1. 1. ДЕКОМПОЗИЦИЯ
- 1. 2. ПЛАНИРОВКА И РАЗМЕЩЕНИЕ
- 1. 3. ТРАССИРОВКА
- 1. 4. УПАКОВКА
- 1. 5. ЭКСТРАКЦИЯ И ВЕРИФИКАЦИЯ
- 1. 6. ПРОБЛЕМА СВИЧБОКСА И АЛГОРИТМЫ ЕЕ РЕШЕНИЯ
- 1. 6. 1. ОСТОРОЖНЫЙ ШАГ
- 1. 6. 2. ЖАДНЫЕ АЛГОРИТМЫ
- 1. 6. 3. ИСПРАВЛЕНИЕ И ПОВТОРНАЯ ТРАССИРОВКА
- 1. 6. 4. ЛОКАЛЬНЫЕ ПРЕОБРАЗОВАНИЯ
- 1. 6. 5. МЕТОД РАЗРЕЗАНИЯ И ПЕРЕТРАССИРОВКИ
- 1. 6. 6. ТЕХНИКА ВЫЧИСЛИТЕЛЬНОЙ ГЕОМЕТРИИ
- 1. 6. 7. ДРУГИЕ ТРАССИРОВЩИКИ СВИЧБОКСА
- 2. 1. ПОСТАНОВКА ЗАДАЧИ
- 2. 2. ПРЕДЛАГАЕМЫЙ ПОДХОД
- 2. 2. 1. КЛАСС ТОПОЛОГИЧЕСКИХ ТРАССИРОВОК
- 2. 2. 2. МНОГОУРОВНЕВАЯ МОДЕЛЬ ТРАССИРОВКИ СВИЧБОКСА
- 2. 2. 3. КРИТЕРИИ ПРОЕКТИРОВАНИЯ
- 3. 1. ПОСТАНОВКА ЗАДАЧИ
- 3. 2. ОПЕРАТОРНАЯ МОДЕЛ
- 3. 3. ТОПОЛОГИЧЕСКАЯ МОДЕЛ
- 3. 4. ГЕОМЕТРИЧЕСКАЯ МОДЕЛЬ. ВЛОЖЕНИЕ В
- 3. 5. ОБСУЖДЕНИЕ МНОГОУРОВНЕВОЙ МОДЕЛИ
- 3. 5. 1. МЕРА ПРОСТОТЫ МОДЕЛИ
- 3. 5. 2. ГРУППИРОВКА ПАР
- 3. 5. 3. ПРАВИЛА УКЛАДКИ
- 3. 5. 4. ТРАССИРОВКА КРИТИЧЕСКИХ ЦЕПЕЙ
- 3. 5. 5. ОЦЕНКА СЛОЖНОСТИ ОПЕРАТОРНОГО МЕТОДА ТРАССИРОВКИ СВИЧБОКСА
- 4. 1. ОПИСАНИЕ ВХОДНЫХ ДАННЫХ
- 4. 2. РАБОТА С ГРАФИЧЕСКОЙ МОДЕЛЬЮ РЕШЕНИЯ
- 4. 3. НАСТРОЙКИ И ПРЕДПОЧТЕНИЯ
- 4. 4. КОМПИЛЯЦИЯ РЕШЕНИЯ
- 4. 5. СЧИТЫВАНИЕ ИНФОРМАЦИИ О СВИЧБОКСЕ
- 4. 6. ПОСТРОЕНИЕ ВСЕХ ПАР
- 4. 7. ОБЩАЯ ИНИЦИАЛИЗАЦИЯ МОДЕЛИ
- 4. 8. ОПЕРАТОРНАЯ ИНИЦИАЛИЗАЦИЯ МОДЕЛИ
- 4. 9. ПОСТРОЕНИЕ ОПЕРАТОРОВ
- 4. 10. РАЗМЕЩЕНИЕ ОПЕРАТОРА В ПРОСТРАНСТВЕ СВИЧБОКСА
- 5. 1. ПРИМЕР ДЕЙЧА
- 5. 2. УСЛОЖНЕННЫЙ ПРИМЕР ДЕЙЧА
- 5. 3. ПЕДАГОГИЧЕСКИЙ ПРИМЕР
- 5. 4. ПРИМЕР С ЕДИНСТВЕННЫМ РЕШЕНИЕМ
- 5. 5. ПЛОТНЫЙ ПРИМЕР
- 5. 6. ТРУДНЫЙ ПРИМЕР
- 5. 7. ВЫВОДЫ
Список литературы
- AJK82. K. J. Antreich, F. M. Johannes, F. H. Kirsch. A new aproach for solving the placement problem using force models. Proceedings of the IEEE International Symposium on Circuits and Systems, pages 481−486, 1982.
- Ake81. S. B. Akers. On the use of the linear assignment algorithm in module placement. Proceedings of 18th ACM/IEEE Design Automation Conference, pages 137−144, 1981.
- AK90. J. Apte, G. Kedam. Heuristic algorithms for combinedstandard cell and macro block layouts. Proceedings of the 6th MIT. Conference on Advanced Research in VLSI, pages 367−385, 1990.
- ARML99. Arindam Mukherjee, Ranganathan Sudhakar, Malgorzata Marek-Sadowska, Stephen I. Long, Wave Steering in YADDs: A Novel Non-Iterative Synthesis and Layout Technique, 36th Design Automation Conference, New Orleans, LA, June 21−25, 1999, p. 466
- BP83. M. Burstein, R. Pelavin. Hierarchical wire routing. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems CAD-2 (4) (October 1983). 223−234.
- Bia89. J.Bianks. Partitioning by probability condensation.
- Proceeding of Design Automation Conference, pages 758 761, 1989.
- BJ86. P. Bannerjee, M. Jones. A parallel simulated annealing algorithm for standard cell placement on a hypercube computer. Proceedings of the IEEE International Conference on Computer Design, page 34,1986.
- H. N. Brady. An approach to topological pin assignment. IEEE Transactions on Computer-Aided Design, CAD-3: 250−255, July 1984.
- M. A. Breuer. A class of min-cut placement algorithms. Proceedings Design Automation Conference, pages 284−290, 1977.
- G. Chartrand and Lesniak. Graphs and Digraphs. Wadsworth and Brooks/Cole Inc., Monterey, 1986.- ID /
- C.Cheng, E.Kuh. Module placement based of resistive network optimization. IEEE Transactions on Computer-Aided Design, CAD-3:218−225, July 1984.
- H. M. Chan, P. Mazumber. A genetic placement for macro cell placement. Technical report, Department jf Electrical Engineering and Computer Science, University of Michigan, 1989.
- E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematic, 1:269−271,1959. H.N.Djidjev. On the problem ofpartitioning planar graphs. SIAM Journal on Algebraic and Discrete Methods, 3(2):229−240, 1982.
- W. E. Donath, R. J. Norman, В. K. Agrawal, S. E. Bello Sang Yong Han, J. M. Kurtzberg, P. Lowy, R. I. McMillan. Timing driven placement using complete path delays. Procee dings of 27th ACM/IEEE Design Automation Conference, pages 84−89, 1990.
- W. A. Dees, P. G. Karger. Automated rip-up and reroute techniques. Proceeding of Design Automation Conference, 1982.
- Edward М. Reingold, Jurg Nivevergelt, Narsingh Deo,
- Combinatorial algorithms. Theory and practice. Prentice
- Hall, Inc., Englewood Cliffs, New Jersey 1977.
- A. E. Dunlop et. al. Chip layout optimization using criticalpath weighting. Proceedings of 21st ACM/IEEE Design
- Automation Conference, pages 133−136,1984.
- Y. Ogawa et. al. Efficient placement algorithms optimizingdelay for high-speed eel masterslice Isi’s. Proceedings of23rd АСМЛЕЕЕ Design Automation Conference, pages 404 410,1986.
- W. E. Donath et. al. Timing driven placement using complete path delays. Proceedings of 27th ACM/IEEE Design Automation Conference, pages 84−89,1990.- юи
- B. Eschermann. Hierarchical placement for macrocells with simultaneous routing area allocation. Technical Report Mem. UCB/ERL M88/49, Univ. Calif., Berkeley, 1988. I.R.Ford, D.R.Fulkerson. Flows in Networks. Princeton University Press, 1962.
- J.Frankle, M.R.Karpp. Circuit placement and cost boundb by eigenvector decomposition. Proceeding of IEEE International Conference on Computer-Aided Design, pages 414−417,1986.
- C.M. Fiduccia, R.M. Mattheyses. A linear-time heuristics for improving network partitions. Proceedings of the 19th Design Automation Conference, pages 175−181,1982.
- C. Fowler, G. D. Hachtel, 1. Roybal. New algorithms for hierarchical place and route of custom vlsi. Proceeding of International IEEE Conference on Computer-Aided Design, pages 273−275, 1985.
- H. J.Groeger. A new approach to structural partitioning of computer logic. Proceeding of Design Automation Conference, pages 378−383,1975.
- GCW83. I. G. Gopal, D. Coppersmith, C. K. Wong. Optimal wiring of movable terminals. IEEE Transactions on Computers, C-32: 845−858, September 1983.
- GJ77. M. R. Garey, D. S. Johnson. The rectilinear steiner treeproblem is np-complete. SI AM Jornal Applied Mathematics 32:826−834, 1977.
- H82. C.P. Hsu. A new two-dimensional routing algorithm. Proc. 19th Design Automation Conference. 1982. 46−50.
- HC85. Y. I. Hsich, C.C. Chang. A modified detour router. Proc. Int. Conf. Computer-Aided Design. 1985. 301−303.
- HVW85. J. M. Ho, G. Vijayan and C. K. Wong. A new approach to the rectilinear steiner tree problem. IEEE Transactions on Computer-Aided Design, 9(2): 185−193, February 1985.
- Han76. M. Hanan. On steiner’s problem with rectilinear distance.
- SIAM Journal of Applied Mathematics, 30(1): 104−114. January 1976.
- HVW89. J. M. Ho, G. Vijayan and C. K. Wong. Constructing the optimal rectilinear steiner tree derivable from a minimum spanning tree. Proceedings of IEEE International Conference on Computer-Aided Design, pp. 5−8, November 1989.
- Hwa76a. F. K. Hwang. An o (nlogn) algorithm for rectilinear steiner trees. Journal of the Association for Computing Machinery, 26(1):177−182, April 1976.
- Hwa76b. F. K. Hwang. On Steiner minimal trees with rectilineardistance. SIAM Jornal of Applied Mathematics, 30(1): 104 114, January 1976.
- Hwa79. F. K. Hwang. An o (nlogn) algorithm for suboptimal rectilinear steiner trees. Transactions on Circuits and Systems, 26(1): 75−77, January 1979.
- Hal70. K.M.Hall. An r-dimensional quadratic placement algorithm. Management Science, 17:219−229, November 1970.
- Hit70. R.B.Hitchcock. Partitioning of logic graphs: A theoretical analysis of pin reduction. Proceeding of Design Automation Conference, pages 54−63,1970.
- Haj88. B. Hajek. Cooling schedules for optimal annealing. Oper. Res. pages 311−329, May 1988.
- HRSV86. M. D. Huang, F. Romeo, A. Sangiovanni-Vincentelli. Anefficient general cooling schedules for simulated annealing. Proceedings of the IEEE International Conference on Computer-Aided Design, pages 381−384,1986.
- HK72. M. Hanan, J. M. Kurtzberg. A review of placement andquadratic assignment problems. SIAMRev., 14(2): 324−342, April 1972.
- HWA78. M. Hanan, P. K. Wolff, B. J. Agule. Some experimentalresults on placement techniques. J. Design Automation and Fault-Tolerant Computing, 2: 145−168, May 1978.
- HNY87. P. S. Hange, R Nair, E. J. Yoffa. Circuit placement for predictable performance. Proceeding of International Conference on Computer-Aided Design, pages 88−91,1987.
- Had75. F. Hadlock. Finding a maximum cut of a planar graph inpolynomial time. SIAM Journal of Computing, 4, no.3:221−225, September 1975.
- Hig69. D. W. Hightower. A solution to the line router problem on ait. continous plane. Proc. 6 Design Automation Workshop, 1969.
- HAY99. Hsiao-Pin Su, Allen C.-H. Wu, Youn-Long Lin 16.1 A Timing-Driven Soft-Marco Resynthesis Method in Interaction with Chip Floorplanning. 36 Design- iut
- Automation Conference, New Orleans, LA, June 21−25, 1999, p. 262
- S.Kirkpatrick, C.D.Gellat, M.R.Vecchi. Optimization by simulated annealing. Science, 220:671−680, May 1983.- iOJ
- W.Kernigan, S.Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49:391 307, 1970.
- C.Kring, A.R.Newton. A cell-replicating approach to minicut-based circuit partitioning. Proceeding of IEEE International Conference on Computer Design, pages 122 125, November 1983.
- B. Krishnamurthy. An improved mincut algorithm for partitioning vlsi networks. IEEE Transactions on Computers, pages 438−446,1984.
- D. T. Lee, J. M. Smith and J. S. Liebman. An o (nlogn) heuristic algorithm rectilinear steiner tree problem. Engineering Optimization, Vol. 4(4): 179−182, 1980.
- E.L.Lawler, K.N.Levitt, J. Turner Module clustering to minimaze delay in digital networks. IEEE Transactions on Computers, C-18(l):47−57, January 1969.
- R. J. Lipton, R.E.Tarjan. A separator theorem for planar graphs. SIAM Journal of Applied Mathematics, 36(2): 177 189, 1979.
- J. Lam, J. Delosme. Performance of a New Annealing Schedule. Proceedings of the 25 Design Automation Conference, pages 306−311, 1988.
- B. Lokanathan, E. Kinnen. Performance optimized floor planning by graph planarization. Proceedings of 26 ACM/IEEE Design Automation Conference, pages 116−121, 1989.
- A. Leblond. Caf: A computer-assisted floorplanning tool. Proceedings of the 20th Design Automation Conference, pages 747−753, 1983.
- C. Y. Lee. An algorithm for path connections and its applications. ERE Transactions on Electronic Computers, 1961.
- F.F. Moore. The shortest path through a maze. Annals of the Harvard Computation Laboratory. Vol.30. Pt. ll (Harvard Univ. Press. Cambridge. MA. 1959) 185−192.
- D.P.Mehta. L-shaped corner switching data structures. Proceedings of the Fourth Great Lakes Symposium on VLSI, pages 34−37, March 1994.
- MBSV91. R. Murgai, R.K.Brayton, A. Sangiovanni- Vincentelli. On clustering for minimum delay/area. Proceeding of IEEE International Conference on Computer-Aided Design, pages 6−9, November 1991.
- Mil84. G.L.Miller. Finding small simple cycle separator for 2-connected planar graph. Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pages 376 382,1984.
- McF83. M.C.McFarlald. Computer-Aided partitioning of behavioral hardware description. Proceeding of Design Automation Conference, pages 472−478,1983.
- McF86. M.C.McFarlald. Using bottom-up design techniques in the synthesis of digital hardware from abstract behavioral description. Proceedings of the 23rd Design Automation Conference, pages 474−480,1986.
- MRR53. N. Metropolis, A. Rosenbluth, M.Rosenbluth. Equation of state calculations by fast computing machines. Journal of Chemistry and Physics, pages 1087−1092, 1953.
- MSL89. M. Marek-Sadowska, S. P. Lin. Timing driven placement.
- Proceeding of International Conference on Computer-Aided Design, pages 94−97,1989.
- MR78. L. Mory-Rauch. Pin assignment on a printed circuit board.
- Proceedings of the 15th Design Automation Conference, pages 70−73,1978.
- MTDL90. K. McCullen, J. Thorvaldson, D. Demaris, P. Lampin. A system for floorplanning with hierarchical placement and routing. Proceedings of European Design Automation Conference, pages 262−265,1990.- IUO
- S. Mohan, P. Mozumbar. Wolverines: Standard cell placement on a network of workstations. IEEE Transactions on CAD of Integrated Circuits and Systems, 12: 1312−1326, September 1993.
- K. Mikami, K. Tabuchi. A computer program for optimal routing of printed circuit connectors. IFIPS Proc., H47:1475−1478, 1968.
- J. Ousterhoust. Corner stitching: A data-structuring technique for vlsi layout tools. IEEE Transactions on Computer-Aided Design, CAD-3, January 1984. T. Ohtsuki. Partitioning, Assignment and Placement. North-Holland, 1986.
- C. H. Paradimitriou and K. Steigliz. Combinatorial Optimization Algorithms and Complexity. Prentice-Hall, Inc., 1982.
- F. Preparata and M. I. Shamos. Computational Geometry. An Introductoin. Springer- Verlag, 1985.
- R. Putatunda, D. Smith, M. Stebinsky, C. Pushak, P. Patent. Vital: Fully automatic placement strategies for very large semicustom designs. International Conference on Computer Design, pages 434−439,1988.
- PMSK90. M. Pedram, M. Marek-Sadowska, E. S. Kuh. Floorplanning with pin assignment. Proceeding of International Conference on Computer-Aided Design, pages 98−101,1990. Pat81] A. M. Patel. Partitioning for vlsi placement problem.
- Proceedings of 18th ACM/IEEE Design Automation Conference, pages 137−144,1981. PCT99. Pei-Ning Guo, Chung-Kuan Cheng, Takeshi Yoshimura, An
- O-Tree Representation of Non-Slicing Floorplan and Itsit.
- Custom Integrated Circuits. 1987. 629−632. RF83. R.L. Rivest, C.M. Fiduccia. A greedy channel router.
- RVS84. F. Romeo, A.S.Vincentelli, C.Sechen. Research on simulated annealing at berekeley. Proceeding of IEEE International Conference on Computer Design, pages 652−657,1984.
- F. Romeo, A. Sangiovanni-Vincentelli. Convergence and finite time behavior of simulated annealing. Proceedings of the 24 Conference on Decision and Control, pages 761 -767, 1985.
- Щемелинин B.M. Метод трассировки сложных схем. Известия вузов. ЭЛЕКТРОНИКА. № 1, 1997, с.66−72 Щемелинин В. М. Методы автоматического синтеза топологии заказных БИС. Докторская диссертация, Москва, МИЭТ, 1991
- J.R. Stenstrom, R.M. Matteyses. Switch box routing the greedy way. Proc. Int. Conf. Computer-Aided Design. 1985. 307−309.
- H. Shin, A. Sangiovanni-Vincentelli. Mighty: a rip-up and reroute detailed router. Proc. Int. Conf. Computer-Aided Design. 1986. 2−5.
- C. Sechen, A. Sangiovanni-Vincentelli. The timber wolf placement and routing package. IEEE Journal of Solid-State Circuits, Sc-20:510−522,1985.
- K. Shahoobar, P. Mazumber. A genetic approach to standard cell placement. Proceedings of First European Design Automation Conference, March 1990.
- К. Shahoobar, P. Mazumber. A genetic approach to standard cell placement using meta-genetic parameter optimization. IEEE Trans. Computer-Aided Design, pages 500−511, May1990.
- S. Sutanthavibul, E. Shragowitz, J. Rosen. An analytical approach to floorplan design and optimization. IEEE Transactions on Computer-Aided Design, 10:761−769, June1991.
- S. Sutanthavibul, E. Shargowitz, R. Lin. An adaptive timing driven placement for high performance vlsi’s. IEEE Transactions on CAD of Integrated Circuits and Systems, 12: 1488−1498, October 1993. tii
- J. Soukup. Fast maze router. Proceedings of 15 Design Automation Conference, pages 100−102, 1978. T. G. Szymanski. Dogleg channel routing is np-complete. IEEE Transactions on Computer-Aided Design, CAD-4: 3141, January 1985.
- M. Upton, K. Samii, S. Sugiyama. Integrated placement for mixed macro cell and standard cell designs. Proceedings of 27th ACM/IEEE Design Automation Conference, pages 3235,1990.
- T. Wang, D. Wong. An optimal algorithm for floorplan area optimization. Proceedings of 27th ACM/IEEE Design Automation Conference, pages 180−186,1990.-¼—
- J. Yih, P.Mazumder. A neural network design for circuit partitioning. IEEE Transactions on Computer-Aided Design, pages 1265−1271,1990.
- Утверждаю" кто^ ООО «Ангстрем РТМ"1. А. С. Бутов 1999 г.1. АКТо внедрении результатов диссертационной работы А. А. Данилина «Многокритериальный синтез топологии цифровых и аналоговых БИС на основе операторноймодели свичбокса»
- Зав. кафедрой ПКИМС профессор, д.т.н.
- Декан ЭКТ факультета профессор, д.т.н.
- Уч.секретарь кафедры ПКИМС доцент, к.т.н. }1. Н. Целибеева