Efficient at-most-once messages based on synchronized clocks
Liskov, B.
Shrira, L.
Wroclawski, J.
Lab. for Comput. Sci., MIT, Cambridge, MA;
This paper appears in: Workstation Operating Systems, 1989., Proceedings of the Second Workshop on
Publication Date: 27-29 Sep 1989
On page(s): 73-81
Meeting Date: 09/27/1989 - 09/29/1989
Location: Pacific Grove, CA, USA
References Cited: 13
INSPEC Accession Number: 3614108
Digital Object Identifier: 10.1109/WWOS.1989.109271
Current Version Published: 2002-08-06
Abstract
A novel message-passing protocol that guarantees at-most-once
message delivery without requiring communication to establish
connections, is described. The authors discuss how to use these messages
to implement higher level primitives such as at-most-once remote
procedure calls (RPC) and describe an implementation of at-most-once
RPCs using their method. Performance measurements indicate that
at-most-once RPCs can be provided at the same cost as less desirable
RPCs that do not guarantee at-most-once execution. The method is based
on the assumption that clocks throughout the system are loosely
synchronized. Modern protocols provide good bounds on clock skew with
high probability; the present method depends on the bound for
performance but not for correctness
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
