The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (1993 vol.4)
pp: 658-667
ABSTRACT
<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 TERMS
Index TermsF-channels; concurrency; communication channel; distributed algorithms; alternatepaths; concurrency control; distributed algorithms
CITATION
M. Ahuja, "An Implementation of F-Channels", IEEE Transactions on Parallel & Distributed Systems, vol.4, no. 6, pp. 658-667, June 1993, doi:10.1109/71.242157
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool