Optimal Distributed Algorithms in Unlabeled Tori and Chordal Rings

Journal of Parallel and Distributed Computing

Volumn 46, Issue 1, 1997, Pages 80-90

  Mans, Bernard ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002040464     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1997.1389     Document Type: Article

References (22)

1. Arden B. W., Lee H. Analysis of chordal ring. IEEE Trans. Comput. C-30:Apr. 1981;291-295.
2. Attiya H., van Leeuwen J., Santoro N., Zaks S. Efficient elections in chordal ring networks. Algorithmica. 4:1989;437-446.
3. Bermond J.-C., Comellas F., Hsu D. F. Distributed loop computer networks: A survey. J. Parallel Distrib. Comput. 24:1995;2-10.
4. Bruck J., Cypher R., Ho C.-T. Fault-tolerant meshes and hypercubes with minimal numbers of spares. IEEE Trans. Comput. 42:Sept. 1993;1089-1104.
5. S. Dobrev, P. Ruzicka, 1997, Linear broadcasting andnn, Proc. of the 4th International Colloquium on Structural Information and Communication Complexity, Sirocco'97, Ascona, Switzerland.
6. Flocchini P., Mans B. Optimal elections in labeled hypercubes. J. Parallel Distrib. Comput. 33:1996;76-83.
7. P. Flocchini, B. Mans, N. Santoro, 1994, Sense of direction: Formal definition and properties, Proc. of 1st Colloquium on Structural Information and Communication Complexity, 9, 34, Ottawa, Canada.
8. Flocchini P., Mans B., Santoro N. On the impact of sense of direction on message complexity. Inform. Process. Lett. 63:1997;23-31.
9. Gallager R. G., Humblet P. A., Spira P. M. A distributed algorithm for minimum spanning tree. ACM Trans. Programming Languages Systems. 5:1983;66-77.
10. Kalamboukis T. Z., Mantzaris S. L. Towards optimal distributed election on chordal rings. Inform. Process. Lett. 38:1991;265-270.
11. Korach E., Moran S., Zaks S. Optimal lower bounds for some distributed algorithms for a complete network of processors. Theoret. Comput. Sci. 64:1989;125-132.
12. B. Litow, B. Mans, 1996, On isomorphic chordal rings, Proc. of the Seventh Australasian Workshop on Combinatorial Algorithms (AWOCA'96), 108, 111, Magnetic Island.
13. Loui M. C., Matsushita T. A., West D. B. Election in complete networks with a sense of direction. Inform. Process. Lett. 22:1986;185-187.
14. B. Mans, June 1996, Optimal distributed algorithms in unlabeled tori and chordal rings, Proc. of the 3rd International Colloquium on Structural Information and Communication Complexity, Sirocco'96, 17, 31, Siena.
15. B. Mans, N. Santoro, 1994, On the impact of sense of direction in arbitrary networks, Proc. of 14th International Conference on Distributed Computing Systems, 258, 265, Poznan.
16. S. Olariu, I. Stojmenovic, A. Zomaya, 1997, On the dynamic initialization of parallel computers, Proc. of the 8th IEEE International Parallel Processing Symposium, Geneva.
17. Pan Y. A near-optimal multi-stage distributed algorithm for finding leaders in clustered chordal rings. Inform. Sci. 76:1994;131-140.
18. Peterson G. L. Efficient algorithms for elections in meshes and complete networks. Technical Report. TR-140:1985.
19. Preparata F. P., Vuillemin J. The cube-connected cycles: A versatile network for parallel computations. Comm. ACM. 25:1981;479-482.
20. Santoro N. Sense of direction, topological awareness and communication complexity. SIGACT NEWS. 2:Summer 1984;50-56.
21. Tel G. Network orientation. Int. J. Foundations Comput. Sci. 5:1994.
22. Tel G. Sense of direction in processor networks. Proc. of SOFSEM'95, Theory and Practice of Informatics. Lecture Notes in Computer Science. 1012:1995;Springer-Verlag, Berlin/New York. p. 50-82.