Muhammet Mustafa Ozdal
Abstract
The increasing clock frequencies in high-end industrial circuits bring new routing challenges that cannot be handled by traditional algorithms. An important design automation problem for high-speed boards today is routing nets within tight minimum and maximum length bounds. In this article, we propose an algorithm for routing bus structures between components on two layers such that all length constraints are satisfied. This algorithm handles length extension simultaneously during the actual routing process so that maximum resource utilization is achieved during length extension. Our approach here is to process one track at a time, and choose the best subset of nets to be routed on each track. The algorithm we propose for single-track routing is guaranteed to find the optimal subset of nets together with the optimal solution with length extension on one track. The experimental comparison with a recently proposed technique shows the effectiveness of this algorithm both in terms of solution quality and run-time.
- Betz, V. and Rose, J. 1997. VPr: A new packing, placement and routing tool for FPGA research. In Proceedings of the 7th International Workshop on Field-Programmable Logic. 213--222. Google Scholar
Digital Library
- Blazewicz, J., Ecker, K. H., and Pesch, E. 2001. Scheduling Computer and Manufacturing Processes. Springer-Verlog, New York. Google Scholar
- Boese, K. D., Cong, J., Kahng, A. B., Leung, K. S., and Zhou, D. 1992. On highspeed VLSI interconnects: Analysis and design. In Proceedings of the Asia--Pacific Conference Circuits and Systems.Google Scholar
- Burstein, M. and Pelavin, R. 1983. Hierarchical channel router. In Proceedings of the IEEE/ACM 20th Design Automation Conference. ACM, New York, 591--597. Google Scholar
- Cong, J., Kahng, A. B., Koh, C.-K., and Tsao, C.-W. A. 1998. Bounded-skew clock and steiner routing. ACM Trans. Des. Automat. Electron. Syst. 3, 3, 341--388. Google ScholarDigital Library
- Cong, J., Kahng, A. B., Robins, G., Sarrafzadeh, M., and Wong, C. K. 1992. Provably good performance-driven global routing. IEEE Trans. Computer-Aided Des. Integ. Circ. Syst. 11, 6, 739--752.Google ScholarCross Ref
- Cormen, T. H., Leiserson, C. E., and Rivest, R. L. 1992. Introduction to Algorithms. MIT Press, Cambridge, MA. Google Scholar
- Dunlop, A. E., Agrawal, V. D., Deutsch, D. N., Jukl, M. F., Kozak, P., and Wiesel, M. 1984. Chip layout optimization using critical path weighting. In Proceedings of the Design Automation Conference. 133--136. Google Scholar
- Ebeling, C., McMurchie, L., Hauck, S. A., and Burns, S. 1995. Placement and routing tools for the triptych FPGA. IEEE Trans. VLSI, 473--482. Google Scholar
- Fang, S. C., Feng, W. S., and Lee, S. L. 1992. A new efficient approach to multilayer channel routing problem. In Proceedings of the 29th ACM/IEEE Design Automation Conference, ACM, New York, 579--584. Google Scholar
- Hashimoto, A. and Stevens, J. 1971. Wire routing by optimizing channel assignment within large apertures. In Proceedings of the of 8th IEEE Design Automation Workshop. IEEE Computer Society Press, Los Alamitos, CA. 214--224. Google Scholar
- Huang, D. J.-H., Kahng, A. B., and Tsao, C.-W. A. 1995. On the bounded-skew clock and steiner routing problems. In Proceedings of the 32nd ACM/IEEE Design Automation Conference, ACM, New York, 508--513. Google Scholar
- Kahng, A. B. and Robins, G. 1995. On Optimal Interconnections in VLSI. Kluwer Academic Publishers.Google Scholar
- Kuh, E., Jackson, M. A. B., and Marek-Sadowska, M. 1987. Timing-driven routing for building block layout. In Proceedings of the IEEE International Symposium on Circuits and Systems, IEEE Computer Society Press, Los Alamitos, CA. 518--519.Google Scholar
- LaPaugh, A. S. 1980. Algorithms for integrated circuit layout: An analytic approach. Ph.D. dissertation, Laboratory for Computer Science. MIT, Cambridge, MA.Google Scholar
- Lee, S. and Wong, M. D. F. 2003. Timing-driven routing for FPGAs based on lagrangian relaxation. IEEE Trans. Computer-Aided Des. Integ. Circ. Syst., 506--510. Google Scholar
- Ozdal, M. M. and Wong, M. 2003. Length matching routing for high-speed printed circuit boards. In Proceedings of the of IEEE International Conference on Computer-Aided Design. IEEE Computer Society Press, Los Alamitos, CA. Google Scholar
- Prastjutrakul, S. and Kubitz, W. J. 1990. A timing-driven global router for custom chip design. In Proceedings of the of IEEE International Conference on Computer-Aided Design. IEEE Computer Society Press, Los Alamitos, CA. 48--51.Google Scholar
- Ritchey, L. W. 2000. Busses: What are they and how do they work? Printed Circuit Design Magazine.Google Scholar
- Rivest, R. L. and Fiduccia, C. M. 1982. A greedy channel router. In Proceedings of the of IEEE/ACM 19th Design Automation Conference. IEEE Computer Society Press, Los Alamitos, CA. 418--424. Google Scholar
- Szymanski. 1985. Dogleg channel routing is NP-complete. IEEE Trans. Computer-Aided Des. CAD-4, 1, 31--41.Google ScholarDigital Library
- Tsao, C.-W. A. and Koh, C.-K. 2002. UST/DME: A clock tree router for general skew constraints. ACM Trans. Des. Automat. Electron. Syst. 7, 359--379. Google ScholarDigital Library
- Yoshimura, T. and Kuh, E. S. 1982. Efficient algorithms for channel routing. IEEE Trans. Computer-Aided Des. CAD-1, 1, 25--35.Google ScholarDigital Library
Index Terms
- Two-layer bus routing for high-speed printed circuit boards
Recommendations
Obstacle-aware length-matching bus routing
ISPD '11: Proceedings of the 2011 international symposium on Physical designAs clock frequency increases, signal propagation delay on PCBs is requested to meet the timing specification with very high accuracy. Generally speaking, the net length in a single layer can estimate the routing delay in a single-layer net. In this ...
A Two-Layer Bus Routing Algorithm for High-Speed Boards
ICCD '04: Proceedings of the IEEE International Conference on Computer DesignThe increasing clock frequencies in high-end industrial circuits bring new routing challenges that can not be handled by traditional algorithms. An important design automation problem for high-speedboards today is routing nets within tight minimum and ...
Length-Matching Routing for High-Speed Printed Circuit Boards
ICCAD '03: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided designAs the clock frequencies used in industrial applications increase,the timing requirements imposed on routing problems becometighter. So, it becomes important to route the nets within tight minimumand maximum length bounds. Although the problem of ...
Comments