Abstract
This paper aims to introduce a time partitioning algorithm which is an important step during the design process for fully reconfigurable systems. This algorithm is used to solve the time partitioning problem. It divides the input task graph model to an optimal number of partitions and puts each task in the appropriate partition so that the latency of the input task graph is optimal. Also a part of this paper is consecrated for implementation of some examples on a fully reconfigurable architecture following our approach.
Similar content being viewed by others
References
Cardoso, J.M.P. and H.C. Neto. An Enhance Static-List Scheduling Algorithm for Temporal Partitioning Onto Rpus. In IFIP TC10 WG10.5 10 Int. Conf. on Very Large Scale Integration (VLSI’99), Lisboa, Portugal, 1999, pp. 485–496.
Chang, D. and M. Marek-Sadowska. Partitioning Sequential Circuits on Dynamically Reconfigurable FPGAs. In International Symposium on Field Programmable Gate Arrays (FPGA 98), Monterey, California, 1998, pp. 161–167.
Cupta, R. and G. Demicheli. Partitioning of Functional Models of Synchronous Digital Systems. Proc of ICCAD-90, 216–219, 1990.
Forsythe, G.E. and P. Henrici. The Cyclic Jacobin Method for Computing the Principal Values of a Complex Matrix. Trans. Amer. Math. Soc., vol. 94, pp. 1–23, 1960.
Kaul, M. and R. Vemuri. Optimal Temporal Partitioning and Synthesis for Reconfigurable Architecture. Design and Test in Europe, pp. 389–396, 1998.
Kaul, M., R. Vemuri, S. Govindarajan, and I. Ouaiss. An Automated Temporal Partitioning Tool for a Class of DSP Applications, 1998.
Liu, H. and D.F. Wong. Network Flow-Based Circuit Partitioning for Time-Multiplexed FPGAs. In IEEE/ACM International Conference on Computer-Aided Design, 1998, pp. 497–504.
Ouni, B., A. Mtibaa, and M. Abid. Time Partitioning Framework for fully Reconfigurable Systems. The 16th International Conference on Microelectronics, ICM’04. Gammart, Tunisia, December 6–8, 2004, pp. 742–745.
Ouni, B., A. Mtibaa, and M. Abid. Design Flow and Time Partitioning for Reconfigurable Systems. Premier congrès international de Signaux Circuits et Systèmes (SCS2004), Monastir, Tunisie, du 18-21-Mars 2004, pp. 261–264.
Pandey, A. and R. Vemuri. Combined Temporal Partitioning and Scheduling for Reconfigurable Architectures. In Reconfigurable Technology: FPGAs for Computing and Applications. Proc. SPIE 3844, Bellingham, WA, 1999, pp. 93–103.
Purna, K.M.G. and D. Bhatia. Temporal Partitioning and Scheduling Data Flow Graphs for Reconfigurable Computers. IEEE Transactions on Computers, vol. 48, no. 6, pp. 579–590, 1999.
Teich, J., S.P. Fekete, and J. Schepers. Optimizing Dynamic Hardware Reconfiguration. Technical Report 97.228, Angewante Mathematic Und Informatik Universität zu Köln, 1998.
Trimberger, S. Scheduling Designs into a Time-Multiplexed FPGA. In International symposium on Field Programmable Gate Arrays (FPGA 98), Monterey, California, 1998, pp. 153–160.
Wallace, G.K. The JPEG Still Picture Compression Standard. ACM communication, 1991.
Xu, M. and F. Kurdahi. Layout Driven High Level Synthesis for FPGAs Based Architecture. DATE 1998.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ouni, B., Mtibaa, A. & Abid, M. Synthesis and Time Partitioning for Reconfigurable Systems. Des Autom Embed Syst 9, 177–191 (2004). https://doi.org/10.1007/s10617-005-1196-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10617-005-1196-2