|
ABSTRACT
Distributed register-file microarchitecture (DRFM) which comprises multiple uniform blocks (called islands), each containing a dedicated register file, functional unit(s) and data-routing logic, has been known as a very attractive architecture for implementing designs with platform-featured on-chip memory or register-file IP blocks. In comparison with the discrete-register based architecture, DRFM offers a higher degree of opportunity of reducing the cost of global (inter-island) connections by confining as many the computations to the inside of the islands as possible. Consequently, for DRFM architecture, two important problems to be solved effectively in high-level synthesis are: (problem 1) scheduling and resource binding for minimizing inter-island connections, and (problem 2) data transfer (i.e., communication) scheduling through the inter-island connections for minimizing the access conflicts among the data transfers. This work proposes novel solutions to the two problems. Specifically, for problem 1 previous work solves it in two separate steps: (i) scheduling and (ii) then determining the inter-island connections by resource binding to islands. However, in our algorithm called DFRM-int, we place primary importance on the cost of interconnections. Consequently, we minimize the cost of interconnections first to fully exploit the effects of scheduling on interconnect and then to schedule the operations later. For problem 2, previous work tries to solve the access conflicts by forwarding data directly to the destination island. However, in our algorithm called DFRM-com, we devise an efficient technique of exploring an extensive design space of data forwarding indirectly as well as directly to find a near-optimal solution. By applying our proposed synthesis approach DFRM-int+DFRM-com we are able to reduce the inter-island connections by 18.1% more, compared to that by the DRFM approach in [4], even completely eliminating register-file access conflicts, which could never been resolved by [4], without any latency increase.
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
|
Altera website. http://www.altera.com.
|
| |
2
|
Xilinx website. http://www.xilinx.com.
|
 |
3
|
Jason Cong , Yiping Fan , Guoling Han , Xun Yang , Zhiru Zhang, Architecture and synthesis for multi-cycle on-chip communication, Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis, October 01-03, 2003, Newport Beach, CA, USA
[doi> 10.1145/944645.944667]
|
 |
4
|
|
 |
5
|
|
| |
6
|
|
 |
7
|
|
| |
8
|
Daehong Kim , Jinyong Jung , Sunghyun Lee , Jinhwan Jeon , Kiyoung Choi, Behavior-to-placed RTL synthesis with performance-driven placement, Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, November 04-08, 2001, San Jose, California
|
| |
9
|
|
 |
10
|
|
 |
11
|
Hae-Dong Lee , Sun-Young Hwang, A scheduling algorithm for multiport memory minimization in datapath synthesis, Proceedings of the 1995 conference on Asia Pacific design automation (CD-ROM), p.16-es, August 29-September 01, 1995, Makuhari, Massa, Chiba, Japan
[doi> 10.1145/224818.224847]
|
 |
12
|
|
 |
13
|
|
| |
14
|
P. G. Paulin and J. P. Knight. Force-directed scheduling for the behavioral synthesis of asics. IEEE Trans, on CAD of Integrated Circuits and Systems, 8(6):661--679, 1989.
|
 |
15
|
|
 |
16
|
Shantanu Tarafdar , Miriam Leeser , Zixin Yin, Integrating floorplanning in data-transfer based high-level synthesis, Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, p.412-417, November 08-12, 1998, San Jose, California, United States
[doi> 10.1145/288548.289063]
|
| |
17
|
|
| |
18
|
|
|