On modelling a type of communications in some communications intensive applications

The author considers the problem of modeling a type of communications in some communications-intensive applications such as the parallel sort algorithm and parallel computation of the transitive closure of binary relations. The special characteristics of this type of communications are (1) every site will exchange (receive and transfer) the information with all the other sites, and (2) each site can only do one thing (receive from a site or transfer to a site) at a time. The communication which satisfies (1) and (2) is called a complete communication. A complete communication among eight sites is taken as an example