Abstract
In this paper, we present a novel temporal partitioning methodology that temporally partitions a data flow graph on reconfigurable system. Our approach optimizes the whole latency of the design. This aim can be reached by minimizing the latency of the graph and the reconfiguration time at the same time. Consequently, our algorithm starts by an existing temporal partitioning. The existing temporal partitioning is the result of a whole latency optimization algorithm. Next, our approach builds the best architecture, on a partially reconfigurable FPGA, that gives the lowest value of reconfiguration time. The proposed methodology was tested on several examples on the Xilinx Virtex-II pro. The results show significant reduction in the design latency compared with others famous approaches used in this field.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ayadi R, Ouni B, Mtibaa A (2012) A partitioning methodology that optimizes the communication cost for reconfigurable computing systems. Int J Autom Comput (Springer Publisher) 9(3): 280–287
Benoit P, Torres L, Robert M, Cambon G, Sassatelli G, Gil T (2002) Caractérisation d’Architectures Reconfigurables. Un Exemple : Le Systolic Ring. Francophone Days on Adequacy Algorithm Architecture JFAAA’2002, 16–18 December 2002, Monastir, Tunisia, pp 30–34
Cardoso JMP (2003) On combining temporal partitioning and sharing of functional units in compilation for reconfigurable architectures. IEEE Trans Comput 52(10):1362–1375
Jeong B (1999) Hardware software partitioning for reconfigurable architectures. M.S. Thesis School of Electrical Engineering, Seoul National University
Jiang Y-C, Wang J-F (2007) Temporal partitioning data flow graphs for dynamically reconfigurable computing. IEEE Trans Very Large Scale Integr Syst 15(12):1351–1361
Kaul K, Vermuri R, Govindarajan S, Ouaiss I (1998) An automated temporal partitioning tool for a class of DSP application. In: Workshop and reconfigurable computing in international conference on parallel architecture and compilation technique PACT, pp 22–27
Liu H, Wong DF (1998a) Network flow based circuit partitioning for time-multiplexed FPGAs. In: Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp 497–504
Liu H, Wong DF (1998b) Network flow based multi-way partitioning with area and pin constraints. IEEE Trans Comput Aided Design Integr Circuits Syst 17(1):50–59
Lysaght P, Blodget B, Manson J, Young J, Bridgford B (2006) Invited paper: enhanced architectures, design methodologies and CAD tools for dynamic reconfiguration of Xilinx FPGAs, PLS, pp 1–6
Mtibaa A, Ouni B, Abid M (2007) An efficient list scheduling algorithm for time placement problem. Comput Electr Eng 33(4):285–298
OPH HWICAP (2004) Product specification datasheet—DS 280 (v1.3), March
Ouni B, Ayadi R, Abid M (2008) Novel temporal partitioning algorithm for run time reconfigured systems. J Eng Appl Sci 03(010):335–340
Ouni B, Mtibaa A, Bourennane El-B (2009) Scheduling approach for run time reconfigured systems. Int J Comput Sci Eng Syst 3(4):335–340
Ouni B, Ayadi R, Mtibaa A (2011a) Partitioning and scheduling technique for run time reconfigured systems. Int J Comput Aided Eng Technol 3(1):77–91
Ouni B, Ayadi R, Mtibaa A (2011b) Combining temporal partitioning and temporal placement techniques for communication cost improvement. Adv Eng Softw (Elsevier Publisher) 42(7): 444–451
Ouni B, Ayadi R, Mtibaa A (2011c) Temporal partitioning of data flow graph for dynamically reconfigurable architecture. J Syst Archit (Elsevier Publisher) 57(8): 790–798
Spillane J, Owen H (1998) Temporal partitioning for partially-reconfigurable field-programmable gate. Reconfigurable Architectures Workshop in PS/SPDP’98
Trimberger S (1998) Scheduling designs into a time-multiplexed FPGA. In: Proceedings of the ACM International Symposium on Field Program. Gate Arrays, pp 153–160
Vasiliko M, Ait-Boudaoud D (1996) Architectural synthesis for dynamically reconfigurable logic. In: International workshop on field-programmable logic and applications, FPL’96, Darmstadt, Germany
Wu GM, Lin JM, Chang YW (2001) Generic ILP-based approaches for time-multiplexed FPGA partitioning. IEEE Trans Comput Aided Des 20(10):1266–1274
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ayadi, R., Ouni, B. & Mtibaa, A. Integrated temporal partitioning and partial reconfiguration techniques for design latency improvement. Evolving Systems 5, 133–141 (2014). https://doi.org/10.1007/s12530-013-9082-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12530-013-9082-9