1119 search results - page 110 / 224 » Computing in the Presence of Timing Failures |
193
Voted
DAC
2005
ACM
16 years 8 months ago
2005
ACM
As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival prob...
167
click to vote
WDAG
1990
Springer
15 years 11 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
212
Voted
ICPADS
1996
IEEE
15 years 11 months ago
1996
IEEE
We have de ne a network programming model called Mobile Assistant Programming (MAP) for development and execution of communication applications in large scale networks of heteroge...
178
click to vote
JSSPP
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we examine the concept of giving every job a trial run before committing it to run until completion. Trial runs allow immediate job failures to be detected shortly a...
149
Voted
HPDC
2007
IEEE
16 years 1 months ago
2007
IEEE
As distributed applications such as Grid and enterprise systems scale up and become increasingly complex, their authorization infrastructures—based predominantly on the request-...