Abstract
This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIUM. The source code is first translated into a control dataflow graph. Then after applying graph clustering, scheduling and allocation on this control dataflow graph, it can be mapped onto the target architecture. The clustering and allocation algorithm are presented in detail. 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
Cadambi, S., Goldstein, S.C.: CPR: A Configuration Profiling Tool. In: IEEE Symposium on FPGAs for Custom Computing Machines (1999)
Callahan, T.J., Chong, P., DeHon, A., Wawrzynek, J.: Fast Module Mapping and Placement for Datapaths in FPGAs. In: Proc. of International Sysp. of Field Programmable Gate Arrays (1998)
Chowdhary, A., Kale, S., Saripella, P., Sehgal, N., Gupta, R.: A General Approach for Regularity Extraction in Datapath Circuits. In: Proc. of Internaltional Conference on Computer-Aided Design (ICCAD), San Jose, CA, pp. 332–339 (1998)
Corazao, M.R., Khalaf, M.A., Guerra, L.M., Potkonjak, M., Rabaey, J.M.: Performance Optimization Using Templete mapping for Datapath-Intensive High-Level Synthesis. IEEE Transactions on Computer-Aided Design of Intergrated Circuits and Systems 15(8), 877–888 (1996)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Guo, Y., Smit, G., Heysters, P., Broersma, H.: A Graph Covering Algorithm for a Coarse Grain Reconfigurable System. In: ACM Sigplan Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES 2003), California, USA, June 2003, pp. 199–208 (2003)
Halldórsson, M.M., Radhakrishnan, J.: Greed is good: Approximating independent sets in sparse and bounded-degree graphs. In: ACM Symposium on the Theory of Computing (1994)
Kastner, R., Ogrenci-Memik, S., Bozorgzadeh, E., Sarrafzadeh, M.: Instruction Generation for Hybrid Reconfigurable Systems. In: Proc. of International Conference on Computer-Aided Design (ICCAD), San Jose, CA (November 2001)
Kutzschebauch, T.: Efficient Logic Optimization Using Regularity Extraction. In: Proc. of the 1999 Internaltional Workshop on Logic Synthesis (1999)
Sreenivasa Rao, D., Kurdahi, F.J.: On Clustering For Maximal Regularity Extraction. IEEE Transactions on Computer-Aided Design 12(8), 1198–1208 (1993)
Sarkar, V.: Clustering and Scheduling Parallel Programs for Multiprocessors. Research Monographs in Parallel and Distributed Computing. MIT Press, Cambridge (1989)
Smit, G.J.M., Havinga, P.J.M., Smit, L.T., Heysters, P.M., Rosien, M.A.J.: Dynamic Reconfiguration in Mobile Systems. In: Proc. of FPL2002, Montpellier France, September 2002, pp. 171–181 (2002)
SUIF Compiler system, http://suif.stanford.edu
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, Y., Smit, G.J.M., Broersma, H., Rosien, M.A.J., Heysters, P.M. (2003). Mapping Applications to a Coarse Grain Reconfigurable System. In: Omondi, A., Sedukhin, S. (eds) Advances in Computer Systems Architecture. ACSAC 2003. Lecture Notes in Computer Science, vol 2823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39864-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-39864-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20122-9
Online ISBN: 978-3-540-39864-6
eBook Packages: Springer Book Archive