DocumentCode
3548307
Title
Resource sharing in pipelined CDFG synthesis
Author
Mondal, Somsubhra ; Memik, Seda Ogrenci
Author_Institution
Dept. of Electr. & Comput. Eng., Northwestern Univ., Evanston, IL, USA
Volume
2
fYear
2005
fDate
18-21 Jan. 2005
Firstpage
795
Abstract
Efficient use of limited available resources on an FPGA remains a crucial problem for synthesizing pipelined designs. Resource sharing addresses this challenge. In this paper, we propose resource sharing techniques that can be incorporated into an automated synthesis flow to generate pipelined designs. Given a synthesized pipelined design, we create a direct relationship between available time slack on modules and the multiplexing overhead due to sharing. This flexibility is maximally exploited without violating any throughput constraints. We propose different techniques to address resource sharing problems of varying restrictions. Specifically, we propose an optimal algorithm for constant-slack resource sharing and a heuristic for the general intrapipeline stage resource sharing. On an average the demand on arithmetic functional units can be reduced by 39.5% for a set of benchmarks from the multimedia domain using our resource sharing technique.
Keywords
algorithm theory; data flow graphs; field programmable gate arrays; pipeline arithmetic; FPGA; arithmetic functional units; constant-slack resource sharing; intrapipeline stage resource sharing; multimedia domain; optimal algorithm; pipelined CDFG synthesis; synthesized pipelined design; Arithmetic; Cost function; Delay effects; Field programmable gate arrays; Hardware; Heuristic algorithms; Pipeline processing; Resource management; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 2005. Proceedings of the ASP-DAC 2005. Asia and South Pacific
Print_ISBN
0-7803-8736-8
Type
conf
DOI
10.1109/ASPDAC.2005.1466464
Filename
1466464
Link To Document