Sciweavers

313 search results - page 31 / 63
» Computing synchronizer failure probabilities
Sort
View
161
Voted
ICS
2011
Tsinghua U.
14 years 7 months ago
High performance linpack benchmark: a fault tolerant implementation without checkpointing
The probability that a failure will occur before the end of the computation increases as the number of processors used in a high performance computing application increases. For l...
Teresa Davies, Christer Karlsson, Hui Liu, Chong D...
144
Voted
EUC
2007
Springer
15 years 9 months ago
Low-Cost and Strong-Security RFID Authentication Protocol
This paper proposes a low-cost and strong-security RFID protocol to reduce the computational load on both the back-end database and the tags in an RFID system. When desynchronizati...
JaeCheol Ha, Sang-Jae Moon, Juan Manuel Gonz&aacut...
130
Voted
JLP
2007
99views more  JLP 2007»
15 years 3 months ago
Resources in process algebra
The algebra of communicating shared resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the ...
Insup Lee, Anna Philippou, Oleg Sokolsky
118
Voted
MMB
2010
Springer
180views Communications» more  MMB 2010»
15 years 5 months ago
ResiLyzer: A Tool for Resilience Analysis in Packet-Switched Communication Networks
We present a tool for the analysis of fault-tolerance in packet-switched communication networks. Network elements like links or routers can fail or unexpected traffic surges may o...
David Hock, Michael Menth, Matthias Hartmann, Chri...
103
Voted
CONEXT
2008
ACM
15 years 5 months ago
Recursive temporal namespaces
Recursive temporal (RT) namespaces extend spatial namespaces such as IP with the notion of a nested time interval. RT namespace is an architectural approach to dealing with the un...
Venkata K. Pingali, Joseph D. Touch