Total algorithms

  • Gerard Tel
Selected Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 335)


We define the notion of total algorithms for networks of processes. It turns out that total algorithms are an important building block in the design of distributed algorithms. For many network control problems it can be shown that an algorithm solving it is necessarily total, and that any total algorithm can solve the problem. We study some total algorithms and compare their merits. Many known results and algorithms are thus put in a general framework.

Key words and phrases

Network control problems Broadcast Election Distributed Infimum Resynchronization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5 References

  1. [Awe85]
    Awerbuch, B., A New Distributed Depth First Search Algorithm, Inf. Proc. Lett. 20 (1985) 147–150.Google Scholar
  2. [Ba87]
    Bar-Yehuda, R., S. Kutten, Y. Wolfstahl, S. Zaks, Making Distributed Spanning Tree Algorithms Fault Resilient, in: F.J. Brandenburg et al. (ed.), Proceedings STACS87, LNCS 247, Springer Verlag, Heidelberg, 1987.Google Scholar
  3. [Ch82]
    Chang, E.J.H., Echo Algorithms: Depth Parallel Operations on General Graphs, IEEE Trans. Software Eng. SE-8 (1982) 391–401.Google Scholar
  4. [Ch83]
    Cheung, T., Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation, IEEE Trans. Software Eng. SE-9 (1983) 504–512.Google Scholar
  5. [Fi79]
    Finn, S.G., Resynch Procedures and a Fail-safe Network Protocol, IEEE Trans. Communications COM-27 (June 1979), 840–845.Google Scholar
  6. [GA84]
    Gafni, E., Y. Afek, Election and Traversal in Unidirectional Networks, Proc. 4th symp. on Principles of Distr. Comp., Vancouver, Canada, 1984.Google Scholar
  7. [Ga84]
    Gafni, E., M.C. Loui, P. Tiwari, D.B. West, S. Zaks, Lower Bounds on Common Knowledge in Distributed Systems, Techn. Rep R-1017, Coordinated Science Laboratory, University of Illinois, September 1984.Google Scholar
  8. [Ga86]
    Gafni, E., Perspectives on Distributed Network Protocols: a Case for Building Blocks, Proceedings IEEE Military Communications Conference, Montery, October 1986.Google Scholar
  9. [GHS83]
    Gallager, R.G., P.A. Humblet, P.M. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM ToPLaS 5 (1983), 67–77.Google Scholar
  10. [La78]
    Lamport, L., Time, Clocks, and the Ordering of Events in a Distributed System, Comm. ACM 21 (1978), 558–565.CrossRefGoogle Scholar
  11. [Pe84]
    Peterson, G.L., Efficient Algorithms for Election in Meshes and Complete Networks, TR-140, University of Rochester, Rochester, Aug. 1984.Google Scholar
  12. [Se83]
    Segall, A., Distributed Network Protocols, IEEE Trans. Inf. Theory IT-29 (1983), 23–35.Google Scholar
  13. [Te86]
    Tel, G., Distributed Infimum Approximation, Techn. Rep. RUU-CS-86-12, Dept. of Computer Science, University of Utrecht, Utrecht, 1986.Google Scholar
  14. [Te87]
    Tel, G., Directed Network Protocols, in: J. van Leeuwen (ed.), Proceedings 2nd International Workshop on Distributed Algorithms, Lecture Notes in Computer Science 312, Springer Verlag, 1988.Google Scholar
  15. [Te88]
    Tel, G., Total Algorithms, Techn. Rep. RUU-CS-88-16, Dept. of Computer Science, University of Utrecht, Utrecht, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Gerard Tel
    • 1
  1. 1.Department of Computer ScienceUniversity of UtrechtUtrechtThe Netherlands

Personalised recommendations