Resource-Aware Multi-Layer Floorplanning for Partially Reconfigurable FPGAs

Liu, Nan; Chen, Song; Yoshimura, Takeshi

doi:10.1587/transele.e96.c.501

Cited by 2 publications

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3) Computation of Area Costs: Let Row 0 and Col 0 , respectively, be the number of rows and the number of columns of the CLB array available in the FPGA chip. The area cost AC is calculated using a method similar to that in [23]: (17) where E Col = max(Col − Col 0 , 0) and E Row = max(Row − Row 0 , 0) are respectively the excessive columns and rows required by the current solution, λ = Row 0 /Col 0 , and C 1 is a user-defined constant.…”

Section: Evaluation Of Insertion Points 1) Computation Of Tmentioning

confidence: 99%

Integrated Optimization of Partitioning, Scheduling, and Floorplanning for Partially Dynamically Reconfigurable Systems

Chen

Huang

et al. 2020

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

Self Cite

View full text Add to dashboard Cite

Confronted with the challenge of high performance for applications and the restriction of hardware resources for field-programmable gate arrays (FPGAs), partial dynamic reconfiguration (PDR) technology is anticipated to accelerate the reconfiguration process and alleviate the device shortage. In this paper, we propose an integrated optimization framework for task partitioning, scheduling and floorplanning on partially dynamically reconfigurable FPGAs. The partition, schedule, and floorplan of the tasks are represented by the partitioned sequence triple P -ST (P S, QS, RS), where (P S, QS) is a hybrid nested sequence pair (HN SP ) for representing the spatial and temporal partitions, as well as the floorplan, and RS is the partitioned dynamic configuration order of the tasks. The floorplanning and scheduling of task modules can be computed from the partitioned sequence triple P -ST in O(n 2 ) time. To integrate the exploration of the scheduling and floorplanning design space, we use a simulated annealing-based search engine and elaborate a perturbation method, where a randomly chosen task module is removed from the partition sequence triple and then re-inserted into a proper position selected from all the O(n 3 ) possible combinations of partition, schedule and floorplan. We also prove a sufficient and necessary condition for the feasibility of the partitioning of tasks and scheduling of task configurations, and derive conditions for the feasibility of the insertion points in a P-ST. The experimental results demonstrate the efficiency and effectiveness of the proposed framework.

show abstract

Section: Evaluation Of Insertion Points 1) Computation Of Tmentioning

confidence: 99%