DocumentCode
2101054
Title
Finite Domain Constraints Based Delay Aware Placement Tool for FPOAs
Author
Saraswat, Rohit ; Eames, Brandon
Author_Institution
Dept. of Electr. & Comput. Eng., Utah State Univ., Logan, UT
fYear
2008
fDate
3-5 Dec. 2008
Firstpage
145
Lastpage
150
Abstract
FPOAs are reconfigurable devices similar to FPGAs but offer a much higher level of abstraction than the gate level. The main advantage of FPOAs is their deterministic on chip network, which guarantees that an application executes at the design frequency. Mathstar´s current toolflow requires constant manual guidance to place and route a design. In this paper we propose a finite domain Constraint Satisfaction (CS) based approach, which considers the communication delay between hardware resources to ensure that they meet the design´s timing requirement. We tested our Placement tool using a parameterized design test generator, and a 48-tap FIR filter. The tool reported a feasible solution for problems with known solutions, typically within a few seconds.
Keywords
constraint theory; electronic engineering computing; field programmable gate arrays; reconfigurable architectures; 48-tap FIR filter; FPOA; Mathstar; chip network; communication delay; delay aware placement; finite domain constraint satisfaction; hardware resources; reconfigurable devices; Communication networks; Delay; Field programmable gate arrays; Frequency; Network-on-a-chip; Reconfigurable architectures; Routing; Simulated annealing; Testing; Timing; Coarse grained reconfigurable architecture; Constraint Satisfaction; FPOA; Finite Domain Constraints; Placement;
fLanguage
English
Publisher
ieee
Conference_Titel
Reconfigurable Computing and FPGAs, 2008. ReConFig '08. International Conference on
Conference_Location
Cancun
Print_ISBN
978-1-4244-3748-1
Electronic_ISBN
978-0-7695-3474-9
Type
conf
DOI
10.1109/ReConFig.2008.50
Filename
4731785
Link To Document