Abstract
Synchronous Transfer Architecture (STA) is a coarse-grain reconfigurable hardware. It is modelled by using a common machine description that is suitable for both compiler and core generator. STA is a Very Long Instruction Word (VLIW) architecture and in addition it uses a non-orthogonal Instruction Set Architecture (ISA). Generating efficient code for such ISA needs highly optimizing techniques. This paper presents a basic data routing Integer Linear Programming (ILP) model for STA code generation. We will also show in this paper, the execution time of the assembly code can be dramatically reduced. The code generation can be accomplished in acceptable time and it can even be real time by reducing the degree of optimality.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kästner, D.: Retargetable Postpass Optimisation by Integer Linear Programming, PHD Thesis (Oktober 2000)
Zhang, L.: SILP. Scheduling and allocation with Integer Linear Programming. PHD Thesis, Saarland University (1996)
Wilken, K., Liu, J., Heffernan, M.: Optimal Instruction Scheduling Using Integer Programming. In: Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, pp. 121–133 (2000)
Kong, T., Wilken, K.: Precise Register Allocation for Irregular Architectures. In: Proceedings of the 31st annual ACM/IEEE international symposium on Microarchitecture
Cichon, G., Robelly, P., Seidel, H., Matus, E., Bronzel, M., Fettweis, G.: Synchronous Transfer Architecture (STA). In: SAMOS 2004, pp. 126–130 (2004)
Muchnick, S.S.: Advanced Compiler Design Implementation. Morgan Kaufmann, San Francisco (1997)
Aho, A.V., Sethi, R., Ullman, J.D.: Compilers, Principles, Techniques and Tools. Addison-Wesley, Redding (1985)
Cichon, G., Robelly, P., Seidel, H., Bronzel, M., Fettweis, G.: Compiler Scheduling for STA-Processors. In: PARELEC 2004, Dresden, Germany, September 07-10 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, J., Belov, G., Fettweis, G.P. (2006). A Basic Data Routing Model for a Coarse-Grain Reconfigurable Hardware. In: Bertels, K., Cardoso, J.M.P., Vassiliadis, S. (eds) Reconfigurable Computing: Architectures and Applications. ARC 2006. Lecture Notes in Computer Science, vol 3985. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802839_50
Download citation
DOI: https://doi.org/10.1007/11802839_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36708-6
Online ISBN: 978-3-540-36863-2
eBook Packages: Computer ScienceComputer Science (R0)