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
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
Assertations about past and future in Highways: Global flush broadcast and flush-vector-time
Information Processing Letters
Global flush communication primitive for inter-process communication
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Computer Networks
Multimedia Systems: An Overview
IEEE MultiMedia
An Implementation of F-Channels
IEEE Transactions on Parallel and Distributed Systems
Addendum to "Proof Rules for Flush Channels"
IEEE Transactions on Software Engineering
Characterization of message ordering specifications and protocols
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Implementation of hierarchical F-channels for high-performance distributed computing
Distributed Computing
An implementation of F-Channels for possibly cyclic networks
SPDP '92 Proceedings of the 1992 Fourth IEEE Symposium on Parallel and Distributed Processing
On the relative speed of messages and hierarchical channels
SPDP '92 Proceedings of the 1992 Fourth IEEE Symposium on Parallel and Distributed Processing
Assertions about past and future: Communication in a high-performance distributed system Highways
SPDP '93 Proceedings of the 1993 5th IEEE Symposium on Parallel and Distributed Processing
| Hi-index | 0.00 |
A flush channel offers the implementor of a distributed application the flexibility of specifying a message delivery order apropos of the demands of the application. This stands in marked contrast to the rigid FIFO (first-in-first-out) delivery order of communication with a FIFO channel. The more restrictive the delivery order, the less concurrency possible to exploit in message transmissions over a multi-path system. This paper investigates the possible gain in effective network bandwidth when a large amount of information, such as the transmission of image data, is transmitted over a multi-path flush channel as compared to a multi-path FIFO channel. Analytical and simulation results illustrate that the relaxed delivery order restrictions of the flush channel may reduce the mean message response time by a factor of the number of message fragments. This difference may be critical in meeting real-time requirements of an application.