论文信息 - Sense of Direction in Processor Networks

Sense of Direction in Processor Networks

We discuss recent research evaluating the benefits of certain link labellings in processor networks. Such a labelling, called Sense of Direction or SoD, allows processors to communicate more efficiently with each other, and to exploit topological properties of the network algorithmically.

Gerard Tel

[1] Gerard Tel. Network Orientation , 1994, Int. J. Found. Comput. Sci..

[2] Gérard Le Lann,et al. Distributed Systems - Towards a Formal Approach , 1977, IFIP Congress.

[3] Ernest J. H. Chang,et al. An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.

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

[5] Lisa Higham,et al. A Simple, Efficient Algorithm for Maximum Finding on Rings , 1992, Inf. Process. Lett..

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

[7] P. H. Lindsay. Human Information Processing , 1977 .

[8] Doron Rotem,et al. Lower Bounds for Distributed Maximum-Finding Algorithms , 1984, JACM.

[9] W. Randolph Franklin. On an improved algorithm for decentralized extrema finding in circular configurations of processors , 1982, CACM.

[10] Gerard Tel,et al. Introduction to Distributed Algorithms: Contents , 2000 .

[11] Shmuel Zaks,et al. Tight lower and upper bounds for some distributed algorithms for a complete network of processors , 1984, PODC '84.

[12] Gerard Tel,et al. A Monte Carlo Algorithm for Election , 1995, SIROCCO.

[13] Danny Dolev,et al. An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.