Fault and energy-aware communication mapping with guaranteed latency for applications implemented on NoC

ABSTRACT

As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival probability and response time. We address the problem of transient link failures by means of temporally and spatially redundant transmission of messages, such that designerimposed message arrival probabilities are guaranteed. Response time minimisation is achieved by a heuristic that statically assigns multiple copies of each message to network links, intelligently combining temporal and spatial redundancy. Concerns regarding energy consumption are addressed in two ways. Firstly, we reduce the total amount of transmitted messages, and, secondly, we minimise the application response time such that the resulted time slack can be exploited for energy savings through voltage reduction. The advantages of the proposed approach are guaranteed message arrival probability and guaranteed worst case application response time.

REFERENCES

• 1: A. Andrei , M. Schmitz , P. Eles , Z. Peng , B. M. Al Hashimi, Simultaneous communication and processor voltage scaling for dynamic and leakage energy reduction in time-constrained systems, Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, p.362-369, November 07-11, 2004 [doi>10.1109/ICCAD.2004.1382602]
• 2: Luca Benini , Giovanni De Micheli, Networks on Chips: A New SoC Paradigm, Computer, v.35 n.1, p.70-78, January 2002 [doi>10.1109/2.976921]
• 3: D. Bertozzi , L. Benini , G. de Micheli, Low Power Error Resilient Encoding for On-Chip Data Buses, Proceedings of the conference on Design, automation and test in Europe, p.102, March 04-08, 2002
• 4: W. Dally. Interconnect-limited VLSI architecture. In IEEE Conference on Interconnect Technologies, pages 15--17, 1999.
• 5: J. Dielissen, A. Radulescu, K. Goossens, and E. Rijpkema. Concepts and implementation of the Philips network-on-chip. In IP-Based SoC Design, 2003.
• 6: Tudor Dumitras , Radu Marculescu, On-Chip Stochastic Communication, Proceedings of the conference on Design, Automation and Test in Europe, p.10790, March 03-07, 2003
• 7: Fred Glover, Tabu Search, Kluwer Boston, Inc., 1998
• 8: Jingcao Hu , Radu Marculescu, DyAD: smart routing for networks-on-chip, Proceedings of the 41st annual conference on Design automation, June 07-11, 2004, San Diego, CA, USA [doi>10.1145/996566.996638]
• 9: D. Liu et al. Power consumption estimation in CMOS VLSI chips. IEEE J. of Solid-State Circuits, (29):663--670, 1994.
• 10: S. Manolache. Fault-tolerant communication on network-on-chip. Technical report, Linkoping Univ., 2004.
• 11: J. C. Palencia , M. González Harbour, Schedulability Analysis for Tasks with Static and Dynamic Offsets, Proceedings of the IEEE Real-Time Systems Symposium, p.26, December 02-04, 1998
• 12: M. Pirretti, G. M. Link, R. R. Brooks, N. Vijaykrishnan, M. Kandemir, and I. M. J. Fault tolerant algorithms for network-on-chip interconnect. In Proc. of the ISVLSI, 2004.

INDEX TERMS

Primary Classification:
  B. Hardware
  B.4 INPUT/OUTPUT AND DATA COMMUNICATIONS
      B.4.4 Performance Analysis and Design Aids**

Additional Classification:
  B. Hardware
  B.4 INPUT/OUTPUT AND DATA COMMUNICATIONS
      B.4.5 Reliability, Testing, and Fault-Tolerance**

General Terms:
Algorithms, Performance