Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

Abstract

In deep-submicron designs, the interconnects are equally as or more important than the logic gates. In particular, to achieve timing closure, it is necessary and critical to consider the interconnect delay at an early stage of the synthesis process. It has been known that resource sharing in high-level synthesis is one of the major synthesis tasks which greatly affect the final synthesis/layout results. In this paper, we propose a new layout-aware resource sharing approach to overcome some of the limitations of the previous works in which the effects of layout on the synthesis have never been taken into account or considered in local and limited ways, or whose computation time is excessively large. The proposed approach consists of two steps: (Step 1) We relax the integrated resource sharing and placement into an efficient linear programming (LP) formulation based on the concept of \(discretisizing\) placement space; (Step 2) We derive a feasible solution from the solution obtained in Step 1. Then, we employ an iterative mechanism based on the two steps to tightly integrate resource sharing and placement tasks so that the slack time violation due to interconnect delay (determined by placement) as well as logic delay (determined by resource sharing) should be minimized. From experiments using a set of benchmark designs, it is shown that the approach is effective, and efficient, completely removing the slack time violation produced by conventional methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. Weng and A. Parker, “3D Scheduling: High-Level Synthesis with Floorplanning,” Proc. of ACM/IEEE Design Automation Conference, 1991, pp. 668–673.

  2. S. Tarafdar, M. Leeser and Z. Yin, “Integrating Floorplanning in Data Transfer Based High-Level Synthesis,” Proc. of IEEE International Conference on Computer-Aided Design, 1998, pp. 412–417.

  3. P. Prabhakaran and P. Banerjee, “Parallel Algorithm for Simultaneous Scheduling, Binding and Floorplanning in High-Level Synthesis,” Proc. of Int'l Symposium on Circuits and Systems, vol. 6, 1998, pp. 372–376.

  4. V. Moshnyaga and K. Tamaru, “A Placement Driven Methodology for High-Level Synthesis of Sub-Micron ASIC's,” Proc. of Int'l Symposium on Circuits and Systems, vol. 4, 1996, pp. 572–575.

  5. D. Kim, J. Jung, S. Lee, J. Jeon and K. Choi, “Behavior-to-Placed RTL Synthesis with Performance-Driven Placement,” Proc. of IEEE International Conference on Computer-Aided Design, 2001, pp. 320–325.

  6. H. Jang and B. Pangrle, “A Grid-Based Approach for Connectivity Binding with Geometric Costs,” Proc. of IEEE International Conference on Computer-Aided Design, 1993, pp. 94–99.

  7. M. Munch, N. Wehn, and M. Cleasner, “Optimum Simultaneous Placement and Binding for Bit-Slice Architecture,” Proc. of ACM/IEEE Design Automation Conference, 1995, pp. 735–740.

  8. Y. Fang and D. F. Wong, “Simultaneous Functional-unit Binding and Floorplanning,” Proc. of IEEE International Conference on Computer-Aided Design, 1994, pp. 317–321.

  9. B. Baker, E. Coffman and R. Rivest, “Orthogonal Packing in Two Dimensions,” SIAM J. Computing, 1980, pp. 846–855.

  10. E. Coffman, M. Garey, D. Johnson and R. Tarjan, “Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms,” SIAM J. Computing, 1980, pp. 808–826.

  11. D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Programming: Chapters 8 and 9, Athena Scientific, 1997.

  12. N. D. Dutt, “High-Level Synthesis Design Repositories,” http://www.ics.uci.edu/~dutt.

  13. C. Fiduccia and R. Matteyses, “A Linear-time Heuristic for Improving Network Partitions,” Proc. of ACM/IEEE Design Automation Conference, 1992, pp. 175–181.

  14. http://www.ilog.com

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Taewhan Kim.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Um, J., Kim, T. Resource Sharing Combined with Layout Effects in High-Level Synthesis. J VLSI Sign Process Syst Sign Image Video Technol 44, 231–243 (2006). https://doi.org/10.1007/s11265-006-8537-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-006-8537-7

Keywords

Navigation