Sciweavers

2214 search results - page 127 / 443
» Dynamic Protocol Recovery
Sort
View
ISCA
2002
IEEE
104views Hardware» more  ISCA 2002»
13 years 10 months ago
Speculative Dynamic Vectorization
Traditional vector architectures have shown to be very effective for regular codes where the compiler can detect data-level parallelism. However, this SIMD parallelism is also pre...
Alex Pajuelo, Antonio González, Mateo Valer...
ESA
2001
Springer
110views Algorithms» more  ESA 2001»
14 years 2 months ago
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
Andrea E. F. Clementi, Angelo Monti, Riccardo Silv...
SIGCOMM
2000
ACM
14 years 2 months ago
FIRE: Flexible intra-AS routing environment
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and th...
Craig Partridge, Alex C. Snoeren, W. Timothy Stray...
CONCUR
2008
Springer
14 years 6 days ago
Modeling Computational Security in Long-Lived Systems
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
MOBICOM
2006
ACM
14 years 4 months ago
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
Hannes Frey, Ivan Stojmenovic