Skip to main content
SpringerLink
Log in

Strong interaction fairness in a fully distributed system with unbounded speed variability

  • Contributed Papers
  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1997)

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

Included in the following conference series:

  • 242 Accesses

Abstract

We present two randomized algorithms, one for message passing and the other for shared memory, that, with probability 1, schedule multiparty interactions in a strongly fair manner. Both algorithms improve upon a previous result by Joung and Smolka (proposed in a shared memory model) in the following two aspects: First, processes' speeds as well as the communication delay need not be bounded by any predetermined constant. Secondly, our algorithms are fully distributed in the sense that no centralized mechanism is used for the scheduling. In the shared memory model this means that no global variable can be shared among processes for writing.

This research was supported by the National Science Council, Taipei, Taiwan, under Grants NSC 84-2213-E-002-005, NSC 85-2213-E-002-059, and NSC 86-2213-E-002053

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. K.R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2(4):226–241, 1988.

    Article  Google Scholar 

  2. R.J.R. Back and R. Kurki-Suonio. Distributed cooperation with action systems. ACM TOPLAS, 10(4):513–554, October 1988.

    Article  Google Scholar 

  3. R. Bagrodia. Process synchronization: Design and performance evaluation of distributed algorithms. IEEE TSE, SE-15(9):1053–1065, September 1989.

    Google Scholar 

  4. R. Bagrodia. Synchronization of asynchronous processes in CSP. ACM TOPLAS, 11(4):585–597, October 1989.

    Article  Google Scholar 

  5. T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14:25–59, 1987.

    Article  Google Scholar 

  6. G.N. Buckley and A. Silberschatz. An effective implementation for the generalized input-output construct of CSP. ACM TOPLAS, 5(2):223–235, April 1983.

    Article  Google Scholar 

  7. K.L. Chung. A Course in Probability Theory. A Series of Monographs and Textbooks. Academic Press, second edition, 1974.

    Google Scholar 

  8. N. Francez and I.R. Forman. Interacting Processes: A Multiparty Approach to Coordinated Distributed Programming. Addison Wesley, 1995.

    Google Scholar 

  9. N. Francez, B. Hailpern, and G. Taubenfeld. Script: A communication abstraction mechanism. Science of Computer Programming, 6(1):35–88, January 1986.

    Article  Google Scholar 

  10. N. Francez and M. Rodeh. A distributed abstract data type implemented by a probabilistic communication scheme. Technical Report TR-80, IBM Israel Scientific Center, April 1980. A preliminary version appeared in the Proceedings of the 21st FOCS, pages 373–379, 1980.

    Google Scholar 

  11. D. Harel. Algorithmics: The Spirit of Computing. Addison-Wesley, 1987.

    Google Scholar 

  12. C.A.R. Hoare. Communicating sequential processes. CACM, 21(8):666–677, August 1978.

    Google Scholar 

  13. H.-M. Järvinen and R. Kurki-Suonio. Disco specification language: Marriage of actions and objects. In Proceedings of the 11th ICDCS, pages 142–151, 1991.

    Google Scholar 

  14. H.-M. Järvinen, R. Kurki-Suonio, M. Sakkinen, and K. Systä. Object-oriented specification of reactive systems. In Proceedings of the 12th Int'l Conf. on Software Engineering, pages 63–71, 1990.

    Google Scholar 

  15. Y.-J. Joung. Characterizing fairness implementability for multiparty interaction. In Proceedings of the 23rd ICALP, LNCS 1099, pages 110–121, 1996.

    Google Scholar 

  16. Y.-J. Joung and S.A. Smolka. Coordinating first-order multiparty interactions. ACM TOPLAS, 16(3):954–985, May 1994.

    Article  Google Scholar 

  17. Y.-J. Joung and S.A. Smolka. A comprehensive study of the complexity of multiparty interaction. JACM, 43(1):75–115, January 1996.

    Article  Google Scholar 

  18. Y.-J. Joung and S.A. Smolka. Strong interaction fairness via randomization. In Proceedings of the 16th ICDCS, pages 475–483, 1996.

    Google Scholar 

  19. D. Kumar. An implementation of N-party synchronization using tokens. In Proceedings of the 10th ICDCS, pages 320–327, 1990.

    Google Scholar 

  20. R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.

    Article  Google Scholar 

  21. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  22. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I. Information and Computation, 100(1):1–40, September 1992.

    Article  Google Scholar 

  23. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, II. Information and Computation, 100(1):41–77, September 1992.

    Article  Google Scholar 

  24. M.H. Park and M. Kim. A distributed synchronization scheme for fair multi-process handshakes. IPL, 34:131–138, April 1990.

    Article  Google Scholar 

  25. S. Ramesh. A new and efficient implementation of multiprocess synchronization. In Proceedings Conference on PARLE, LNCS 259, pages 387–401, 1987.

    Google Scholar 

  26. S. Ramesh. A new efficient implementation of CSP with output guards. In Proceedings of the 7th ICDCS, pages 266–273, 1987.

    Google Scholar 

  27. J.H. Reif and P.G. Spirakis. Real time synchronization of interprocess communications. ACM TOPLAS, 6(2):215–238, April 1984.

    Article  Google Scholar 

  28. P.A. Sistla. Distributed algorithms for ensuring fair interprocess communications. In Proceedings of the 3rd ACM PODC, pages 266–277, 1984.

    Google Scholar 

  29. Y.-K. Tsay and R.L. Bagrodia. Some impossibility results in interprocess synchronization. Distributed Computing, 6(4):221–231, 1993.

    Article  Google Scholar 

  30. Y.-K. Tsay and R.L. Bagrodia. Fault-tolerant algorithms for fair interprocess synchronization. IEEE TPDS, 5(7):737–748, June 1994.

    Google Scholar 

  31. U.S. Department of Defense. Reference Manual for the Ada Programming Language. ANSI/MIL-STD-1815A. U.S. Government Printing Office, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Information Management, National Taiwan University, Taipei, Taiwan

    Yuh-Jzer Joung

  2. Dept. of Electrical Engineering, National Taiwan University, Taipei, Taiwan

    Jen-Yi Liao

Authors
  1. Yuh-Jzer Joung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jen-Yi Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marios Mavronicolas Philippas Tsigas

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Joung, YJ., Liao, JY. (1997). Strong interaction fairness in a fully distributed system with unbounded speed variability. In: Mavronicolas, M., Tsigas, P. (eds) Distributed Algorithms. WDAG 1997. Lecture Notes in Computer Science, vol 1320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030687

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63575-8

  • Online ISBN: 978-3-540-69600-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation