Abstract
The synthesis of dynamically reconfigurable systems poses some new challenges for high-level synthesis tools. In this paper, we deal with the task of module allocation as this step has a direct influence on the performance of the dynamically reconfigurable. We propose a configuration bundling driven module allocation technique that can be used for component clustering. The basic idea is to group configurable logic together properly so that a given configuration can do as much work as possible, allowing a greater portion of the task to be completed between reconfigurations. Our synthesis methodology addresses the issues of minimizing reconfiguration overhead by maintaining a global view of the resource requirements at all times during the high-level syn thesis process.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lysaght and J. Dunlop: Dynamic reconfiguration of FPGAs, More FPGAs, UK: Abingdon EE and CS Books (1994), pp82–94, 1994.
M. Vasilko and D. Ait-Boudaoud: Architectural Synthesis Techniques for Dynamically Reconfigurable Logic, Field-Programmable Logic, Lecture Notes in Computer Science 1142, pp290–296
J. Spillane and H. Owen: Temporal Partitioning for Partially Reconfigurable Field Programmable Gate, Proceedings of Reconfigurable Architectures Workshop (RAW98), 1998.
M. Kaul and R. Vemuri: Optimal Temporal Partitioning and Synthesis for Reconfigurable Architectures, Proceedings of Design and Test in Europe (DATE’98), 1998.
Kam-wing Ng, Xue-jie Zhang, and Gilbert H. Young: Design Representation for Dynamically Reconfigurable Systems, Proceedings of the 5th Annual Australasian Conference on Parallel And Real-Time Systems (PART’98), pp 14–23, Adelaide, Australia, September 1998.
Scott Hauck and Anant Agarwal: Software Technologies for Reconfigurable Systems, Northwestern University, Dept. of ECE Technical Report, 1996.
Ivan Radivojevic and Forrest Brewer: A New Symbolic Technique for Control Dependent Scheduling, IEEE Trans. on Computer-Aided Design of Integerated Circuit and Systems, vol.15, no.1, pp45–56, Jan. 1996.
D. Brasen, J.P. Hiol and G. Saucier: Finding Best Cones From Random Clusters for FPGA Package Partitioning, IFIP International Conference on VLSI, pp 799–804, Aug. 1995.
Sriam Govindarajan and Ranga Vemuri: Cone-Based Clustering Heuristic for List-Scheduling Algorithms. Proceedings of the European Design and Test Conference, Paris, France, March 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Xj., Ng, Kw. (2000). Module Allocation for Dynamically Reconfigurable Systems. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_128
Download citation
DOI: https://doi.org/10.1007/3-540-45591-4_128
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67442-9
Online ISBN: 978-3-540-45591-2
eBook Packages: Springer Book Archive