82 search results - page 7 / 17 » dc 2001 |
70
Voted
DC
2010
14 years 10 months ago
2010
d Abstract) Marcos K. Aguilera1 , Eli Gafni1,2 , and Leslie Lamport1 1 Microsoft Research Silicon Valley 2 UCLA We propose and solve a synchronization problem called the mailbox pr...
DC
2010
14 years 10 months ago
2010
Abstract Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as w...
DC
2008
14 years 10 months ago
2008
This paper determines necessary and sufficient conditions to implement wait-free and non-blocking contention managers in a shared memory system. The necessary conditions hold even...
84
Voted
DC
2006
14 years 10 months ago
2006
We consider the problem of how to schedule t similar and independent tasks to be performed in a synchronous distributed system of p stations communicating via multiple-access chan...
DC
2006
14 years 10 months ago
2006
Some well-known primitive operations, such as compare-and-swap, can be used, together with read and write, to implement any object in a wait-free manner. However, this paper shows ...