Sciweavers

1677 search results - page 321 / 336
» On the Completeness of Quantum Computation Models
Sort
View
NSDI
2007
15 years 2 months ago
An Experimentation Workbench for Replayable Networking Research
The network and distributed systems research communities have an increasing need for “replayable” research, but our current experimentation resources fall short of reaching th...
Eric Eide, Leigh Stoller, Jay Lepreau
NSDI
2004
15 years 1 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
NSDI
2004
15 years 1 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
NSDI
2004
15 years 1 months ago
Consistent and Automatic Replica Regeneration
Reducing management costs and improving the availability of large-scale distributed systems require automatic replica regeneration, i.e., creating new replicas in response to repl...
Haifeng Yu, Amin Vahdat
CONCUR
2010
Springer
15 years 24 days ago
Obliging Games
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
Krishnendu Chatterjee, Florian Horn, Christof L&ou...