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
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2(4):226–241, 1988.
R.J.R. Back and R. Kurki-Suonio. Distributed cooperation with action systems. ACM TOPLAS, 10(4):513–554, October 1988.
R. Bagrodia. Process synchronization: Design and performance evaluation of distributed algorithms. IEEE TSE, SE-15(9):1053–1065, September 1989.
R. Bagrodia. Synchronization of asynchronous processes in CSP. ACM TOPLAS, 11(4):585–597, October 1989.
T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14:25–59, 1987.
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.
K.L. Chung. A Course in Probability Theory. A Series of Monographs and Textbooks. Academic Press, second edition, 1974.
N. Francez and I.R. Forman. Interacting Processes: A Multiparty Approach to Coordinated Distributed Programming. Addison Wesley, 1995.
N. Francez, B. Hailpern, and G. Taubenfeld. Script: A communication abstraction mechanism. Science of Computer Programming, 6(1):35–88, January 1986.
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.
D. Harel. Algorithmics: The Spirit of Computing. Addison-Wesley, 1987.
C.A.R. Hoare. Communicating sequential processes. CACM, 21(8):666–677, August 1978.
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.
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.
Y.-J. Joung. Characterizing fairness implementability for multiparty interaction. In Proceedings of the 23rd ICALP, LNCS 1099, pages 110–121, 1996.
Y.-J. Joung and S.A. Smolka. Coordinating first-order multiparty interactions. ACM TOPLAS, 16(3):954–985, May 1994.
Y.-J. Joung and S.A. Smolka. A comprehensive study of the complexity of multiparty interaction. JACM, 43(1):75–115, January 1996.
Y.-J. Joung and S.A. Smolka. Strong interaction fairness via randomization. In Proceedings of the 16th ICDCS, pages 475–483, 1996.
D. Kumar. An implementation of N-party synchronization using tokens. In Proceedings of the 10th ICDCS, pages 320–327, 1990.
R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I. Information and Computation, 100(1):1–40, September 1992.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, II. Information and Computation, 100(1):41–77, September 1992.
M.H. Park and M. Kim. A distributed synchronization scheme for fair multi-process handshakes. IPL, 34:131–138, April 1990.
S. Ramesh. A new and efficient implementation of multiprocess synchronization. In Proceedings Conference on PARLE, LNCS 259, pages 387–401, 1987.
S. Ramesh. A new efficient implementation of CSP with output guards. In Proceedings of the 7th ICDCS, pages 266–273, 1987.
J.H. Reif and P.G. Spirakis. Real time synchronization of interprocess communications. ACM TOPLAS, 6(2):215–238, April 1984.
P.A. Sistla. Distributed algorithms for ensuring fair interprocess communications. In Proceedings of the 3rd ACM PODC, pages 266–277, 1984.
Y.-K. Tsay and R.L. Bagrodia. Some impossibility results in interprocess synchronization. Distributed Computing, 6(4):221–231, 1993.
Y.-K. Tsay and R.L. Bagrodia. Fault-tolerant algorithms for fair interprocess synchronization. IEEE TPDS, 5(7):737–748, June 1994.
U.S. Department of Defense. Reference Manual for the Ada Programming Language. ANSI/MIL-STD-1815A. U.S. Government Printing Office, 1983.
Author information
Authors and Affiliations
Editor information
Rights 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