1124 search results - page 6 / 225 » Refined quorum systems |
102
click to vote
ICDCS
2000
IEEE
15 years 1 months ago
2000
IEEE
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
103
click to vote
IEEEARES
2008
IEEE
15 years 3 months ago
2008
IEEE
We consider scheduling real-time tasks in the presence of message loss and Byzantine node failures in unreliable networks. We present scheduling algorithms called RTQG and RTQG-B....
PODC
2004
ACM
15 years 2 months ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
86
Voted
DSN
2000
IEEE
15 years 1 months ago
2000
IEEE
Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of...
117
click to vote
ICDCS
1997
IEEE
15 years 1 months ago
1997
IEEE
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of Maekawa's grid based quorum scheme. The size of ...