Date: Wed, 15 Jan 1997 00:27:32 GMT Server: Apache/1.0.5 Content-type: text/html Content-length: 2236 Last-modified: Wed, 26 Oct 1994 20:33:03 GMT
The gossip problem is easy to pose: each vertex in a graph initially holds a unique piece of information to be communicated to all other vertices. At each time step, a vertex can only communicate with its neighbors. Information can be freely combined between communication steps. Variants of the gossip problem involve minimizing the total number of communications or the total time, under a variety of restrictions on which communication steps are allowed. The following two papers deal mainly with the case where each vertex can only send to or receive from one neighbor at a time:
My work in parallel programming has mainly involved debugging support:
- David Krumme, krumme@cs.tufts.edu