Abstract
This work discusses the adaptation of NoCs to real-time requirements, in particular with respect to the fulfillment of task deadlines. It is shown that, for soft real-time systems, the number of missed deadlines can be substantially reduced by the utilization of a routing mechanism based on message priorities. A core placement strategy based on message bandwidth requirements and also on message priorities can also reduce the number of missed deadlines. The paper also discusses the impact of these strategies on the energy consumption of the system and shows that an interesting design space can be explored.
Chapter PDF
References
L. Benini, and G. De Micheli. Networks on Chips: a New SOC Paradigm. IEEE Computer, Jan. 2002, pp. 70–78.
P. Guerrier and A. Greiner. A Generic Architecture for on-Chip Packet-Switched Interconnections. DATE’2000, IEEE Press, 2000. pp. 250–256.
S. Kumar et al. A Network on Chip Architecture and Design Methodology. IEEE Computer Society Annual Symposium on VLSI, April 2002. pp. 105–112.
W. J. Dally and B. Towles. Route Packets, Not Wires: On-Chip Interconnection Networks. DAC’2001, ACM Press, 2001. pp. 684–689.
J. Duato et al. Interconnection Networks: an Engineering Approach. IEEE CS Press, 1997.
J. Hu and R. Marculescu. Energy-Aware Mapping for Tile-based NoC Architectures Under Performance Constraints. VLSI-SoC’2003, IEEE Press, 2003.
E. Bolotin et al. QNoC: QoS architecture and design process for Network on Chip. Special issue on Networks on Chip, The Journal of Systems Architecture, Dec. 2003.
A. N. F. Karim et al. An Interconnect Architecture for Networking Systems on Chips. IEEE Micro, Sep.-Oct. 2002, pp.36–45.
C. A. ZEFERINO and A. A. SUSIN, “SoCIN: a Parametric and Scalable Network-on-Chip”. In: Proceedings of the 16th Symposium on Integrated Circuits and Systems (SBCCI’2003), São Paulo, Brazil, Sept. 2003, IEEE CS Press, pp.169–174.
W. J. Dally and C. L. Seitz. The Torus Routing Chip. Journal of Distributed Computing, Oct. 1986. pp. 187–196.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., San Francisco, 1979.
N. Metropolis et al. Equation of State Calculations by Fast Computing Machines. J. Chem. Phys., 21,6, 1953, pp. 1087–1092.
S. Kirkpatrick et al. Optimization by Simulated Annealing. Science, 220, 4598, 1983, pp. 671–680.
R. P. Dick, D. L. Rhodes and W. Wolf. TGFF: task graphs for free. Proc. Intl. Workshop on Hardware/Software Codesign, March 1998.
Blue Macaw, http://www.inf.ufrgs.br/~renato/bluemacaw, Apr 2004.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science + Business Media, Inc.
About this paper
Cite this paper
de Faria Corrêa, E., Wisnieski Basso, E., Reis Wilke, G., Rech Wagner, F., Carro, L. (2004). The Implications of Real-Time Behavior in Networks-on-Chip Architectures. In: Kleinjohann, B., Gao, G.R., Kopetz, H., Kleinjohann, L., Rettberg, A. (eds) Design Methods and Applications for Distributed Embedded Systems. DIPES 2004. IFIP International Federation for Information Processing, vol 150. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8149-9_31
Download citation
DOI: https://doi.org/10.1007/1-4020-8149-9_31
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8148-4
Online ISBN: 978-1-4020-8149-1
eBook Packages: Springer Book Archive