On the impact of sense of direction in arbitrary networks

We study the positive impact that the availability of "Sense of Direction" has on the message complexity of the election problem in arbitrary networks of processors. We present a /spl Theta/(n log n) solution; without sense of direction, this problem requires /spl Omega/(e+nlogn) messages where e is the number of communication links. This result confirms and extends the evidence on the impact of sense of direction which, up to now, was established only for specific classes of topologies.<<ETX>>

[1]  G. H. Masapati,et al.  Effect of preprocessing on election in a complete network with a sense of direction , 1991, Conference Proceedings 1991 IEEE International Conference on Systems, Man, and Cybernetics.

[2]  G. Tel.  Linear election for oriented hypercubes , 1993 .

[3]  C. Loui Michael,et al.  Election in a complete network with a sense of direction , 1986 .

[4]  Ivan Lavallée,et al.  A Fully Distributed (Minimal) Spanning Tree Algorithm , 1986, Inf. Process. Lett..

[5]  Gurdip Singh,et al.  Leader election in complete networks , 1992, PODC '92.

[6]  Shay Kutten,et al.  A modular technique for the design of efficient distributed leader finding algorithms , 1990, TOPL.

[7]  S. Robbins,et al.  Choosing a leader on a hypercube , 1990, Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications.

[8]  Bernard Mans,et al.  Sense of Direction: Formal Definitions and Properties , 1994, SIROCCO.

[9]  Yi Pan.  An improved election algorithm in chordal ring networks , 1991, Int. J. Comput. Math..

[10]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[11]  Bernard Mans,et al.  Optimal fault-tolerant leader election in chordal rings , 1994, Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing.

[12]  Hans L. Bodlaender,et al.  New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors , 1991, Theor. Comput. Sci..

[13]  Karl Erik Johansen,et al.  A Distributed Spanning Tree Algorithm , 1987, WDAG.

[14]  Toshimitsu Masuzawa,et al.  Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction , 1989, WDAG.

[15]  Bernard Mans,et al.  Optimal Elections in Labeled Hypercubes , 1996, J. Parallel Distributed Comput..

[16]  Alon Itai,et al.  Optimal Distributed t-Resilient Election in Complete Networks , 1990, IEEE Trans. Software Eng..

[17]  Nicola Santoro.  Sense of direction, topological awareness and communication complexity , 1984, SIGA.

[18]  Theodore Kalamboukis,et al.  Towards Optimal Distributed Election on Chordal Rings , 1991, Inf. Process. Lett..