A Probabilistic Spatial Distribution Model for Wire Faults in Parallel Network-on-Chip Links
High-performance chip multiprocessors contain numerous parallel-processing cores where a fabric devised as a network-on-chip (NoC) efficiently handles their escalating intertile communication demands. Unfortunately, prolonged operational stresses cause accelerated physically induced wearout leading...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2015/410172 |
id |
doaj-7e1e8ea616f74f3d8a21f1297b33a290 |
---|---|
record_format |
Article |
spelling |
doaj-7e1e8ea616f74f3d8a21f1297b33a2902020-11-25T00:22:29ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472015-01-01201510.1155/2015/410172410172A Probabilistic Spatial Distribution Model for Wire Faults in Parallel Network-on-Chip LinksArseniy Vitkovskiy0Paul Christodoulides1Vassos Soteriou2Faculty of Engineering and Technology, Cyprus University of Technology, 3603 Limassol, CyprusFaculty of Engineering and Technology, Cyprus University of Technology, 3603 Limassol, CyprusFaculty of Engineering and Technology, Cyprus University of Technology, 3603 Limassol, CyprusHigh-performance chip multiprocessors contain numerous parallel-processing cores where a fabric devised as a network-on-chip (NoC) efficiently handles their escalating intertile communication demands. Unfortunately, prolonged operational stresses cause accelerated physically induced wearout leading to permanent metal wire faults in links. Where only a subset of wires may malfunction, enduring healthy wires are leveraged to sustain connectivity when a partially faulty link recovery mechanism is utilized, where its data recovery latency overhead is proportional to the number of consecutive faulty wires. With NoC link failure models being ultimately important, albeit being absent from existing literature, the construction of a mathematical model towards the understanding of the distribution of wire faults in parallel on-chip links is very critical. This paper steps in such a direction, where the objective is to find the probability of having a “fault segment” consisting of a certain number of consecutive “faulty” wires in a parallel NoC link. First, it is shown how the given problem can be reduced to an equivalent combinatorial problem through partitions and necklaces. Then the proposed algorithm counts certain classes of necklaces by making a separation between periodic and aperiodic cases. Finally, the resulting analytical model is tested successfully against a far more costly brute-force algorithm.http://dx.doi.org/10.1155/2015/410172 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Arseniy Vitkovskiy Paul Christodoulides Vassos Soteriou |
spellingShingle |
Arseniy Vitkovskiy Paul Christodoulides Vassos Soteriou A Probabilistic Spatial Distribution Model for Wire Faults in Parallel Network-on-Chip Links Mathematical Problems in Engineering |
author_facet |
Arseniy Vitkovskiy Paul Christodoulides Vassos Soteriou |
author_sort |
Arseniy Vitkovskiy |
title |
A Probabilistic Spatial Distribution Model for Wire Faults in Parallel Network-on-Chip Links |
title_short |
A Probabilistic Spatial Distribution Model for Wire Faults in Parallel Network-on-Chip Links |
title_full |
A Probabilistic Spatial Distribution Model for Wire Faults in Parallel Network-on-Chip Links |
title_fullStr |
A Probabilistic Spatial Distribution Model for Wire Faults in Parallel Network-on-Chip Links |
title_full_unstemmed |
A Probabilistic Spatial Distribution Model for Wire Faults in Parallel Network-on-Chip Links |
title_sort |
probabilistic spatial distribution model for wire faults in parallel network-on-chip links |
publisher |
Hindawi Limited |
series |
Mathematical Problems in Engineering |
issn |
1024-123X 1563-5147 |
publishDate |
2015-01-01 |
description |
High-performance chip multiprocessors contain numerous parallel-processing cores where a fabric devised as a network-on-chip (NoC) efficiently handles their escalating intertile communication demands. Unfortunately, prolonged operational stresses cause accelerated physically induced wearout leading to permanent metal wire faults in links. Where only a subset of wires may malfunction, enduring healthy wires are leveraged to sustain connectivity when a partially faulty link recovery mechanism is utilized, where its data recovery latency overhead is proportional to the number of consecutive faulty wires. With NoC link failure models being ultimately important, albeit being absent from existing literature, the construction of a mathematical model towards the understanding of the distribution of wire faults in parallel on-chip links is very critical. This paper steps in such a direction, where the objective is to find the probability of having a “fault segment” consisting of a certain number of consecutive “faulty” wires in a parallel NoC link. First, it is shown how the given problem can be reduced to an equivalent combinatorial problem through partitions and necklaces. Then the proposed algorithm counts certain classes of necklaces by making a separation between periodic and aperiodic cases. Finally, the resulting analytical model is tested successfully against a far more costly brute-force algorithm. |
url |
http://dx.doi.org/10.1155/2015/410172 |
work_keys_str_mv |
AT arseniyvitkovskiy aprobabilisticspatialdistributionmodelforwirefaultsinparallelnetworkonchiplinks AT paulchristodoulides aprobabilisticspatialdistributionmodelforwirefaultsinparallelnetworkonchiplinks AT vassossoteriou aprobabilisticspatialdistributionmodelforwirefaultsinparallelnetworkonchiplinks AT arseniyvitkovskiy probabilisticspatialdistributionmodelforwirefaultsinparallelnetworkonchiplinks AT paulchristodoulides probabilisticspatialdistributionmodelforwirefaultsinparallelnetworkonchiplinks AT vassossoteriou probabilisticspatialdistributionmodelforwirefaultsinparallelnetworkonchiplinks |
_version_ |
1725359570367283200 |