ACM Home Page
Please provide us with feedback. Feedback
Platform-based resource binding using a distributed register-file microarchitecture
Full text PdfPdf (168 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California
SESSION: Specification and architecture challenges in high-level synthesis table of contents
Pages: 709 - 715  
Year of Publication: 2006
ISBN ~ ISSN:1092-3152 , 1-59593-389-1
Authors
Jason Cong  University of California, Los Angeles, CA
Yiping Fan  University of California, Los Angeles, CA
Wei Jiang  University of California, Los Angeles, CA
Sponsors
IEEE-CS : Computer Society
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 44,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1233501.1233648
What is a DOI?

ABSTRACT

Behavior synthesis and optimization beyond the register transfer level require an efficient utilization of the underlying platform features. This paper presents a platform-based resource-binding approach using a distributed register-file microarchitecture (DRFM) that makes efficient use of distributed embedded memory blocks as register files in modern FPGAs. A DRFM contains multiple islands, each having a local register file, a functional unit pool and data-routing logic. Compared with the traditional discrete-register counterpart, a DRFM allows use of the platform-featured on-chip memory or register-file IP blocks to implement its local register files, and this results in substantial saving of multiplexing logic and global interconnects. DRFM provides a useful architectural template and a direct optimization objective for minimizing inter-island connections for synthesis algorithms. Based on DRFM, we propose a novel binding algorithm focusing on the minimization of the inter-island connections. By applying our approach, significant reductions on multiplexors and global-interconnections are observed. On the Xilinx Virtex II FPGA platform, our experimental results show a 2X logic area reduction and a 7.8% performance improvement, compared with the traditional discrete-register-based approach.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
D. Chen, J. Cong, Y. Fan, G. Han, W. Jiang, and Z. Zhang, "xpilot: A platform-based behavioral synthesis system," in SRC TechCon'05, Portland, OR, Nov. 2005.
5
 
6
J. Cong, Y. Fan, G. Han, X. Yang, and Z. Zhang, "Architecture and synthesis for on-chip multi-cycle communication," IEEE Trans. Computer-Aided Design, pp. 550--564, Apr. 2004.
 
7
 
8
 
9
S. Devadas and A. Newton, "Algorithms for hardware allocation in data path synthesis," IEEE Trans. Computer-Aided Design, vol. 8(7), pp. 768--781, July 1989.
 
10
 
11
12
 
13
C. Gebotys and M. Elmasry, "Optimal synthesis of high-performance architectures," IEEE J. Solid-State Circuits, vol. 27(3), pp. 389--397, Mar. 1992.
 
14
Altera Website, http://www.altera.com.
 
15
Xilinx Website, http://www.xilinx.com.
16
 
17
18
 
19
B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell System Technical J., vol. 49, no. 2, Feb. 1970.
 
20
K. Keutzer, S. Malik, A. R. Newton, J. M. Rabaey, and A. Sangiovanni-Vincentelli, "System level design: Orthogonalization of concerns and platform-based design," IEEE Trans. Computer-Aided Design, vol. 19(12), pp. 1523--1543, Dec. 2000.
 
21
 
22
T. Kim and C. L. Liu, "An integrated data path synthesis algorithm based on network flow method," Proc. of the IEEE Custom Integrated Circuits Conference, vol. 1-4, pp. 615--618, May 1995.
 
23
 
24
P. Kollig and B. M. Al-Hashimi, "Simultaneous scheduling, allocation and binding in high level synthesis," Elect. Let., vol. 33, Aug. 1997.
25
 
26
27
 
28
 
29
T. A. Ly and J. T. Mowchenko, "Applying simulated evolution to high level synthesis," IEEE Trans. Computer-Aided Design, vol. 12(3), pp. 389--409, Mar. 1993.
30
 
31
C. A. Mandal, P. P. Chakrabarti, and S. Ghose, "Some new results in the complexity of allocation and binding in data path synthesis," Computers and Mathematics with Applications, vol. 35, no. 10, pp. 93--105, 1998.
 
32
B. M. Pangrle, "On the complexity of connectivity binding," IEEE Trans. Computer-Aided Design, vol. 10(11), pp. 1460--1465, 1991.
 
33
 
34
 
35
 
36
S. Rixner, W. J. Dally, B. Khailany, P. R. Mattson, U. J. Kapasi, and J. D. Owens, "Register organization for media processing," in Proc. of the 6th International Symposium on High-Performance Computer Architecture, 2000, pp. 375--386.
37
 
38
L. Stok and W. Philipsen, "Module allocation and comparability graphs," IEEE International Sympoisum on Circuits and Systems, vol. 11-14 vol.5, pp. 2862--2865, June 1991.
 
39
C.-J. Tseng and D. Siewiorek, "Automated synthesis of data paths in digital systems," IEEE Trans. Computer-Aided Design, vol. 5(3), pp. 379--395, July 1986.


Collaborative Colleagues:
Jason Cong: colleagues
Yiping Fan: colleagues
Wei Jiang: colleagues