Abstract
Coarse-grained Reconfigurable Architectures (CGRAs) are very promising to provide high performance at high power efficiency. Hardware simplicity provides such efficiency, and compiler takes the remaining complexity, particulary application mapping. The task of application mapping consists of data and code mapping onto CGRAs. The mapping procedure has responsible for resolving conflicted requirements between exploiting instruction level parallelism and data parallelism to achieve better performance. In this paper, we describe our experience with developing a practical technique for instruction and data mapping based on a generic CGRA. The proposed technique effectively utilizes the exact knowledge of available routing elements, processing elements, and necessary data as well as future resource and data transfer requirements known only at schedule time.
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
Cho, D.: A memory access pattern based data distribution technique for array processors. Convergence and Hybrid Information Technology 206, 633–640 (2011)
Guthaus, M.R., Ringenberg, J.S., Ernst, D., Austin, T.M., Mudge, T., Brown, R.B.: Mibench: A free, commercially representative embedded benchmark suite. In: 2001 IEEE International Workshop on Proceedings of the Workload Characterization, WWC-4, pp. 3–14. IEEE Computer Society, Washington, DC (2001)
Kim, Y., Kiemb, M., Park, C., Jung, J., Choi, K.: Resource sharing and pipelining in coarse-grained reconfigurable architecture for domain-specific optimization. In: Proceedings of the Conference on Design, Automation and Test in Europe, vol. 1, pp. 12–17 (2005)
Mei, B., Vernalde, S., Verkest, D., Lauwereins, R.: Design methodology for a tightly coupled vliw/reconfigurable matrix architecture: A case study. In: Proceedings of the Conference on Design, Automation and Test in Europe, vol. 2 (2004)
University of Dortmund. Icd-c compiler framework
Ramakrishna Rau, B.: Iterative modulo scheduling: an algorithm for software pipelining loops. In: Proceedings of the 27th Annual International Symposium on Microarchitecture, MICRO 27, pp. 63–74 (1994)
Rau, B.R., Fisher, J.A.: Instruction-level parallel processing: history, overview, and perspective. J. Supercomput. 7, 9–50 (1993)
Singh, H., Lee, M.-H., Lu, G., Bagherzadeh, N., Kurdahi, F.J., Filho, E.M.C.: Morphosys: An integrated reconfigurable system for data-parallel and computation-intensive applications. IEEE Trans. Comput. 49, 465–481 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoon, J., Han, K., Cho, D., Cho, J. (2012). An Efficient Application Mapping for Coarse-Grained Reconfigurable Architectures. In: Lee, G., Howard, D., Kang, J.J., Ślęzak, D. (eds) Convergence and Hybrid Information Technology. ICHIT 2012. Lecture Notes in Computer Science, vol 7425. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32645-5_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-32645-5_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32644-8
Online ISBN: 978-3-642-32645-5
eBook Packages: Computer ScienceComputer Science (R0)