Abstract
This paper introduces a design method to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, called MONTIUM. The source code is first translated into a control dataflow graph (CDFG). Then after applying graph clustering, scheduling and allocation on this CDFG, it can be mapped onto the target architecture. High performance and low power consumption are achieved by exploiting maximum parallelism and locality of reference respectively. Using our mapping method, the flexibility of the MONTIUM architecture can be exploited.
This is a preview of subscription content, log in via an institution to check access.
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
T.J. Callahan, J.R. Hauser, and J. Wawryzynek, “The Garp Architecture and C compiler” in IEEE Computer, 33(4), April 2000.
Yuanqing Guo, Gerard Smit, Paul Heysters, Hajo Broersma, “A Graph Covering Algorithm for a Coarse Grain Reconfigurable System”, 2003 ACM Sigplan Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'03), California, USA, June 2003, pp. 199–208.
S.J. Kim and J.C. Browne, A General Approach to Mapping of parallel Computation upon Multiprocessor Architectures, International Conference on Parallel Processing, vol 3, 1988, pp. 1–8.
Hesham EL-Rewini, Theodore Gyle Lewis, Hesham H. Ali, Task scheduling in parallel and distributed systems, PTR Prentice Hall, 1994.
Michel A.J. Rosien, Yuanqing Guo, Gerard J.M. Smit, Thijs Krol, “Mapping Applications to an FPFA Tile”, Proc. of Date 03, Munich, March, 2003.
Vivek Sarkar. Clustering and Scheduling Parallel Programs for Multiprocessors. Research Monographs in Parallel and Distributed Computing. MIT Press, Cambridge, Massachusetts, 1989.
Gerard J.M. Smit, Paul J.M. Havinga, Lodewijk T. Smit, Paul M. Heysters, Michel A.J. Rosien, “Dynamic Reconfiguration in Mobile Systems”, Proc. of FPL2002, Montpellier France, pp. 171–181, September 2002.
SUIF Compiler system, http://suif.stanford.edu.
Tao Yang; Apostolos Gerasoulis, “DSC: scheduling parallel tasks on an unbounded number of processors”, IEEE Transactions on Parallel and Distributed Systems, Volume:5 Issue:9, Sept. 1994 Page(s): 951–967.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer
About this chapter
Cite this chapter
Guo, Y., Smit, G.J., Rosien, M.A., Heysters, P.M., Krol, T., Broersma, H. (2005). Mapping Applications to a Coarse Grain Reconfigurable System. In: Lysaght, P., Rosenstiel, W. (eds) New Algorithms, Architectures and Applications for Reconfigurable Computing. Springer, Boston, MA. https://doi.org/10.1007/1-4020-3128-9_8
Download citation
DOI: https://doi.org/10.1007/1-4020-3128-9_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-3127-4
Online ISBN: 978-1-4020-3128-1
eBook Packages: EngineeringEngineering (R0)