Skip to main content
SpringerLink
Log in

Analysis of distributed algorithms based on recurrence relations

Preliminary version

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1991)

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

Included in the following conference series:

Abstract

Recurrence relations of a certain type and their connection to Marked Graphs are studied. We show that these recurrence relations provide a paradigm which unifies distributed algorithms like synchronizers and distributed schedulers under a common formalism. This paradigm provides a technique for studying the properties of these algorithms when they are used in networks where link delays are not necessarily equal. We use the paradigm to analyze the performance of these algorithms. In particular it is shown that the behavior of algorithms which can be described by the recurrence relations is periodic after a short transitory phase and that the rate of computation can be computed efficiently.

Part of this work was done while the author was at the Department of Computer Science, Technion.

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. B. Awerbuch, “Complexity of Network Synchronization,” J. of the ACM, Vol. 32, No. 4, Oct. 1985, pp. 804–823.

    Google Scholar 

  2. B. Awerbuch, A. Baratz, D. Peleg, “Cost-Sensitive Analysis of Communication Protocols,” IEEE FOCS, 1990.

    Google Scholar 

  3. V. C. Barbosa and E. Gafni, “Concurrency in Heavily Loaded Neighborhood-Constrained Systems,” ACM Trans. on Programming Languages and Systems, Vol. 11, No 4, Oct. 1989, pp. 562–584.

    Google Scholar 

  4. R. Cuninghame-Green, Minimax Algebra, Lecture Notes in Economics and Mathematical Systems, No. 166, Springer-Verlag, 1979.

    Google Scholar 

  5. K. M. Chandy and L. Lamport, “Distributed Snapshots: Determining Global States of Distributed Systems,” ACM Trans. on Computer Systems, Vol. 3, No 1, Feb. 1985.

    Google Scholar 

  6. F. Commoner, A.W. Holt, S. Even, A. Pnueli, “Marked Directed Graphs,” J. of Computer and System Sciences, Vol, vn5, No 5, Oct. 1971.

    Google Scholar 

  7. I. Chlamtac and S. Pinter, “Distributed nodes organization algorithm for channel access in a multi-hop dynamic radio network,” IEEE Trans. on Computers, vol. C-36, No. 6, June 1987, pp. 728–737.

    Google Scholar 

  8. S. Even, S. Rajsbaum, “Unison in Distributed Networks,” Sequences, Combinatorial, Compression, Security, and Transmission, R.M. Capocelli (ed.), Springer-Verlag, 1989. It is included in “Lack of a Global Clock Does not Slow Down the Computation in Distributed Networks,” TR-522, Department of Comp. Science, Technion, Haifa, Israel, October 1988.

    Google Scholar 

  9. S. Even, S. Rajsbaum, “The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks,” Proc. 22th ACM STOC, 1990.

    Google Scholar 

  10. R. M. Karp, “A Characterization of the Minimum Cycle Mean in a Digraph,” Discrete Mathematics, Vol. 23, 1978, pp. 309–311.

    Google Scholar 

  11. S. Kirkpatrick, C.D. Gelatt, M.P, Vecchi, “Optimization by Simulated Annealing,” Science220 (4598), pp. 671–680 (May 13, 1983).

    Google Scholar 

  12. E.L. Lawler, Combinatorial Algorithms: Networks and Matroids, Holt, Rinehart, and Winston, 1976.

    Google Scholar 

  13. J. Malka, S. Moran, S. Zaks, “Analysis of a Distributed Scheduler for Communication Networks,” Technical Report # 495, Department of Computer Science, Technion, Haifa, Israel, Feb. 1988. Also in proceedings of the 3rd Agean Workshop on Computing, AWOC 88, Corfu, June 1988), LNCS, Vol 319, pp. 351–360, Springer Verlag, 1988.

    Google Scholar 

  14. Y. Ofek, I. Gopal, “Generating a Global Clock in a Distributed System,” IBM Research Report, 1987.

    Google Scholar 

  15. C.V. Ramamoorthy and G.S. Ho, “Performance Evaluation of asynchronous concurrent systems using Petri Nets,” IEEE Trans. Software Engineering, vol. SE-6, no. 5, pp. 440–449, (1980).

    Google Scholar 

  16. S. Rajsbaum, M. Sidi, “On the Average Performance of Synchronized Programs in Distributed Networks,” 4th Int. Workshop on Distributed Algorithms, Italy, October 1990, LNCS 486.

    Google Scholar 

  17. S. Rajsbaum, “Stochastic Marked Graphs,” to appear in 4th Int. Workshop on Petri Nets and Performance Models (PNPM91), Melbourn, Australia, Dec. 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Science & Technology, Technion City, 32000, Haifa, Israel

    Yossi Malka

  2. Instituto de Matemáticas, U.N.A.M., 04510, México, D.F.

    Sergio Rajsbaum

Authors
  1. Yossi Malka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Rajsbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sam Toueg Paul G. Spirakis Lefteris Kirousis

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Malka, Y., Rajsbaum, S. (1992). Analysis of distributed algorithms based on recurrence relations. In: Toueg, S., Spirakis, P.G., Kirousis, L. (eds) Distributed Algorithms. WDAG 1991. Lecture Notes in Computer Science, vol 579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022451

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46789-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation