Sciweavers

995 search results - page 4 / 199
» Wire-speed total order
Sort
View
HPDC
1997
IEEE
13 years 11 months ago
Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols
This paper compares the throughput and latency of four protocols that provide total ordering. Two of these protocols are measured with and without message packing. We used a techn...
Roy Friedman, Robbert van Renesse
DAGSTUHL
1994
13 years 8 months ago
A High Performance Totally Ordered Multicast Protocol
This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable, atomic multicast service on top of an unreliable multicast datagram service su...
Brian Whetten, Todd Montgomery, Simon M. Kaplan
SOSP
1993
ACM
13 years 8 months ago
Understanding the Limitations of Causally and Totally Ordered Communication
Causally and totally ordered communication support (CATOCS) has been proposed as important to provide as part of the basic building blocks for constructing reliable distributed sy...
David R. Cheriton, Dale Skeen
IPPS
2006
IEEE
14 years 1 months ago
Wire-speed total order
— Many distributed systems may be limited in their performance by the number of transactions they are able to support per unit of time. In order to achieve fault tolerance and to...
Tal Anker, Danny Dolev, G. Greenman, I. Shnaiderma...
ICIP
2009
IEEE
13 years 5 months ago
Total variation projection with first order schemes
This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual form...
Mohamed-Jalal Fadili, Gabriel Peyré