sorma_parallprog07

Fault-Aware Communication Mapping for NoCs with Guaranteed Latency

Sorin Manolache Author homepage
 
Petru Eles Author homepage
Zebo Peng Author homepage

Intl. Journal of Parallel Programming, Volume 35, Number 2, April 2007, pp. 125-156.

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 designer-imposed 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.


[MEP07] Sorin Manolache, Petru Eles, Zebo Peng, "Fault-Aware Communication Mapping for NoCs with Guaranteed Latency", Intl. Journal of Parallel Programming, Volume 35, Number 2, April 2007, pp. 125-156.
( ! ) perl script by Giovanni Squillero with modifications from Gert Jervan   (v3.1, p5.2, September-2002-)
Last modified on Monday December 04, 2006 by Gert Jervan