On the relative speed of messages and hierarchical channels

Abstract

The authors study the concept of relative speed of messages and a hierarchy of such speeds which results in a hierarchical channel. They present examples of applications where hierarchical channels are useful and an implementation of such a channel using selective flooding. They describe a mechanism that permits a programmer to specify a partial order among channels, and compare the hierarchical channels with F-channels.<>