Advertisement

Characterizing fairness implementability for multiparty interaction

  • Yuh-Jzer Joung
Session 2: Fairness, Domination, and the μ-Calculus
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1099)

Abstract

We present a semantic criterion for fairness notions for multiparty interaction. We show that if a fairness notion violates the criterion, then no deterministic algorithm for multiparty interaction scheduling can satisfy the fairness requirement. Conversely, the implementation is possible if the criterion is obeyed. Thus, the criterion is sufficient and necessary to guarantee fairness implementability. To our knowledge, this is the first such criterion to appear in the literature.

We then use this criterion to examine several important fairness notions, including strong interaction fairness, strong process fairness, weak process fairness, U-fairness, and hyperfairness. All, except weak process fairness, fail to pass the criterion.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    K. R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2(4):226–241, 1988.CrossRefGoogle Scholar
  2. 2.
    P.C. Attie, I.R. Forman, and E. Levy. On fairness as an abstraction for the design of distributed systems. In Proc. of the 10th ICDCS, pp. 150–157, 1990.Google Scholar
  3. 3.
    P. C. Attie, N. Francez, and O. Grumberg. Fairness and hyperfairness in multiparty interactions. Distributed Computing, 6:245–254, 1993.Google Scholar
  4. 4.
    R. J. R. Back and R. Kurki-Suonio. Distributed cooperation with action systems. ACM TOPLAS, 10(4):513–554, Oct. 1988.CrossRefGoogle Scholar
  5. 5.
    R. Bagrodia. Process synchronization: Design and performance evaluation of distributed algorithms. IEEE TSE, SE-15(9):1053–1065, 1989.Google Scholar
  6. 6.
    N. Francez and I.R. Forman. Interacting Processes: A Multiparty Approach to Coordinated Distributed Programming. Addison Wesley, 1995.Google Scholar
  7. 7.
    N. Francez, B. Hailpern, and G. Taubenfeld. Script: A communication abstraction mechanism. Science of Computer Programming, 6(1):35–88, Jan. 1986.CrossRefGoogle Scholar
  8. 8.
    C. A. R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):666–677, Aug. 1978.CrossRefGoogle Scholar
  9. 9.
    Y.-J. Joung. On the Design and Implementation of Multiparty Interaction. PhD thesis, Dept. of Computer Science, SUNY at Stony Brook, May 1992.Google Scholar
  10. 10.
    Y.-J. Joung and S.A. Smolka. Coordinating first-order multiparty interactions. ACM TOPLAS, 16(3), May 1994.Google Scholar
  11. 11.
    Y.-J. Joung and S.A. Smolka. A comprehensive study of the complexity of multiparty interaction. Journal of the ACM. To appear.Google Scholar
  12. 12.
    D. Kumar. An implementation of N-party synchronization using tokens. In Proc. of the 10th ICDCS, pp. 320–327, 1990.Google Scholar
  13. 13.
    E. R. Olderog and K. R. Apt. Fairness in parallel programs: The transformational approach. ACM TOPLAS, 10(3):420–455, July 1988.CrossRefGoogle Scholar
  14. 14.
    S. Owicki and L. Lamport. Proving liveness properties of concurrent programs. ACM TOPLAS, 4(3):455–495, 1982.CrossRefGoogle Scholar
  15. 15.
    M. H. Park and M. Kim. A distributed synchronization scheme for fair multiprocess handshakes. Information Processing Letters, 34:131–138, Apr. 1990.MathSciNetGoogle Scholar
  16. 16.
    S. Ramesh. A new and efficient implementation of multiprocess synchronization. In Proc. Conf. on PARLE, LNCS 259, pp. 387–401, 1987.Google Scholar
  17. 17.
    Y.-K. Tsay and R.L. Bagrodia. A real-time algorithm for fair interprocess synchronization. In Proc. of the 12th ICDCS, pp. 716–723, 1992.Google Scholar
  18. 18.
    Y.-K. Tsay and R. L. Bagrodia. Some impossibility results in interprocess synchronization. Distributed Computing, 6(4):221–231, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Yuh-Jzer Joung
    • 1
  1. 1.Dept. of Info. ManagementNational Taiwan UniversityTaipeiTaiwan

Personalised recommendations