82 search results - page 5 / 17 » dc 2001 |
DC
2008
13 years 7 months ago
2008
DC
2006
13 years 7 months ago
2006
Abstract. Paxos and Fast Paxos are optimal consensus algorithms that are simple and elegant, while suitable for efficient implementation. In this paper, we compare the performance ...
DC
2007
13 years 7 months ago
2007
d bins abstraction and works in two phases. The main novelty of the work is in the first phase where the number of contending processes is reduced in a controlled manner. Probabil...
DC
2000
13 years 7 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
DC
2001
13 years 8 months ago
2001
In this paper, we consider the design of a new metadata format to advance scholarly communication over the Internet. This format is designed to be used within the Open Archives In...