Skip to main content
SpringerLink
Log in

Sense of direction in distributed computing

  • Keynote Lectures
  • Conference paper
  • First Online:
Distributed Computing (DISC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1499))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Attiya, J. van Leeuwen, N. Santoro, and S. Zaks. Efficient elections in chordal ring networks. Algorithmica, 4:437–446, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  2. H. Attiya, M. Snir, and M.K. Warmuth. Computing on an anonymous ring. Journal of the A.C.M., 35(4):845–875, 1988.

    MATH  MathSciNet  Google Scholar 

  3. B. Awerbuch, O. Goldreich, D. Peleg, and R. Vainish. A trade-off between information and communication in broadcast protocols. Journal of the A.C.M., 37(2):238–256, April 1990.

    MATH  MathSciNet  Google Scholar 

  4. P. Boldi and S. Vigna. On the complexity of deciding sense of direction. In Proc. of 2nd Colloquium on Structural Information and Communication Complexity, pages 39–52, Olympia, 1995.

    Google Scholar 

  5. P. Boldi and S. Vigna. Good fibrations and other constructions which preserve sense of direction. In 3rd International Colloquium on Structural Information and Communication Complexity, number 6, pages 47–58, Siena, 1996.

    Google Scholar 

  6. P. Boldi and S. Vigna. Minimal sense of direction and decision problems for Cayley graphs. Information Processing Letters, 64:299–303, 1997.

    Article  MathSciNet  Google Scholar 

  7. T.Y. Cheung. Graph traversal techniques and the maximum flow problem in distributed computation. I.E.E.E. Transactions on Software Engineering, 9:504–512, 1983.

    MATH  Google Scholar 

  8. DCE. Guide to writing distributed computing environement applications, digital equipment corporation, 1994.

    Google Scholar 

  9. K. Diks, S. Dobrev, E. Kranakis, A. Pelc, and P. RuŽička. Broadcasting in unlabeled hypercubes with linear number of messages. Information Processing Letters. to appear.

    Google Scholar 

  10. S. Dobrev. An alternative view on structural information. In 5th International Colloquium on Structural Information and Communication Complexity, Amalfi, 1998. to appear.

    Google Scholar 

  11. S. Dobrev, P. RuŽička, and G. Tel. Time and bit optimal broadcasting in anonymous unoriented hypercubes. In Proc. of 5th Colloquium on Structural Information and Communication Complexity, Amalfi, 1998. to appear.

    Google Scholar 

  12. S. Dobrev and P. Ruzicka. Linear broadcasting and n log log n election in unoriented hypercubes. In Proc. of the 4th International Colloquium on Structural Information and Communication Complexity, pages 53–68, 1997.

    Google Scholar 

  13. P. Flocchini. Minimal sense of direction in regular networks. Information Processing Letters, 61:331–338, 1997.

    Article  MathSciNet  Google Scholar 

  14. P. Flocchini and B. Mans. Optimal election in labeled hypercubes. Journal of Parallel and Distributed Computing, 33(1):76–83, 1996.

    Article  Google Scholar 

  15. P. Flocchini, B. Mans, and N. Santoro. Sense of direction: definition, properties and classes. Networks. To appear. Preliminary version in Proc. of 1st Colloquium on Structural Information and Communication Complexity, 9–34,1994.

    Google Scholar 

  16. P. Flocchini, B. Mans, and N. Santoro. Distributed traversal and broadcasting in arbitrary network with distance sense of direction. In Proc. of 9th International Symposium on Computer and Information Sciences, pages 196–203, 1994.

    Google Scholar 

  17. P. Flocchini, B. Mans, and N. Santoro. On the impact of sense of direction on message complexity. Information Processing Letters, 63(1):23–31, 1997.

    Article  MathSciNet  Google Scholar 

  18. P. Flocchini, A. Roncato, and N. Santoro. Complete symmetries and minimal sense of direction in labeled graphs. Discrete Applied Mathematics. to appear. Preliminary version in Proc. of 27th SE Conference on Combinatorics, Graph Theory and Computing; Congressus Numerantium 121, 3–18, 1996.

    Google Scholar 

  19. P. Flocchini, A. Roncato, and N. Santoro. Computing on anonymous networks with sense of direction. Theoretical Computer Science. To appear. (Preliminary version in Proc. of 3rd Colloquium on Structural Information and Communication Complexity, 32–46, 1996).

    Google Scholar 

  20. P. Flocchini and N. Santoro. Proper coloring and sense of direction. Submitted.

    Google Scholar 

  21. P. Flocchini and N. Santoro. Topological constraints for sense of direction. International Journal on Foundations of Computer Science. To appear. Preliminary version in Proc. of 2nd Colloquium on Structural Information and Communication Complexity, 27–38, 1995.

    Google Scholar 

  22. P. Flocchini and N. Santoro. Topological constraints for sense of direction. In Proc. of 2nd Colloquium on Structural Information and Communication Complexity, pages 27–38, Olympia, 1995.

    Google Scholar 

  23. S. Foldes. Personal communication.

    Google Scholar 

  24. R.G. Gallager, P.A. Humblet, and P.M. Spira. A distributed algorithm for minimum spanning tree. A.C.M. Transactions on Programming Languages and Systems, 5(1):66–77, 1983.

    Article  MATH  Google Scholar 

  25. A. Israeli, E. Kranakis, D. Krizanc, and N. Santoro. Time-message trade-offs for the weak unison problem. Nordic Journal of Computing, 4:317–329, 1997.

    MATH  MathSciNet  Google Scholar 

  26. ISO/IEC JTC1. Information technology — open distributed processing — naming framework, iso/iec dis147771, July 1997.

    Google Scholar 

  27. T.Z. Kalamboukis and S.L. Mantzaris. Towards optimal distributed election on chordal rings. Information Processing Letters, 38:265–270, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  28. 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. of 3rd Symposium on Principles of Distributed Computing, pages 199–207, Vancouver, 1984.

    Google Scholar 

  29. E. Kranakis and D. Krizanc. Distributed computing on anonymous hypercubes. Journal of Algorithms, 23:32–50, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  30. E. Kranakis and N. Santoro. Distributed computing on anonymous hypercubes with faulty components. In Proc. of 6th Int. Workshop of Distributed Algorithms, Lecture Notes in Computer Science 647, pages 253–263. Springer-Verlag, 1992.

    Google Scholar 

  31. M.C. Loui, T.A. Matsushita, and D.B. West. Election in complete networks with a sense of direction. Information Processing Letters, 22:185–187, 1986. see also Information Processing Letters, vol.28, p.327, 1988.

    Article  MathSciNet  Google Scholar 

  32. N. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1995.

    Google Scholar 

  33. B.Mans. Optimal distributed algorithms in unlabeled tori and chordal rings. Journal on Parallel and Distributed Computing, 1997. To appear. Preliminary version in Proc. of the 3rd International Colloquium on Structural Information and Communication Complexity, 17–31,1996.

    Google Scholar 

  34. B. Mans and D. Peleg. Broadcasting in unlabelled chordal rings, 1997. Personal Communication.

    Google Scholar 

  35. B. Mans and N. Santoro. Optimal fault-tolerant leader election in chordal rings. IEEE Transactions on Computers. To appear.

    Google Scholar 

  36. B. Mans and N. Santoro. On the impact of sense of direction in arbitrary networks. In Proc. of 14th International Conference on Distributed Computing Systems, pages 258–265, Poznan, 1994.

    Google Scholar 

  37. G.H. Masapati and H. Ural. Effect of preprocessing on election in a complete network with a sense of direction. In Proc. of I.E.E.E. International Conference on Systems, Man and Cybernetics, volume 3, pages 1627–1632, 1991.

    Google Scholar 

  38. 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):11–22, 1991.

    MathSciNet  Google Scholar 

  39. OMG. Naming service specification clause 3, corba services, omg, march 199.

    Google Scholar 

  40. Yi Pan. A near-optimal multi-stage distributed algorithm for finding leaders in clustered chordal rings. Information Sciences, 76(1–2):131–140, 1994.

    Article  MATH  Google Scholar 

  41. D. Peleg. Message-optimal broadcast on a hypercubes with no neighbour knowledge, 1997. Personal Communication.

    Google Scholar 

  42. S. Robbins and K.A. Robbins. Choosing a leader on a hypercube. In Proc. of International Conference on Databases, Parallel Architectures and their Applications, pages 469–471, Miami Beach, 1990.

    Google Scholar 

  43. N. Santoro. Sense of direction, topological awareness and communication complexity. SIGACT NEWS, 2(16):50–56, Summer 1984.

    Article  MATH  Google Scholar 

  44. M.B. Sharma, S.S. Iyengar, and N.K. Mandyam. An efficient distributed depthfirst-search algorithm. Information Processing Letters, 32:183–186, September 1989. see also Information Processing Letters, vol.35, p.55, 1990.

    Article  MathSciNet  Google Scholar 

  45. G. Singh. Efficient leader election using sense of direction. Distributed Computing, 10:159–165, 1997.

    Article  Google Scholar 

  46. G. Tel. Network orientation. International Journal of Foundations of Computer Science, 5(1):1–41, 1994.

    Article  MATH  Google Scholar 

  47. G. Tel. Linear election in hypercubes. Parallel Processing Letters, 5(1):357–366, 1995.

    Article  MathSciNet  Google Scholar 

  48. G. Tel. Sense of direction in processor networks. In Proc. of Conference on Theory and Practice of Informatics, Lecture Notes in Computer Science 1012, pages 50–82. Springer-Verlag, 1995.

    Google Scholar 

  49. G. v. Bochmann, P. Flocchini, and D. Ramazani. Distributed objects with sense of direction. In 1st Workshop on Distributed Data and Structures, Orlando. To appear.

    Google Scholar 

  50. A.M. Verweij. Linear-message election in hypercubes. Manuscript.

    Google Scholar 

  51. M. Yamashita and T. Kameda. Computing on anonymous networks, part I: characterizing the solvable cases. IEEE Transaction on Parallel and Distributed Computing, 7(1):69–89, 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d'Informatique, Université du Quebec à Hull, Canada

    Paola Flocchini

  2. Department of Computing, School of MPCE, Macquarie University, Sydney

    Bernard Mans

  3. School of Computer Science, Carleton University, Ottawa

    Nicola Santoro

Authors
  1. Paola Flocchini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernard Mans
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicola Santoro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Shay Kutten

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Flocchini, P., Mans, B., Santoro, N. (1998). Sense of direction in distributed computing. In: Kutten, S. (eds) Distributed Computing. DISC 1998. Lecture Notes in Computer Science, vol 1499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056468

Download citation

  • DOI: https://doi.org/10.1007/BFb0056468

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65066-9

  • Online ISBN: 978-3-540-49693-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation