Using message passing for distributed programming: proof rules and disciplines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Multiparty Interactions for Interprocess Communication and Synchronization
IEEE Transactions on Software Engineering
Programming distributed systems
Programming distributed systems
Flush primitives for asynchronous distributed systems
Information Processing Letters
Process algebra
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Topics in distributed algorithms
Topics in distributed algorithms
The causal ordering abstraction and a simple way to implement it
Information Processing Letters
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Causal controversy at Le Mont St.-Michel
ACM SIGOPS Operating Systems Review
A superimposition control construct for distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed operating systems
Verifying programs that use causally-ordered message-passing
Science of Computer Programming
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Implementing remote procedure calls
ACM Transactions on Computer Systems (TOCS)
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
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Reliable Distributed Computing with the ISIS Toolkit
Reliable Distributed Computing with the ISIS Toolkit
Logically Instantaneous Message Passing in Asynchronous Distributed Systems
IEEE Transactions on Computers
From Synchronous to Asynchronous Communication
Proceedings of the BCS-FACS Workshop on Specification and Verification of Concurrent Systems
The Semantics of Blocking and Nonblocking Send and Receive Primitives
Proceedings of the 8th International Symposium on Parallel Processing
A New Algorithm to Implement Causal Ordering
Proceedings of the 3rd International Workshop on Distributed Algorithms
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
A Non-Blocking Lightweight Implementation of Causal Order Message Delivery
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
The MPI Standard for Message Passing
HPCN Europe 1994 Proceedings of the nternational Conference and Exhibition on High-Performance Computing and Networking Volume II: Networking and Tools
The Use of Efficient Broadcast Protocols in Asynchronous Distributed Systems
The Use of Efficient Broadcast Protocols in Asynchronous Distributed Systems
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
The concept of causal-phase ordering for overlapped broadcasts
ACM SIGOPS Operating Systems Review
The Journal of Supercomputing
A hierarchy of communication models for message sequence charts
Science of Computer Programming
Logically Instantaneous Communication on Top of Distributed Memory Parallel Machines
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Shortcut Replay: A Replay Technique for Debugging Long-Running Parallel Programs
ASIAN '02 Proceedings of the7th Asian Computing Science Conference on Advances in Computing Science: Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Universal Constructs in Distributed Computations
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Vector time and causality among abstract events in distributed computations
Distributed Computing
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
On the complexity of buffer allocation in message passing systems
Journal of Parallel and Distributed Computing
Stopping safely hierarchical distributed components: application to GCM
Proceedings of the 2008 compFrame/HPC-GECO workshop on Component based high performance
An automata-based approach to property testing in event traces
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
Local computations on closed unlabelled edges: the election problem and the naming problem
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
A hybrid message Logging-CIC protocol for constrained checkpointability
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Hi-index | 0.00 |
This article studies characteristic properties of synchronous and asynchronous message communications in distributed systems. Based on the causality relation between events in computations with asynchronous communications, we characterize computations which are realizable with synchronous communications, which respect causal order, or where messages between two processes are always received in the order sent. It is shown that the corresponding computation classes form a strict hierarchy. Furthermore, an axiomatic definition of distributed computations with synchronous communications is given, and it is shown that several informal characterizations of such computations are equivalent when they are formalized appropriately. As an application, we use our results to show that the distributed termination detection algorithm by Dijkstra et al. is correct under a weaker synchrony assumption than originally stated.