On the impact of sense of direction on message complexity

Information Processing Letters

Volumn 63, Issue 1, 1997, Pages 23-31

  Flocchini, Paola ^a   Mans, Bernard ^b   Santoro, Nicola ^c  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b MACQUARIE UNIVERSITY   (Australia)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

Complexity; Distributed algorithms; Graph algorithms

Indexed keywords

EID: 0002613919     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00091-4     Document Type: Article

References (26)

1. D. Angluin, Local and global properties in networks of processors, in: Proc. 12th ACM Symp. on Theory of Computing (1980) 82-93.
2. H. Attiya, J. van Leeuwen, N. Santoro and S. Zaks, Efficient elections in chordal ring networks, Algorithmica 4 (1989) 437-446.
3. T.Y. Cheung, Graph traversal techniques and the maximum flow problem in distributed computation, IEEE Trans. Software Engineering 9 (1983) 504-512.
4. P. Flocchini and B. Mans, Optimal election in labeled hypercubes, J. Parallel Distributed Comput. 33 (1) (1996) 76-83.
5. P. Flocchini, B. Mans and N. Santor, Distributed traversal and broadcasting in arbitrary network with distance sense of direction, in: Proc. 9th Internat. Symp. on Computer and Information Sciences (1994) 196-203.
6. P. Flocchini, B. Mans and N. Santoro, Sense of direction: formal definition and properties, in: Proc. 1st Coll. on Structural Information and Communication Complexity, International lnformatic Series, Vol. 1 (Carleton University Press, Ottawa, Canada, 1994) 9-34..
7. P. Flocchini and A. Roncato, Computing on anonymous networks with sense of direction, in: Proc. 3rd Coll. on Structural Information and Communication Complexity, Siena, International lnformatic Series, Vol. 6 (Carleton University Press, Canada, 1996) 32-46.
8. R.G. Gallager, P.A. Humblet and P.M. Spira, A distributed algorithm for minimum spanning tree, ACM Trans. Programming Languages and Systems 5 (1) (1983) 66-77.
9. A. Israeli, E. Kranakis, D. Krizanc and N. Santoro, Time-message trade-offs for the weak unison problem, in: Proc. Conf. on Algorithms and Complexity, Lecture Notes in Computer Science, Vol. 778 (Springer, Berlin, 1994) 167-178.
10. T.Z. Kalamboukis and S.L. Mantzaris, Towards optimal distributed election on chordal rings, Inform. Process. Lett. 38 (1991) 265-270.
11. E. Korach, S. Kutten and S. Moran, A modular technique for the design of efficient distributed leader finding algorithms, ACM Trans. Programming Languages and Systems 12 (1) (1990) 84-101.
12. E. Korach, S. Moran and S. Zaks, Tight lower and upper bounds for a class of distributed algorithms for a complete network of processors, in: Proc. 3rd Symp. on Principles of Distributed Computing, Vancouver (1984) 199-207.
13. I. Lavallée and G. Roucairol, A fully distributed (minimal) spanning tree algorithm, Inform. Process. Lett. 23 (1986) 55-62.
14. M.C. Loui, T.A. Matsushita and D.B. West, Election in complete networks with a sense of direction. Inform. Process. Lett. 22 (1986) 185-187; see also Inform. Process. Lett. 28 (1988) 327.
15. M.C. Loui, T.A. Matsushita and D.B. West, Election in complete networks with a sense of direction. Inform. Process. Lett. 22 (1986) 185-187; see also Inform. Process. Lett. 28 (1988) 327.
16. B. Mans, Optimal distributed algorithms in unlabeled tori and chordal rings, in: Proc. 3rd Internat. Coll. on Structural Information and Communication Complexity, Siena, Italy, International Informatics Series, Vol. 6 (Carleton Press, University, 1996) 17-31.
17. B. Mans and N. Santoro, On the impact of sense of direction in arbitrary networks, in: Proc. 14th Internat. Conf. on Distributed Computing Systems, Poznan (1994) 258-265.
18. G.H. Masapati and H. Ural, Effect of preprocessing on election in a complete network with a sense of direction, in: Proc. IEEE Internat. Conf. on Systems, Man and Cybernetics, Vol. 3 (1991) 1627-1632.
19. T. Masuzawa, N. Nishikawa, K. Hagihara and N. Tokura, A fault-tolerant algorithm for election in complete networks with a sense of direction, Systems and Computers in Japan 22 (12) (1991) 11-22.
20. Y. Pan, An improved election algorithm in chordal ring networks, Internat. J. Computer Math. 40 (3-4) (1991) 191-200.
21. S. Robbins and K.A. Robbins, Choosing a leader on a hypercube, in: Proc. Internat. Conf. on Databases, Parallel Architectures and their Applications, Miami Beach (1990) 469-471.
22. N. Santoro. On the message complexity of distributed problems, J. Comput. Inform. Sci. 13 (1984) 131-147.
23. M.B. Sharma, S.S. Iyengar and N.K. Mandyam, An efficient distributed depth-first-search algorithm. Inform. Process. Lett. 32 (1989) 183-186; see also: Inform. Process. Lett. 35 (1990) 55.
24. M.B. Sharma, S.S. Iyengar and N.K. Mandyam, An efficient distributed depth-first-search algorithm. Inform. Process. Lett. 32 (1989) 183-186; see also: Inform. Process. Lett. 35 (1990) 55.
25. G. Singh, Leader election in complete networks, in: Proc. 11th Symp. on Principles of Distributed Computing (1992) 179-190.
26. G. Tel, Sense of direction in processor networks, in: Theory and Practice of Informatics, Lecture Notes in Computer Science, Vol. 1012 (Springer, Berlin, 1995) 50-82.