Dynamic Partial Reconfiguration (DPR) optimizes conventional FPGA application by providing additional benefits. However, considering the arbitrariness during manual floorplan and the limitation of local search when placement, it must be effective and promising if we combine the two stages to build a global optimization structure. In this paper, a novel thought for DPR FPGAs (PDPR) is proposed which tries to offer a one-stop floorplan and placement service. Experimental results show our approach can improve 32.8% on total wire length, 48.5% on reconfiguration cost, and 36.9% on congestion. © 2012 Springer-Verlag.
CITATION STYLE
He, R., Liang, G., Ma, Y., Wang, Y., & Bian, J. (2012). PDPR: Fine-grained placement for dynamic partially reconfigurable FPGAs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7199 LNCS, pp. 350–356). https://doi.org/10.1007/978-3-642-28365-9_31
Mendeley helps you to discover research relevant for your work.