Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
588
Optimistic Protocols for Multi-Party Fair Exchange
, 1996
"... We describe a generic protocol for fair multi-party exchange of electronic goods over unreliable networks with non-repudiation, where goods are either signatures (i.e., non-repudiation tokens of public data), confidential data, or payments. The protocol does not involve a third party except for rec ..."
Abstract
-
Cited by 34 (3 self)
- Add to MetaCart
We describe a generic protocol for fair multi-party exchange of electronic goods over unreliable networks with non-repudiation, where goods are either signatures (i.e., non-repudiation tokens of public data), confidential data, or payments. The protocol does not involve a third party except
An Optimistic Protocol for a Linearizable Distributed Shared Memory System
- Parallel Processing Letters
, 1996
"... Recently, distributed shared memory systems have received much attention because such an abstraction simplifies programming. In this paper, we present a simple protocol which implements the linearizability consistency criterion in a distributed shared memory system. Unlike previously implemented pr ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
protocols, our protocol is based on an optimistic approach. The protocol eliminates the necessity of potentially expensive synchronization among processors for each write operation, but may require processes to rollback. Keywords : data consistency, distributed shared memory, linearizability, optimistic
Performance of User-Level Communication on Distributed-Memory Multiprocessors with an Optimistic Protocol
, 1993
"... The scalability and performance of parallel applications on distributed-memory multiprocessors depends to a great extent on the performance of communication. Although the communication hardware on distributed-memory multiprocessors can transfer data quickly, applications often fail to achieve commun ..."
Abstract
- Add to MetaCart
, to optimize the common case, processors may send messages optimistically without ensuring that the destination processor of the message has enough buffer space to receive the message. Second, to avoid crossing protection boundaries through expensive traps and software interrupts, the kernel and the user
Distributed Discrete Event Simulation: Optimistic Protocols with Probabilistic Time Window Adaptation
, 1994
"... this paper is meanwhile published as: A. Ferscha and J. Luthi. "Estimating Rollback Overhead for Optimism Control in Timewarp". In: Proceedings of the 28 ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
this paper is meanwhile published as: A. Ferscha and J. Luthi. "Estimating Rollback Overhead for Optimism Control in Timewarp". In: Proceedings of the 28
Optimistic fair exchange of digital signatures
- IEEE Journal on Selected Areas in Communications
, 1998
"... Abstract. We present a new protocol that allows two players to ex-change digital signatures over the Internet in a fair way, so that either each player gets the other’s signature, or neither player does. The ob-vious application is where the signatures represent items of value, for example, an elect ..."
Abstract
-
Cited by 290 (10 self)
- Add to MetaCart
, an electronic check or airline ticket. The protocol can also be adapted to exchange encrypted data. The protocol relies on a trusted third party, but is “optimistic, ” in that the third party is only needed in cases where one player attempts to cheat or simply crashes. A key feature of our protocol is that a
Recovery in Distributed Systems Using Optimistic Message Logging and Checkpointing
, 1988
"... In a distributed system using message logging and checkpointing to provide fault tolerance, there is always a unique maximum recoverable system state, regardless of the message logging protocol used. The proof of this relies on the observation that the set of system states that have occurred during ..."
Abstract
-
Cited by 224 (14 self)
- Add to MetaCart
In a distributed system using message logging and checkpointing to provide fault tolerance, there is always a unique maximum recoverable system state, regardless of the message logging protocol used. The proof of this relies on the observation that the set of system states that have occurred during
Towards Robust Optimistic Approaches
- In Future Directions in Distributed Computing, volume LNCS2584 of Lecture Notes in Computer Science
, 2003
"... this paper, we try to point out the possible causes of the lack of success of some optimistic protocols, and show which directions can be taken to overcome these shortcomings in order to diminish the existing reluctance in industry for this kind of protocols. We think that optimistic protocols will ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
this paper, we try to point out the possible causes of the lack of success of some optimistic protocols, and show which directions can be taken to overcome these shortcomings in order to diminish the existing reluctance in industry for this kind of protocols. We think that optimistic protocols
Message Logging: Pessimistic, Optimistic, and Causal
- IEEE Transactions on Software Engineering
, 1995
"... Message logging protocols are an integral part of a technique for implementing processes that can recover from crash failures. All message logging protocols require that, when recovery is complete, there be no orphan processes, which are surviving processes whose states are inconsistent with the rec ..."
Abstract
-
Cited by 140 (16 self)
- Add to MetaCart
with the recovered state of a crashed process. We give a precise specification of the consistency property "no orphan processes". From this specification, we describe how different existing classes of message logging protocols (namely optimistic, pessimistic, and a class that we call causal) implement
Results 1 - 10
of
588
