Sciweavers

13214 search results - page 2583 / 2643
» Pseudorandomness for network algorithms
Sort
View
137
Voted
EUROSYS
2008
ACM
16 years 1 months ago
DepSpace: a byzantine fault-tolerant coordination service
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
Alysson Neves Bessani, Eduardo Adílio Pelin...
EUROSYS
2006
ACM
16 years 1 months ago
The SMART way to migrate replicated stateful services
Many stateful services use the replicated state machine approach for high availability. In this approach, a service runs on multiple machines to survive machine failures. This pap...
Jacob R. Lorch, Atul Adya, William J. Bolosky, Ron...
SOSP
2005
ACM
16 years 27 days ago
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...
167
Voted
SOSP
2007
ACM
16 years 27 days ago
Dynamo: amazon's highly available key-value store
Reliability at massive scale is one of the biggest challenges we face at Amazon.com, one of the largest e-commerce operations in the world; even the slightest outage has significa...
Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, ...
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
16 years 27 days ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
« Prev « First page 2583 / 2643 Last » Next »