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)
Analysis of the resequencing delay for M/M/m systems
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Computer networks: 2nd edition
Computer networks: 2nd edition
Preserving and using context information in interprocess communication
ACM Transactions on Computer Systems (TOCS)
The Mean Resequencing Delay for M/H/sub K// Infinity Systems
IEEE Transactions on Software Engineering
Flush primitives for asynchronous distributed systems
Information Processing Letters
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)
Modeling, implementing, and tools for studying logical process-to-process channels in asynchronous distributed systems
A response to Cheriton and Skeen's criticism of causal and totally ordered communication
ACM SIGOPS Operating Systems Review
Understanding the limitations of causally and totally ordered communication
SOSP '93 Proceedings of the fourteenth ACM symposium on Operating systems principles
Assertations about past and future in Highways: Global flush broadcast and flush-vector-time
Information Processing Letters
Communicating sequential processes
Communications of the ACM
An Implementation of F-Channels
IEEE Transactions on Parallel and Distributed Systems
Fast batched data transfer with flush channels: A performance analysis
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
High performance distributed computing systems require high performance communication systems. F-channels and Hierarchical F-channels address this need by permitting a high level of concurrency like non-FIFO channels while retaining the simplicity of FIFO channels critical to the design and proof of many distributed algorithms. In this paper, we present counter-based implementations for F-channels and Hierarchical F-channels using message augmentation-appending control information to a message. These implementations guarantee that no messages are unnecessarily delayed at the receiving end.