Abstract
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic routing function such that the total communication energy is minimized. At the same time, the performance of the resulting communication system is guaranteed to satisfy the specified constraints through bandwidth reservation. As the main contribution, we first formulate the problem of energy/performance aware mapping, in a topological sense, and show how the routing flexibility can be exploited to expand the solution space and improve the solution quality. An efficient branch-and-bound algorithm is then described to solve this problem. Experimental results show that the proposed algorithm is very fast, and significant energy savings can be achieved. For instance, for a complex video/audio application, 51.7% energy savings have been observed, on average, compared to an adhoc implementation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
W. J. Dally, B. Towles, Route packets, not wires: on-chip interconnection networks, Proc. DAC, pp. 684–689, June 2001.
J. Chang, M. Pedram, Codex-dp: co-design of communicating systems using dynamic programming, IEEE Trans. CAD of Integrated Circuits and Systems, vol. 19, no. 7, July 2002.
W. J. Dally, C. L. Seitz, The torus routing chip, Journal of Distributed computing, vol. 1, no. 3, 187–196, 1986.
A. Hemani, et al., Network on a chip: an architecture for billion transistor era, Proc. IEEE NorChip Conf., Nov. 2000.
S. Kumar, et al., A network on chip architecture and design methodology, Proc. Symposium on VLSI, pp. 117–124, April 2002.
L. M. Ni, P. K. McKinley A survey of wormhole routing techniques in direct networks, Computer, vol. 26, no. 2, Feb. 1993.
C. J. Glass and L. M. Ni, The turn model for adaptive routing, Proc. ISCA, May 1992.
G. Chiu, The odd-even turn model for adaptive routing, IEEE Trans. on Parallel and Distributed Systems, vol. 11, no. 7, 729–738, July 2000.
T. T. Ye, L. Benini, G. De Micheli, Analysis of power consumption on switch fabrics in network routers, Proc. DAC, June 2002.
R. P. Dick, D. L. Rhodes, W. Wolf, TGFF: task graphs for free, Proc. International Workshop on Hardware/Software Codesign, March 1998.
J. Hu, R. Marculescu, Exploiting the routing flexibility for energy/performance aware mapping of regular NoC architectures, CSSI Technical Report, Carnegie Mellon University, Sept. 2002. Available at http://www.ece.cmu.edu/~sld/publications.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer
About this chapter
Cite this chapter
Hu, J., Marculescu, R. (2008). Exploiting the Routing Flexibility for Energy/Performance-Aware Mapping of Regular NoC Architectures. In: Lauwereins, R., Madsen, J. (eds) Design, Automation, and Test in Europe. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6488-3_11
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6488-3_11
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6487-6
Online ISBN: 978-1-4020-6488-3
eBook Packages: EngineeringEngineering (R0)