| List publications: | by year | by research area | by keywords | by document type | by author |
|
|
||||
|
|
|
|
|
/ by ID / DeKaFi11.NOCS
Total: 1
Onur Derin,
Deniz Kabakci,
and Leandro Fiorin,
"Online Task Remapping Strategies for Fault-tolerant Network-on-Chip Multiprocessors".
In
NOCS '11: Proceedings of the Fifth ACM/IEEE International Symposium on Networks-on-Chip,
pp.129--136.
ACM,
Pittsburgh, Pennsylvania, USA,
May
2011
.
| Abstract | As CMOS technology scales down into the deep submicron domain, the aspects of fault tolerance in complex Networks-on-Chip (NoCs) architectures are assuming an increasing relevance. Task remapping is a software based solution for dealing with permanent failures in processing elements in the NoC. In this work, we formulate the optimal task mapping problem for mesh-based NoC multiprocessors with deterministic routing as an integer linear programming (ILP) problem with the objective of minimizing the communication traffic in the system and the total execution time of the application. We find the optimal mappings at design time for all scenarios where single-faults occur in the processing nodes. We propose heuristics for the online task remapping problem and compare their performances with the optimal solutions. |
| Keywords | fault tolerance, heuristics, integer linear programming (ILP), kahn process networks (KPN), networks-on-chip (NoC), self-adaptivity |
| Research area | Fault tolerance |
| Document |  permanent link
BibTeX
DOI
full text
slides
poster |
| Share |
 architectures are assuming an increasing relevance. Task remapping is a software based solution for dealing with permanent failures in processing elements in the NoC. In this work, we formulate the optimal task mapping problem for mesh-based NoC multiprocessors with deterministic routing as an integer linear programming (ILP) problem with the objective of minimizing the communication traffic in the system and the total execution time of the application. We find the optimal mappings at design time for all scenarios where single-faults occur in the processing nodes. We propose heuristics for the online task remapping problem and compare their performances with the optimal solutions.&p[images][0]=http://people.alari.ch/derino/apps/bebop/img/bebop-logo_w100.png "Facebook"){kind=logo}
Use this URL to link to this page:
http://people.alari.ch/derino/apps/bebop/?action=showcategory&by=ID&pub=DeKaFi11.NOCS
http://people.alari.ch/derino/apps/bebop/?action=showcategory&by=ID&pub=DeKaFi11.NOCS