Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Algorithms

WDAG 1990: Distributed Algorithms pp 102–121Cite as

On the average performance of synchronized programs in distributed networks

  • Conference paper
  • First Online:

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

Abstract

A synchronizer is a compiler to transform a program for a synchronous network into a program for an asynchronous network. A simple synchronizer, which also represents a basic mechanism for distributed computing, was studied by Even and Rajsbaum in [ER1] and [ER2]. They studied the behavior of the synchronizer in networks with constant message transmission delays and processing times. Here we study the case in which the transmission delays and the processing times are random.

Preliminary Version

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Awerbuch, "Complexity of Network Synchronization", JACM, Vol. 32, No. 4, Oct. 1985, pp. 804–823.

    Google Scholar 

  2. B. Awerbuch, "Reducing Complexities of Distributed Max-Flow and Breadth-First-Search Algorithms by Means of Network Synchronization", Networks 15, 1985, pp. 425–437.

    Google Scholar 

  3. B. Awerbuch, D. Peleg, "Network Synchronization with Polylogarithmic Overhead", Proc. IEEE FOCS, 1990.

    Google Scholar 

  4. V.C. Barbosa, 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 

  5. P. Berman, J. Simon, "Investigations of Fault-Tolerant Networks of Computers", Proc. of the 20th ACM STOC, 1988.

    Google Scholar 

  6. D. P. Bertsekas, J. N. Tsitsiklis, Parallel and Distributed Computation, Prentice-Hall, N.J. 1989.

    Google Scholar 

  7. K. L. Chung, Markov Chains With Stationary Transition Probabilities, Springer-Verlag, 2nd edition, 1967.

    Google Scholar 

  8. 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 

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

    Google Scholar 

  10. H.A. David, Order Statistics, John Wiley & Sons, 1970.

    Google Scholar 

  11. S. Even, S. Rajsbaum, "Lack of Global Clock Does Not Slow Down the Computation in Distributed Networks", TR #522, Department of Computer Science, Technion, Haifa, Israel, Oct. 1988. The first part of this paper appears with the title "Unison in Distributed Networks" in Sequences: Combinatorica, Compression, Security, and Transmission, R.M. Capocelli (ed.), Springer-Verlag, 1990.

    Google Scholar 

  12. S. Even, S. Rajsbaum, "The Use of a Synchronizer Yields Maximum Rate in Distributed Networks", Proc. of the 22nd ACM STOC, 1990.

    Google Scholar 

  13. M.A. Marsan, "Stochastic Petri Nets: An Elementary Introduction", in Advances in Petri Nets 1989, Lecture Notes in CS 424, Springer-Verlag, 1989, pp. 1–29.

    Google Scholar 

  14. J. Malka, S. Moran, S. Zaks, "Analysis of a Distributed Scheduler for Communication Networks", TR-495, Department of Computer Science, Technion, Haifa, Israel, Feb. 1988. Also in Lecture Notes on CS, Vol. 319, pp. 351–360, Springer Verlag, 1988.

    Google Scholar 

  15. M. K. Molloy, "Performance Analysis Using Stochastic Petri Nets", IEEE Trans. on Computers, Vol. c-31, No. 9, Sep. 1982, pp. 913–917.

    Google Scholar 

  16. M. K. Molloy, "Fast Bounds for Stochastic Petri Nets", International Workshop on Timed Petri Nets, Torino, Italy, July 1985, pp. 244–249.

    Google Scholar 

  17. Y. Ofek, I. Gopal, "Generating a Global Clock in a Distributed System", IBM Research Report, 1987.

    Google Scholar 

  18. D. Peleg and A. A. Schaffer, "Graph Spanners", J. of Graph Theory, Vol. 13, No. 1, 1989, pp. 99–116.

    Google Scholar 

  19. D. Peleg and J. D. Ullman, "An Optimal Synchronizer for the Hypercube", SIAM J. Computing, Vol. 18, No. 4, August 1989, pp. 740–747.

    Google Scholar 

  20. A. L. Rosenberg, "Shuffle-Oriented Interconnection Networks", COINS Technical Report 88-84, Univ. of Massachusetts, 1988.

    Google Scholar 

  21. S. Rajsbaum, Y. Malka, "Synchronizers, Schedulers and Marked Graphs", in preparation.

    Google Scholar 

  22. S. M. Ross, Stochastic Processes, J. Wiley, 1983.

    Google Scholar 

  23. D. Stoyan, Comparison Methods for Queues and Other Stochastic Models, English Translation (D.J. Daley, Ed.), J. Wiley & Sons, New York, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technion- Israel Institute of Technology, 32000, Haifa, Israel

    Sergio Rajsbaum & Moshe Sidi

  2. Department of Computer Science, Israel

    Sergio Rajsbaum & Moshe Sidi

  3. Department of Electrical Engineering, Israel

    Sergio Rajsbaum & Moshe Sidi

Authors
  1. Sergio Rajsbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Moshe Sidi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rajsbaum, S., Sidi, M. (1991). On the average performance of synchronized programs in distributed networks. In: van Leeuwen, J., Santoro, N. (eds) Distributed Algorithms. WDAG 1990. Lecture Notes in Computer Science, vol 486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54099-7_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-54099-7_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54099-1

  • Online ISBN: 978-3-540-47405-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation