Improved gossipings by short messages in 2-dimensional meshes
This paper discusses gossiping problems in two-dimensional meshes under two different models: one-port telephone model and full-port model. It is assumed in both models that only one packet can be transmitted through each link at one time step. Our algorithms are based on very similar ideas and improve on the previous results in (SIAM J. Comput. 27 (1998) 917; IEEE Trans. Parallel Distrib. Systems 10(12) (1999) 1252), respectively. (c) 2004 Elsevier Inc. All rights reserved.
- Publisher
- Academic Press Inc Elsevier Science
- Issue Date
- 2005-07
- Language
- English
- Article Type
- Article
- Keywords
INFORMATION DISSEMINATION; PACKETS; ALGORITHMS
- Citation
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v.65, no.7, pp.793 - 800
- ISSN
- 0743-7315
- Appears in Collection
- CS-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.