2009 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition 2009
DOI: 10.1109/date.2009.5090668
|View full text |Cite
|
Sign up to set email alerts
|

Synthesis of low-overhead configurable source routing tables for network interfaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2010
2010
2015
2015

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 22 publications
(8 citation statements)
references
References 19 publications
0
8
0
Order By: Relevance
“…We also estimated that each routing table requires 450 cycles to update, representing a serial write process for 15 routes of 15 hops each, writing 2 bits per hop [49]. In these experiments the network discovery period starts when the fault is injected to demonstrate the worst-case performance of our solution.…”
Section: E Runtime Faulty Behaviormentioning
confidence: 99%
“…We also estimated that each routing table requires 450 cycles to update, representing a serial write process for 15 routes of 15 hops each, writing 2 bits per hop [49]. In these experiments the network discovery period starts when the fault is injected to demonstrate the worst-case performance of our solution.…”
Section: E Runtime Faulty Behaviormentioning
confidence: 99%
“…In [14], authors propose a synthesis approach that, depending on the degree of routing flexibility, can significantly reduce the area cost of fully reprogrammable routing tables by adopting partially reprogrammable routing logic. This solution implements configurable routing, which allows bypassing faulty nodes or links without impacting the consistency of traffic flows.…”
Section: Related Workmentioning
confidence: 99%
“…Through native execution profiling, we found that the time required for the distributed resource manager to recompute the routing tables is approximately constant at 10,000 cycles. We also computed that each routing table requires 450 cycles to update, representing a serial write process for 15 routes of 15 hops each, writing 2 bits per hop [18]. We began the network discovery period at the time of fault injection to demonstrate the worst-case performance of our solution.…”
Section: Dynamic Fault Behaviormentioning
confidence: 99%