1119 search results - page 52 / 224 » Computing in the Presence of Timing Failures |
157
click to vote
GRID
2004
Springer
15 years 11 months ago
2004
Springer
A major hurdle facing data intensive grid applications is the appropriate handling of failures that occur in the grid-environment. Implementing the fault-tolerance transparently a...
194
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provi...
159
click to vote
DSN
2005
IEEE
15 years 12 months ago
2005
IEEE
Designing a distributed fault tolerance algorithm requires careful analysis of both fault models and diagnosis strategies. A system will fail if there are too many active faults, ...
140
click to vote
CONCUR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a discretely timed spi-calculus. A primitive for key compromise allows us to model key compromise attacks, thus going beyond the standard Dolev–Yao attacker ...
159
click to vote
WCNC
2008
IEEE
16 years 20 days ago
2008
IEEE
—In this paper, we present a reliable real-time data delivery (communication) mechanism for ad-hoc networks, called RTRD. The mechanism makes use of a proactive wireless routing ...