Synchronous circuit-switched broadcasting in two-dimensional torus networks (wraparound meshes) is studied. In computing the complexities, three timing parameters are used: the number of phases to complete the broadcast, the startup time to initiate message transmissions, and the propagation time of messages through the network. Different broadcasting algorithms are proposed, depending on which timing factor is dominant.

The concept of tilting and graph node-covering is used. It is ingenious and interesting. However, it remains to be seen how to apply this concept to general-sized mesh networks. Furthermore, how is the node-covering set determined? If not prearranged, another distributed algorithm to find the set is needed.

Parallel computer systems are important, but if each task must be performed by a specially designed algorithm, the prospect of parallel computing may be endangered.