Sciweavers

403 search results - page 44 / 81
» An algebra for commitment protocols
Sort
View
ISCA
2008
IEEE
134views Hardware» more  ISCA 2008»
15 years 6 months ago
Flexible Decoupled Transactional Memory Support
A high-concurrency transactional memory (TM) implementation needs to track concurrent accesses, buffer speculative updates, and manage conflicts. We present a system, FlexTM (FLE...
Arrvindh Shriraman, Sandhya Dwarkadas, Michael L. ...
VLDB
1994
ACM
84views Database» more  VLDB 1994»
15 years 3 months ago
A Transaction Replication Scheme for a Replicated Database with Node Autonomy
Many proposed protocols for replicated databases consider centralized control of each transaction so that given a transaction, some site will monitor the remote data access and tr...
Ada Wai-Chee Fu, David Wai-Lok Cheung
ACSC
2008
IEEE
15 years 6 months ago
On illegal composition of first-class agent interaction protocols
In this paper, we examine the composition of firstclass protocols for multi-agent systems. First-class protocols are protocols that exist as executable specifications that agent...
Tim Miller, Peter McBurney
DRM
2003
Springer
15 years 5 months ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
WWW
2005
ACM
16 years 15 days ago
An abuse-free fair contract signing protocol based on the RSA signature
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
Guilin Wang