301 search results - page 8 / 61 » On bounding the delay of a critical path |
FPL
2007
Springer
14 years 11 months ago
2007
Springer
Reconfiguration time in dynamically-reconfigurable modular systems can severely limit application run-time compared to the critical path delay. In this paper we present a novel ...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
91
Voted
DAC
2004
ACM
15 years 10 months ago
2004
ACM
Current Static Timing Analysis (STA) techniques allow one to verify the timing of a circuit at different process corners which only consider cases where all the supplies are low o...
74
Voted
MST
2002
14 years 9 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
75
Voted
VLSISP
2008
14 years 9 months ago
2008
Cryptographic substitution boxes (S-boxes) are an integral part of modern block ciphers like the Advanced Encryption Standard (AES). There exists a rich literature devoted to the ...