Sciweavers

403 search results - page 2 / 81
» An algebra for commitment protocols
Sort
View
PODS
1999
ACM
127views Database» more  PODS 1999»
13 years 9 months ago
Atomicity with Incompatible Presumptions
We identify one of the incompatibility problems associated with atomic commit :protocols that prevents them from being used together and weiderive a correctness criterion that cap...
Yousef J. Al-Houmaily, Panos K. Chrysanthis
ISCIS
2004
Springer
13 years 10 months ago
Correctness Requirements for Multiagent Commitment Protocols
Abstract. Commitments are a powerful abstraction for representing the interactions between agents. Commitments capture the content of the interactions declaratively and allow agent...
Pinar Yolum
PCI
2001
Springer
13 years 9 months ago
Two-Phase Commit Processing with Restructured Commit Tree
Abstract. Extensive research has been carried out in search for an efcient atomic commit protocol and many optimizations have been suggested to improve the basic two-phase commit p...
George Samaras, George K. Kyrou, Panos K. Chrysant...
CRYPTO
2001
Springer
153views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Universally Composable Commitments
d Abstract) Ran Canetti and Marc Fischlin Abstract. We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantee...
Ran Canetti, Marc Fischlin
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 6 months ago
Adjourn State Concurrency Control Avoiding Time-Out Problems in Atomic Commit Protocols
Abstract-- The use of atomic commit protocols in mobile adhoc networks involves difficulties in setting up reasonable timeouts for aborting a pending distributed transaction. This ...
George Samaras, Martin Hett, Panos K. Chrysanthis,...