#### Filter Results:

#### Publication Year

1993

1998

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Algorithms for performing gossiping on one-and higher dimensional meshes are presented. As a routing model, we assume the practically important worm-hole routing. For one-dimensional arrays and rings, we give a novel lower bound and an asymptotically optimal gossiping algorithm for all choices of the parameters involved. For two-dimensional meshes and tori,… (More)

Several algorithms for performing gossiping on one-and higher dimensional meshes are presented. As a routing model, we assume the practically important worm-hole routing. For one-dimensional arrays, we give a novel lower bound and an asymptotically optimal gossip-ing algorithm. For two-dimensional meshes, we present a simple algorithm composed of… (More)

- ‹
- 1
- ›