Distributed Loop Computer-Networks: A Survey
โ Scribed by J.C. Bermond; F. Comellas; D.F. Hsu
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 867 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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.
## Abstract Distributed computing systems are a viable and less expensive alternative to parallel computers. However, a serious difficulty in concurrent programming of a distributed system is how to deal with scheduling and load balancing of such a system which may consist of heterogeneous computer
Analysis of looped distribution networks is a prerequisite in design or reorga~fization of water supply systems. It involves all iterative methodology which frequently faces divergenceproblem. This paper presents an analysis algorithm that ensures convergence of the solution. Authors'experience in t
The authors wish to thank the anonymous referees for detailed reading of the manuscript. Their comments enabled us to improve the quality of the manuscript considerably, in particular to complete proofs of Lemmas 2 and 5 . We also thank John Shawe-Taylor for careful reading of the final version of t