Implementation of Fast Data Transfer with Global Flush Broadcasts

9523815 Camp Flush通信通道推广了更传统的异步一对一通信范式。刷新通道为分布式应用程序的实现者提供了根据应用程序的需求指定消息传递顺序的灵活性。这与TCP/IP中的虚拟电路或ATM通信中的虚拟通道指定的严格的FIFO（先进先出）通信交付顺序形成鲜明对比。传递顺序越严格，在多路径系统上的消息传输中利用并发性的可能性就越小。刷新通道允许用户将消息的传递定义为在先前传输的所有消息传递之后，或在随后传输的所有消息传递之前，或两者兼而有之。由用户创建的发送站点和目的地站点之间的交付顺序是部分顺序。先前工作的结果令人鼓舞。无论网络的底层物理结构如何，Flush通信通道都可以大大减少消息的平均传递时间。也就是说，无论通信发生在为TCP/IP或UDP/IP中的虚拟电路或数据报建立的路由上，还是在为ATM适配层提供的无连接服务类D建立的路由上，使用f通道的分布式应用程序的实实者都可以减少通信成本。消息平均传递时间的减少对于满足应用程序的实时需求至关重要。然而，所有先前的结果都只考虑一对一通信的进程间通信（IPC）。本研究的目的是研究当我们将f通道通信扩展到多对多通信时，对实现和性能的影响。＊＊＊

9523815 Camp Flush communication channels generalize the more conventional asynchronous one-to-one communication paradigms. 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 specified by a virtual circuit in TCP/IP or specified by a virtual channel in ATM communication. The more restrictive the delivery order, the less concurrency possible to exploit in message transmissions over a multi-path system. Flush channels allow the user to define the delivery of a message to be after the delivery of all messages previously transmitted, or before the delivery of all messages subsequently transmitted, or both. The delivery order between the sending site and the destination site, created by the user, is a partial order. The results from previous work are encouraging. Flush communication channels can reduce the mean delivery time of messages substantially, regardless of the underlying physical structure of the network. That is, an implementor of a distributed application that uses an F-channel can reduce communication costs whether the communication occurs on routes established for virtual circuit or datagram in TCP/IP or UDP/IP or on routes established for the connectionless service class D provided by the ATM Adaptation Layer. This possible reduction in mean delivery time of messages may be critical in meeting real-time requirements of the application. However, all previous results only consider interprocess communication (IPC) for one-to-one communication. The goal of this research is to investigate the implications of implementation and performance when we extend F-channel communication to many-to-many communication. ***