Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Theoretical Computer Science
Synchronization of asynchronous processes in CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
Process Synchronization: Design and Performance Evaluation of Distributed Algorithms
IEEE Transactions on Software Engineering
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
The causal ordering abstraction and a simple way to implement it
Information Processing Letters
Ordered and reliable multicast communication
ACM Transactions on Computer Systems (TOCS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Communications of the ACM
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Communicating sequential processes
Communications of the ACM
Distributed processes: a concurrent programming concept
Communications of the ACM
Logically Instantaneous Message Passing in Asynchronous Distributed Systems
IEEE Transactions on Computers
Fault-Tolerant Total Order Multicast to Asynchronous Groups
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Synchronous, asynchronous, and causally ordered communication
Distributed Computing
Communication and Synchronization in Distributed Systems
IEEE Transactions on Software Engineering
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
| Hi-index | 0.00 |
Communication is Logically Instantaneous (LI) if it is possible to timestamp communication events with integers in such a way that (1) timestamps increase within each process and (2) the sending and the delivery events associated with each message have the same times-tamp. So, there is a logical time frame in which for each message, the send event and the corresponding delivery events occur simultaneously. li is stronger than Causally Ordered (CO) communication, but weaker than Rendezvous (RDV) communication. This paper explores Logically Instantaneous communication and provides a simple and efficient protocol that implements li on top of asynchronous distributed systems. li is attractive as it includes co and provides more concurrency than rdv. Moreover it allows to adopt the following approach: first design a distributed application assuming Rendezvous communication, and then run it on top of an asynchronous distributed system providing only li communication.