Time optimal algorithms for multiple node broadcast and single node scatter in distributed loop networks have been proposed in this paper. These algorithms involve the minimum number of packet transmissions to effect both multiple node broadcast and single node scatter. O 1995 Academic Press, Inc.
β¦ LIBER β¦
Optimal elections in faulty loop networks and applications
β Scribed by Mans, B.; Santoro, N.
- Book ID
- 119772791
- Publisher
- IEEE
- Year
- 1998
- Tongue
- English
- Weight
- 360 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0018-9340
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Optimal Communication Algorithms in Dist
β
R.K. Das; B.P. Sinha
π
Article
π
1995
π
Elsevier Science
π
English
β 500 KB
Time-optimal leader election in general
β
David Peleg
π
Article
π
1990
π
Elsevier Science
π
English
β 493 KB
Minimal diameter double-loop networks: D
β
J.-C. Bermond; Dvora Tzvieli
π
Article
π
1991
π
John Wiley and Sons
π
English
β 370 KB
This article deals with the problem of minimizing the transmission delay in Illiac-type interconnection networks for parallel or distributed architectures or in local area networks. A double-loop network (also known as circulant) G(n,h), consists of a loop of n vertices where each vertex i is also j
Optimal distributed t-resilient election
β
Itai, A.; Kutten, S.; Wolfstahl, Y.; Zaks, S.
π
Article
π
1990
π
IEEE
π
English
β 582 KB
On Performance Analysis of IASENβ3 in Fa
β
Bhardwaj, Ved Prakash; Nitin,
π
Article
π
2013
π
Elsevier
β 293 KB
An Optimization Problem in Distributed L
β
J.-C. BERMOND; G. ILLIADES; C. PEYRAT
π
Article
π
1989
π
John Wiley and Sons
π
English
β 414 KB