Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Information Processing Letters
Substituting for real time and common knowledge in asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Concurrent common knowledge: a new definition of agreement for asynchronous systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Preserving and using context information in interprocess communication
ACM Transactions on Computer Systems (TOCS)
Flush primitives for asynchronous distributed systems
Information Processing Letters
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Synchronization in Distributed Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer Networks
The Role of Inhibition on Asynchronous Consistent-Cut Protocols
Proceedings of the 3rd International Workshop on Distributed Algorithms
Observing Global States of Asynchronous Distributed Applications
Proceedings of the 3rd International Workshop on Distributed Algorithms
An (N -1)-Resilient Algorithm for Distributed Termination Detection
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Implementation of hierarchical F-channels for high-performance distributed computing
Distributed Computing
Fast batched data transfer with flush channels: A performance analysis
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
An F-channel can permit as much concurrency as a non-first-in-first-out (FIFO)communication channel and yet retain the properties of a FIFO channel that lead tosimplicity of reasoning in design and proofs of the correctness of distributed algorithms.The author presents an implementation of an F-channel on top of a non-FIFO channelthat derives its non-FIFO nature from a message taking any of the alternate paths fromthe source to the destination in the underlying network in which each channel is either anF-channel implemented using some other implementation or recursively using theimplementation presented or a FIFO channel. The correctness of the implementation isproven.