DocumentCode
2107055
Title
Netlist partitioning method suitable for adaptive computing systems
Author
Kerkiz, Nabil F. ; Elchouemi, Amr
Author_Institution
Intel Corp., Austin, TX, USA
fYear
2013
fDate
8-11 Dec. 2013
Firstpage
950
Lastpage
953
Abstract
Adaptive computing systems (ACSs) are flexible hardware accelerators for applications in domains such as image and digital signal processing. However, the mapping of applications onto ACSs using the traditional methods can take long time for a hardware engineer to develop and debug. A software design environment called CHAMPION was developed at the University of Tennessee to enable the automated mapping of applications onto ACSs. In this paper the compilation path of CHAMPION is described and a new recursive partitioning method based on topological ordering and levelization (RPL) is presented. The proposed method performs multi-FPGA partitioning by taking into account six different partitioning constraints.
Keywords
field programmable gate arrays; logic partitioning; programming environments; ACS; CHAMPION; Netlist partitioning method; RPL; adaptive computing systems; automated application mapping; flexible hardware accelerators; multiFPGA partitioning; partitioning constraints; recursive partitioning method; software design environment; topological ordering and levelization; Algorithm design and analysis; Field programmable gate arrays; Hardware; Optimization; Partitioning algorithms; Random access memory; Synchronization;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronics, Circuits, and Systems (ICECS), 2013 IEEE 20th International Conference on
Conference_Location
Abu Dhabi
Type
conf
DOI
10.1109/ICECS.2013.6815569
Filename
6815569
Link To Document