CriAS: a performance-driven criticality-aware synthesis flow for on-chip multicycle communication architecture
Pages 67 - 72
Abstract
In deep submicron era, wire delay is no longer negligible and is dominating the system performance. Several state-of-the-art architectural synthesis flows have been proposed for the distributed register architectures to cope with the increasing wire delay by allowing on-chip multicycle communication. In this paper, we present a new performance-driven criticality-aware synthesis flow CriAS targeting regular distributed register architectures. CriAS features a hierarchical binding strategy and a coarse-grained placer for minimizing the number of critical global data transfers. The key ideas are to take time criticality as the major concern at earlier binding stages before the detailed physical placement information is available, and to preserve the locality of closely related critical components in the later placement phase. The experimental results show that 19% overall performance improvement can be achieved on average as compared to the previous work.
References
[1]
International Technology Roadmap for Semiconductors. Semiconductor Industry Association, 2005.
[2]
Y. Mori, V. Moshnyaga, H. Onodera, and K. Tamaru, "A performance-driven macro-block placer for architectural evaluation of ASIC designs," Proc. of Annual IEEE International ASIC Conference and Exhibit, pp. 233--236, Sep. 1995.
[3]
V. Moshnyaga and K. Tamaru, "A placement driven methodology for high-level synthesis of sub-micron ASIC's," Proc. of International Symposium on Circuits and Systems, vol. 4, pp. 572--575, May 1996.
[4]
P. Prabhakaran and P. Banerjee, "Parallel algorithms for simultaneous scheduling, binding and floorplanning in high-level synthesis," Proc. of International Symposium on Circuits and Systems, vol. 6, pp. 372--376, May 1998.
[5]
D. Kim, J. Jung, S. Lee, J. Jeon, and K. Choi, "Behavior-to-placed RTL synthesis with performance-driven placement," Proc. of International Conference on Computer Aided Design, pp. 320--325, Nov. 2001.
[6]
J. Jeon, D. Kim, D. Shin, and K. Choi, "High-level synthesis under multi-cycle interconnect delay," Proc. of Asia and South Pacific Design Automation Conference, pp. 662--667, Jan. 2001.
[7]
J. Cong, Y. Fan, G. Han, X. Yang, and Z. Zhang, "Architecture and synthesis for on-chip multicycle communication," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol. 23, no. 4, pp. 550--564, Apr. 2004.
[8]
J. Cong, Y. Fan, and Z. Zhang, "Architecture-level synthesis for automatic interconnect pipelining," Proc. of Design Automation Conference, pp. 602--607, Jun. 2004.
[9]
W.-S. Huang, Y.-R. Hong, J.-D. Huang, and Y.-S. Huang, "A multicycle communication architecture and synthesis flow for global interconnect resource sharing," Proc. of Asia and South Pacific Design Automation Conference, pp. 16--21, Jan. 2008.
[10]
A. Ohchi, N. Togawa, M. Yanagisawa, and T. Ohtsuki, "High-level synthesis algorithms with floorplaning for distributed/shared-register architectures," Proc. of International Symposium on VLSI Design, Automation and Test, pp. 164--167, Apr. 2008.
[11]
J. Cong, Y. Fan, and W. Jiang, "Platform-based resource binding using a distributed register-file microarchitecture," Proc. of International Conference on Computer Aided Design, pp. 709--715, Nov. 2006.
[12]
K. Lim, Y. Kim, and T. Kim, "Interconnect and communication synthesis for distributed register-file microarchitecture," Proc. of Design Automation Conference, pp. 765--770, Jun. 2007.
[13]
SUIF 2 Compiler System. {Online}. Available: http://suif.stanford.edu/suif/suif2/
[14]
M. Smith and G. Holloway, "An introduction to machine SUIF and its portable libraries for analysis and optimization," in Division of Engineering and Applied Sciences, Harvard University, 2002.
[15]
P. Paulin and J. Knight, "Force-directed scheduling for behavioral synthesis of ASICs," IEEE Trans. on Computer-Aided Design, vol. 8, pp. 661--679, Jun. 1989.
[16]
A. Marquardt, V. Bets, and J. Rose, "Timing-driven placement for FPGAs," Proc. Of International Symposium on Field Programmable Gate Arrays, pp. 203--213, Feb. 2000.
[17]
VPR: versatile packing, placement and routing for FPGAs. Available: http://www.eecg.toronta.edu/~vaughn/vpr/vpr.html
[18]
Y. Kwok and I. Ahmad, "Dynamic critical-path schedule: an effective technique for allocating task graphs to multiprocessors," IEEE Trans. On Parallel and Distributed Systems, vol. 7, no. 5, pp. 506--521, May 1996.
[19]
R. Ahuja, T. Magnanti, and J. Orlin, Network flows: theory, algorithms, and applications, Prentice Hall, Inc., 1993.
[20]
C. Tseng and D. P. Seiwiorek, "Automated synthesis of data paths in digital systems," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol. 5, no. 3, pp. 379--395, Jul. 1986.
[21]
MCAS: multicycle architectural synthesis system. Available: http://cadlab.cs.ucla.edu/software_release/mcas/
[22]
ExPRESS group. Available: http://express.ece.ucsb.edu/
[23]
T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to algorithms, 2nd edition, the MIT press, 2001.
Recommendations
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs
In this paper, we present a new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rates. Based on binary trees, the MP-tree is very efficient, effective, and ...
MP-trees: a packing-based macro placement algorithm for mixed-size designs
DAC '07: Proceedings of the 44th annual Design Automation ConferenceIn this paper, we present a new multi-packing tree (MP-tree) representation for macro placement to handle mixed-size designs. Based on binary trees, the MP-tree is very efficient, effective, and flexible for handling macro placement with various ...
A robust detailed placement for mixed-size IC designs
ASP-DAC '06: Proceedings of the 2006 Asia and South Pacific Design Automation ConferenceThe rapid increase in IC design complexity and wide-spread use of intellectual-property (IP) blocks have made the so-called mixed-size placement a very important topic in recent years. Although several algorithms have been proposed for mixed-sized ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
- IEEE Circuits and Systems Society
- SIGDA: ACM Special Interest Group on Design Automation
- IPSJ SIGSLDM: Information Processing Society of Japan - SIG System LSI Design Methodology
- IEICE ESS: Institute of Electronics, Information and Communication Engineers - Engineering Sciences Society
Publisher
IEEE Press
Publication History
Published: 19 January 2009
Check for updates
Qualifiers
- Research-article
Conference
ASPDAC '09
Sponsor:
- SIGDA
- IPSJ SIGSLDM
- IEICE ESS
Acceptance Rates
Overall Acceptance Rate 466 of 1,454 submissions, 32%
Upcoming Conference
ASPDAC '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 76Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in