Most reconfigurable computing architectures suffer from computationally demanding Placement and Routing (P&R) steps which might hamper their use in contexts requiring dynamic compilation (e.g., to guarantee application portability in embedded systems). Bearing in mind the simplification of P&R steps, this paper presents and analyzes a coarse-grained reconfigurable array extended with global Omega Networks. We show that integrating one or two Omega Networks in a coarse-grained array simplifies the P&R stage with both low hardware resource overhead and low performance degradation (18% for an 8x8 array). The experimental results included permit to compare the coarse-grained array with one or two Omega Networks with a coarse-grained array based on a grid of processing elements with neighbor connections. When comparing the execution time to perform the P&R stage needed for the two arrays, we show that the array using two Omega Networks needs a far simple P&R which for the benchmarks used completed on average in about 20x less time. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Ferreira, R., Damiany, A., Vendramini, J., Teixeira, T., & Cardoso, J. M. P. (2009). On simplifying placement and routing by extending coarse-grained reconfigurable arrays with omega networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5453, pp. 145–156). https://doi.org/10.1007/978-3-642-00641-8_16
Mendeley helps you to discover research relevant for your work.