loading...
Algorithms and Lower Bounds for P-Gossiping in Circulant Networks
Taipei, Taiwan December 18-December 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.1997.6450831997 International Symposium on Paral ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
E.A. Monakhova, "Algorithms and Lower Bounds for P-Gossiping in Circulant Networks," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 132, 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 1997.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.1997.645083,
author = {E.A. Monakhova},
title = {Algorithms and Lower Bounds for P-Gossiping in Circulant Networks},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {1997},
issn = {1087-4089},
pages = {132},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1997.645083},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - Algorithms and Lower Bounds for P-Gossiping in Circulant Networks
SN - 1087-4089
SP
EP
A1 - E.A. Monakhova,
PY - 1997
KW - broadcast
KW - gossiping
KW - circulant networks
KW - parallel algorithms
KW - multicomputer system
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
E.A. Monakhova, Sibirian Division of Russian Academy of Sciences,
We consider the broadcast and gossiping problems in circulant networks. The circulant graphs are studied extensively as reliable interconnection networks for the multiprocessor systems. We consider gossiping in the store-and-forward, full-duplex and shouting model for the case when communicating nodes can exchange up to a fixed number p of packets at each round of gossiping (p-gossiping). A general method for evaluation of the lower bounds for p-gossiping in circulant graphs is established. The parallel decentralized node-invariant broadcast and p-gossiping algorithms are proposed which provide the minimum execution time and the minimum of message loading of the network during message-passing.
Index Terms:
broadcast, gossiping, circulant networks, parallel algorithms, multicomputer system
Citation:
E.A. Monakhova, "Algorithms and Lower Bounds for P-Gossiping in Circulant Networks," ispan, pp.132, 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.