Route-Aware Task Mapping Method for Fault-Tolerant 2D-Mesh Network-on-Chips
This paper deals with the issue of task mapping onto fault-tolerant 2D-Mesh Network-on-Chips (2D-MNoCs). In the fault-tolerant 2D-MNoCs, fault-tolerant deadlock-free routing control without assistance of hardware (such as lookup table and virtual channel) is desirable due to simple router architectu...
Saved in:
| Published in | 2011 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems pp. 472 - 480 |
|---|---|
| Main Authors | , , , , |
| Format | Conference Proceeding |
| Language | English |
| Published |
IEEE
01.10.2011
|
| Subjects | |
| Online Access | Get full text |
| ISBN | 1457717131 9781457717130 |
| ISSN | 1550-5774 |
| DOI | 10.1109/DFT.2011.61 |
Cover
| Summary: | This paper deals with the issue of task mapping onto fault-tolerant 2D-Mesh Network-on-Chips (2D-MNoCs). In the fault-tolerant 2D-MNoCs, fault-tolerant deadlock-free routing control without assistance of hardware (such as lookup table and virtual channel) is desirable due to simple router architecture, low power consumption and easy fault diagnosis. For such fault-tolerant 2D-MNoCs, existing task mapping methods are not efficient because task assignment process and route decision process, which are closely interdependent, are performed separately. In this paper, we propose a new route-aware task mapping method based on a generic algorithm. Our method considers the effect of overlapped routing paths provided by a fault-tolerant routing control in assigning tasks to nodes and obtains a quasi-optimal solution by the genetic algorithm. Experimental study compares overall performances of our method with a random mapping method under the random and cluster fault models, and shows that our method consistently leads to reduction in the total execution time of mapped applications. |
|---|---|
| ISBN: | 1457717131 9781457717130 |
| ISSN: | 1550-5774 |
| DOI: | 10.1109/DFT.2011.61 |