Strong interaction fairness via randomization

IEEE Transactions on Parallel and Distributed Systems

Volumn 9, Issue 2, 1998, Pages 137-149

  Joung, Yuh Jzer ^a   Smolka, Scott A ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b USA   (United States)

Author keywords

Committee coordination; Distributed algorithms; Multiparty interaction; Randomized algorithms; Strong interaction fairness; Weak interaction fairness

Indexed keywords

DATA COMMUNICATION SYSTEMS; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; RANDOM PROCESSES; REAL TIME SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

DISTRIBUTED ALGORITHMS; MULTIPARTY INTERACTION; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 0031998928     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.663873     Document Type: Article

References (20)

1. K.R. Apt, N. Francez, and S. Katz, "Appraising Fairness in Languages for Distributed Programming,Distributed Computing, vol. 2, no. 4, pp. 226-241, 1988.
2. P.C. Attie, I.R. Forman, and E. Levy, "On Fairness as an Abstraction for the Design of Distributed Systems," Proc. 10th Int'l Conf. Distributed Computing Systems, pp. 150-157, Paris, 1990.
3. P.C. Attie, N. Francez, and O. Grumberg, "Fairness and Hyperfairness in Multi-Party Interactions," Distributed Computing, vol. 6, pp. 245-254, 1993.
4. R. Bagrodia, "Process Synchronization: Design and Performance Evaluation of Distributed Algorithms," IEEE Trans. Software Eng., vol. 15, no. 9, pp. 1,053-1,065, Sept. 1989.
5. K.M. Chandy and J. Misra. A Foundation of Parallel Program Design. Addison-Wesley, 1988.
6. K.L. Chung. A Course in Probability Theory. A Series of Monographs and Textbooks, second ed. New York: Academic Press, 1974.
7. N. Francez and I.R. Forman. Interacting Processes: A Multiparty Approach to Coordinated Distributed Programming. Addison Wesley, 1996.
8. N. Francez and M. Rodeh, "A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme," Technical Report TR-80, IBM Israel Scientific Center, Apr. 1980. A preliminary version appeared in Proc. 21st Ann. IEEE Symp. Foundations of Computer Science, pp. 373-379, Long Beach, Calif., 1980.
9. Y.-J. Joung, "Characterizing Fairness Implementability for Multiparty Interaction," Proc. 23rd Int'l Colloquium Automata, Languages, and Programming, pp. 110-121, Paderborn, Germany, July 1996. Lecture Notes in Computer Science 1099. Springer-Verlag.
10. Y.-J. Joung and S.A. Smolka, "Coordinating First-Order Multiparty Interactions," ACM Trans. Programming Languages and Systems, vol. 16, no. 3, pp. 954-985, May 1994.
11. Y.-J. Joung and S.A. Smolka, "A Comprehensive Study of the Complexity of Multiparty Interaction," J. ACM, vol. 43, no. 1, pp. 75-115, Jan. 1996.
12. D. Kumar, "An Implementation of N-Party Synchronization Using Tokens," Proc. 10th Int'l Conf. Distributed Computing Systems, pp. 320-327, Paris, May 28-June 1, 1990.
13. D. Lehman and M.O. Rabin, "On the Advantage of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem (extended abstract)," Proc. Eighth Ann. ACM Symp. Principles of Programming Languages, pp. 133-138, 1981.
14. M.H. Park and M. Kim, "A Distributed Synchronization Scheme for Fair Multi-Process Handshakes," Information Processing Letters, vol. 34, pp. 131-138, Apr.1990.
15. S. Ramesh," A New and Efficient Implementation of Multiprocess Synchronization," Proc. Conf. PARLE, Lecture Notes in Computer Science 259, pp. 387-401. Berlin: Springer-Verlag, 1987.
16. M. Raynal, Algorithms for Mutual Exclusion. Cambridge, Mass.: MIT Press, 1986.
17. J.H. Reif and P.G. Spirakis, "Real Time Synchronization of Interprocess Communications," ACM Trans. Programming Languages and Systems, vol. 6, no. 2, pp. 215-238, Apr. 1984.
18. P.A. Sistla, "Distributed Algorithms for Ensuring Fair Interprocess Communications," Proc. Third Ann. ACM Symp. Principles of Distributed Computing, pp. 266-277, 1984.
19. Y.-K. Tsay and R.L. Bagrodia, "Some Impossibility Results in Interprocess Synchronization," Distributed Computing, vol. 6, no. 4, pp. 221-231, 1993.
20. Y.-K. Tsay and R.L. Bagrodia, "Fault-Tolerant Algorithms for Fair Interprocess Synchronization," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 7, pp. 737-748, June 1994.