We develop an approach in which we model communication protocols via commitment machines. Commitment machines supply a content to protocol states and actions in terms of the social...
Commitment protocols formalize interactions among autonomous, heterogeneous agents, leaving the agents’ local policies unspecified. This paper studies the problem of agents ena...
W e investigate here the performance implications of supporting transaction atomicity in a distributed realtime database system. Using a detailed simulation model of a firm-deadli...
Ramesh Gupta, Jayant R. Haritsa, Krithi Ramamritha...
This paper describes the presumed-either two-phase commit protocol. Presumed-either exploits log piggybacking to reduce the cost of committing transactions. If timely piggybacking ...
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...