Sciweavers

2702 search results - page 183 / 541
» Message from the Editor
Sort
View
ICDCS
1996
IEEE
15 years 10 months ago
How to Recover Efficiently and Asynchronously when Optimism Fails
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
Om P. Damani, Vijay K. Garg
SPDP
1993
IEEE
15 years 10 months ago
The Meerkat Multicomputer
Meerkat is a distributed memory multicomputer architecture that scales to hundreds of processors. Meerkat uses a two dimensional passive backplane to connect nodes composed of pro...
Robert C. Bedichek, Curtis Brown
SRDS
1994
IEEE
15 years 10 months ago
Probabilistic Internal Clock Synchronization
We propose an improved probabilistic method for reading remote clocks in systems subject to unbounded communication delays and use this method to design a family of fault-tolerant...
Flaviu Cristian, Christof Fetzer
DEBS
2007
ACM
15 years 10 months ago
Prefix forwarding for publish/subscribe
We present a prefix forwarding algorithm for content-based publish/subscribe systems. Our algorithm performs only one content-based match per message regardless of the number of r...
Zbigniew Jerzak, Christof Fetzer
FC
2010
Springer
191views Cryptology» more  FC 2010»
15 years 10 months ago
Using Sphinx to Improve Onion Routing Circuit Construction
This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit constru...
Aniket Kate, Ian Goldberg