Issue No. 06 - June (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.242157
<p>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.</p>
Index TermsF-channels; concurrency; communication channel; distributed algorithms; alternatepaths; concurrency control; distributed algorithms
M. Ahuja, "An Implementation of F-Channels," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 658-667, 1993.