1993 4th Workshop on Future Trends of Distributed Computing Systems, 1993
... Aleta Ricciardi1, Andr e Schiper2, Kenneth Birman1 Department of Computer Science, Upson Hall... more ... Aleta Ricciardi1, Andr e Schiper2, Kenneth Birman1 Department of Computer Science, Upson Hall Cornell University Ithaca, NY 14853-7501 Abstract ... Eventually, some Sk is isolated; in the worst case Sk is the singleton fpg. Take S = Sk. ...
Large-scale distributed systems may be required to estimate the number of non-faulty processes pr... more Large-scale distributed systems may be required to estimate the number of non-faulty processes present in the group at a given point of time. The problem is related to aggregation, and several solutions have been proposed. In this paper, we present two new sampling-based algorithms for estimation in dynamic groups (i.e., where processes are constantly joining and crashing), and thoroughly evaluate them using real-life traces. One scheme spreads a gossip into the overlay first, and then samples the receipt times of this gossip at different processes. The second scheme measures the density of processes when their identifiers are hashed into a real interval. The schemes have low latency, per-process overheads, while providing high levels of probabilistic accuracy. We present simulation studies that measure and compare the performance of these approaches in static groups, and groups with significant turnaround (arrival and departure) of processes. The latter are done by using traces fro...
General co-chairs: Tohru Asami, The University of Tokyo Teruo Higashino, Osaka University Program... more General co-chairs: Tohru Asami, The University of Tokyo Teruo Higashino, Osaka University Program co-chairs: Ali Ghodsi, UC Berkeley Toru Hasegawa, KDDI R&D Laboratories Mark Jelasity, University of Szeged and Hungarian Academy of Sciences ... Industrial liaison chair: Dick Epema, Delft University of Technology Local arrangement chair: Atsushi Tagami, KDDI R&D Laboratories Publication chair: Satoshi Nishiyama, KDDI ... Program committee: Karl Aberer, EPFL Marinho Barcellos, Fed Uni of Rio Grande Danny Bickson, Carnegie Mellon ...
2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06), 2006
PLATO is a predictive total ordering protocol designed for low-latency multicast in datacenters. ... more PLATO is a predictive total ordering protocol designed for low-latency multicast in datacenters. It predicts out-of- order arrival of multicast packets by observing their inter- arrival times, and delays packets before passing them up to the application only if it believes the packets to have arrived in the wrong order. We show through experimentation on real datacenter-style networks that the
1993 4th Workshop on Future Trends of Distributed Computing Systems, 1993
... Aleta Ricciardi1, Andr e Schiper2, Kenneth Birman1 Department of Computer Science, Upson Hall... more ... Aleta Ricciardi1, Andr e Schiper2, Kenneth Birman1 Department of Computer Science, Upson Hall Cornell University Ithaca, NY 14853-7501 Abstract ... Eventually, some Sk is isolated; in the worst case Sk is the singleton fpg. Take S = Sk. ...
Large-scale distributed systems may be required to estimate the number of non-faulty processes pr... more Large-scale distributed systems may be required to estimate the number of non-faulty processes present in the group at a given point of time. The problem is related to aggregation, and several solutions have been proposed. In this paper, we present two new sampling-based algorithms for estimation in dynamic groups (i.e., where processes are constantly joining and crashing), and thoroughly evaluate them using real-life traces. One scheme spreads a gossip into the overlay first, and then samples the receipt times of this gossip at different processes. The second scheme measures the density of processes when their identifiers are hashed into a real interval. The schemes have low latency, per-process overheads, while providing high levels of probabilistic accuracy. We present simulation studies that measure and compare the performance of these approaches in static groups, and groups with significant turnaround (arrival and departure) of processes. The latter are done by using traces fro...
General co-chairs: Tohru Asami, The University of Tokyo Teruo Higashino, Osaka University Program... more General co-chairs: Tohru Asami, The University of Tokyo Teruo Higashino, Osaka University Program co-chairs: Ali Ghodsi, UC Berkeley Toru Hasegawa, KDDI R&D Laboratories Mark Jelasity, University of Szeged and Hungarian Academy of Sciences ... Industrial liaison chair: Dick Epema, Delft University of Technology Local arrangement chair: Atsushi Tagami, KDDI R&D Laboratories Publication chair: Satoshi Nishiyama, KDDI ... Program committee: Karl Aberer, EPFL Marinho Barcellos, Fed Uni of Rio Grande Danny Bickson, Carnegie Mellon ...
2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06), 2006
PLATO is a predictive total ordering protocol designed for low-latency multicast in datacenters. ... more PLATO is a predictive total ordering protocol designed for low-latency multicast in datacenters. It predicts out-of- order arrival of multicast packets by observing their inter- arrival times, and delays packets before passing them up to the application only if it believes the packets to have arrived in the wrong order. We show through experimentation on real datacenter-style networks that the
Uploads
Papers by K. Birman