Abstract
FPGAs(Field Programmable Gate Arrays) are often used as reconfigurable de-vice. Because the functions to be implemented in FPGAs are often too big to fit in one device, they are divided into several partitions or configurations which can fit in the device. According to dependencies given in the function a Schedule is calculated. The partitions are successively downloaded in the device in accordance with the schedule until the complete function is computed. Often the time needed for reconfiguration is too high compared to the computation time [1, 11]. This paper presents a novel method for the reduction of the total reconfiguration time of a function by the generation of a minimal number of configurations. We present the framework that we developed for the fast and easy generation of configurations from a function modeled as DFG (datafiow graph).
The updated original online version for this book can be found at DOI: 10.1007/978-0-387-35599-3_29
Chapter PDF
References
C. Bobda and N. Steenbock. Singular value decomposition on distributed reconfigurable systems. In 12th IEEE International Workshop On Rapid System Prototyping(RSP’01), Monterey California. IEEE Computer Society, 2001.
T. J. Callahan, P. Chong, A. Dehon, and J. Wawrzynek. Fast module mapping and placement for datapaths in fpgas. In International Symposium on Field Programmable Gate Arrays(FPGA 98),pages 123 —132, Monterey, California, 1998. ACM/SIGDA.
J. M. P. Cardoso and H. C. Neto. An enhance static-list scheduling algorithm for temporal partitioning onto rpus. In IFIP TCIO WG10.5 10 Int. Conf on Very Large Scale Integration(VLSI’99),pages 485 —496, Lisboa, Portugal, 1999. IFIP.
D. Chang and M. Marek-Sadowska. Partitioning sequential circuits on dynamicaly reconfigurable fpgas. In International Symposium on Field Programmable Gate Arrays(FPGA 98),pages 161–167, Monterey, California, 1998. ACM/SIGDA.
Ejnioui and N. Ranganathan. Circuit scheduling on time-multiplexed fpgas.
S. Guccione, D. Levi, and P. Sundararajan. Jbits: A java-based interface for reconfigurable computing, 1999.
K. Hall. dimensional quadratic placement algorithm, 1970.
M. Kaul, R. Vemuri, S. Govindarajan, and I. Ouaiss. An automated temporal partitioning tool for a class of dsp applications, 1998.
H. Liu and D. F. Wong. Circuit partitioning for dynamicaly reconfigurable fpgas. In International Symposium on Field Programmable Gate Arrays(FPGA 98),pages 187 —194, Monterey, California, 1999. ACM/SIGDA.
I. Ouaiss, S. Govindarajan, V. Srinivasan, M. Kaul, and R. Vemuri. An integrated partitioning and synthesis system for dynamically reconfigurable multi-FPGA architectures. In IPPS/SPDP Workshops, pages 31–36, 1998.
A. Pandey and R. Vemuri. Combined temporal partitioning and scheduling for reconfigurable architectures. In J. Schewel, P. M. Athanas, S. A. Guccione, S. Ludwig, and J. T. McHenry, editors, Reconfigurable Technology: FPGAs for Computing and Applications, Proc. SPIE 3844, pages 93–103, Bellingham, WA, 1999. SPIE — The International Society for Optical Engineering.
J. Teich, S. P. Fekete, and J. Schepers. Optimizing dynamic hardware reconfiguration. Technical Report 97.228, Angewante Mathematic Und Informatik Universität zu Köln, 1998.
S. Trimberger. Circuit partitioning for dynamicaly reconfigurable fpgas. In International Symposium on Field Programmable Gate Arrays(FPGA 98),pages 153 —160, Monterey, California, 1999. ACM/SIGDA.
M. Vasilko. Dynasty: A temporal floorplanning based cad framework for dynamicaly reconfigurable logic systems. In P. Lysaght and J. Irvine, editors, Field Programmable Logic and Aplications FPL 1999, pages 124–133, Glasgow, UK, 1999. Springer.
M. Vasilko and G. Benyon-Tinker. Automatic temporal floorplanning with guaranteed solution feasibility. In R. Hartenstein and H. Grünbacher, editors, Field Programmable Logic and Aplications FPL 2000, pages 656–664, Villach, Austria, 2000. Springer.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Bobda, C. (2002). Temporal Partitioning and Sequencing of Dataflow Graphs on Reconfigurable Systems. In: Kleinjohann, B., Kim, K.H., Kleinjohann, L., Rettberg, A. (eds) Design and Analysis of Distributed Embedded Systems. DIPES 2002. IFIP — The International Federation for Information Processing, vol 91. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35599-3_19
Download citation
DOI: https://doi.org/10.1007/978-0-387-35599-3_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4937-3
Online ISBN: 978-0-387-35599-3
eBook Packages: Springer Book Archive