Paradigms for process interaction in distributed programs

ACM Computing Surveys (CSUR)

Volumn 23, Issue 1, 1991, Pages 49-90

  Andrews, Gregory R ^a  

^a UNIVERSITY OF ARIZONA   (United States)

Author keywords

clients and servers; distributed and parallel algorithms; distributed programming; distributed programming methods; heartbeat algorithms; networks of filters; patterns for interprocess communication; probe echo algorithms; replicated servers; token passing algorithms

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER SYSTEMS, DIGITAL - DISTRIBUTED;

CONCURRENT PROGRAMS; DISTRIBUTED ALGORITHMS; MESSAGE PASSING; PARALLEL ALGORITHMS;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0026122833     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/103162.103164     Document Type: Article

References (67)

1. AFEK, Y., AWERBUCH, B, AND GAFNI, E. 1987. Applying static network protocols to dynamic networks. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science IEEE Computer Society (Los Angeles, Oct.), pp. 358-370.
2. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
3. AKL, S. G. 1985. Parallel Sorting Algorithms. Academic Press, New York.
4. ALLEN, F., BURKE, M., CHARLES, P., CYTRON, R., AND FERRANTE, J. 1988. An overview of the PTRAN analysis system. J. Parallel Distrib. Comput. 5, 5 (Oct.), 617-640.
5. ANDREWS, G R. 1991. Concurrent Programming: Principles and Practice. Benjamin/Cummings, Redwood City, Calif. To be published.
6. ANDREWS, G. R., AND SCHNEIDER, F. B. 1983. Concepts and notations for concurrent programming. ACM Comput. Surv. 15, 1 (Mar), 3-43.
7. ANDREWS, G. R., OLSSON, R. A., COFFIN, M., ELSHOFF, I., NILSEN, K., PURDIN, T., AND TOWNSEND, G. 1988. An overview of the SR language and implementation. ACM Trans. Program. Lang. Syst. 10, 1 (Jan.), 51-86.
8. ANNARATONE, M., ARNOULD, E, GROSS, T, KUNG, H. T., LAM, M. S., MEZILCIOGLU, O., SAROCKY, K., AND WEBB, J. A. 1986 In Proceedings of the 13th International Symposium on Computer Architecture. Computer Science Press, Rockville, Md., pp. 346-356.
9. ATKINS, M. S., AND OLSSON, R. A. 1988. Performance of multi-tasking and synchronization mechanisms in the programming language SR. Softw. Pract. Exper. 18, 9 (Sept.), 879-895.
10. BAL, H. E, STEINER, J. G., AND TANENBAUM, A. S. 1989 Programming languages for distributed systems. ACM Comput. Surv. 21, 3 (Sept.), 261-322.
11. BERNSTEIN, A. J. 1980 Output guards and non-determinism in CSP. 1980. ACM Trans. Program Lang. Syst. 2, 2 (Apr.), 234-238.
12. BIRMAN, K. P., AND JOSEPH, T. A. 1987. Reliable communication in the presence of failures. ACM Trans. Comput. Syst. 5, 1 (Feb.), 47-76.
13. HARRIERO, N., GELERNTER, D, AND LEICHTER, J. 1986. Distributed data structures in Linda. Thirteenth ACM Symposium on Principles of Programming Languages. ALM SIGPLAN and SIGACT (Williamsburg, Virginia, Jan.), pp. 236-242.
14. CHANDRASEKARAN, S. AND VENKATESAN, S. 1990. A message-optimal algorithm for distributed termination detection. J. Parallel Distrib. Comput. 8, 245-292.
15. CHANDY, K. M., AND LAMPORT, L. 1985. Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst. 3, 1 (Feb.), 63-75.
16. CHANDY, K. M., AND MISRA, J. 1984. The drinking philosophers problem. ACM Trans Program. Lang. Syst. 6, 4 (Oct.), 632-646.
17. CHANG, E. J. H. 1979. Decentralized algorithms in distributed systems. TR CSRG-103. Ph.D. dissertation, Computer Systems Research Group, University of Toronto, October.
18. CHANG, E. J. H. 1982. Echo algorithms: Depth parallel operations on general graphs. IEEE Trans Softw. Eng. 8, 4 (Jul.), 391-401.
19. CLARK, D. 1985 The structuring of systems using upcalls. In Proceedings of the 10th ACM Symposium on Operating Systems Principles. ACM SIGOPS (Orcas Island, Wash., Dec.), pp. 171-180.
20. COURTOIS, P. J., HEYMANS, F., AND PARNAS, D. L. 1971. Concurrent control with “readers” and “writers” Commun. ACM 14, 10 (Oct.), 667-668.
21. DIJKSTRA, E. W 1976. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, NJ.
22. DIJKSTRA, E. W., AND SCHOLTEN, C. S. 1980. Termination detection in diffusing computations. Inf. Process. Lett. 11, 1 (Aug.), 1-4.
23. DIJKSTRA, E. W., FEIJEN, W. H. J., AND VAN GASTEREN, A. J. M. 1983. Derivation of a termination detection algorithm for distributed computation. Inf. Process. Lett. 16, 5 (Jun.), 217-219.
24. ELSHOFF, I. J. P., AND ANDREWS, G. R. 1988. The development of two distributed algorithms for network topology. Tech. Rep. TR 88-13. Dept. of Computer Science, Univ. of Arizona.
25. FINKEL R, AND MANBER, U. 1987. DIB: A distributed implementation of backtracking. ACM Trans. Program. Lang. Syst. 9, 2 (Apr.), 235-256.
26. Fox, G. C., JOHNSON, M. A., LYZENGA, G. A., OTTO, S. W., SALMON, J. K., AND WALKER, D. W. 1988. Solving Problems on Concurrent Processors, Volume I: General Techniques and Regular Problems. Prentice Hall, Englewood Cliffs, NJ
27. FRANCEZ, N. 1980. Distributed termination. ACM Trans. Program. Lang. Syst. 2, 1 (Jan.), 42-55.
28. GEHANI, N. H., AND ROOME, W. D. 1986. Concurrent C. Softw. Pract. Exper. 16, 9 (Sept.), 821-844.
29. GELERNTER, D. 1985. Generative communication in Linda. ACM Trans. Program. Lang. Syst. 7, 1 (Jan.), 80-112.
30. GENTLEMAN, W. M. 1981. Message passing between sequential processes: The reply primitive and the administrator concept. Softw. Pract. Exper. 11, 435-466.
31. GIFFORD, D. K. 1979. Weighted voting for replicated data. In Proceedings of the 7th Symposium on Operating Systems Principles. ACM SIGOPS (Pacific Grove, Calif., Dec.), pp. 150-162.
32. GRIT, D. H., AND MCGRAW, J. R. 1985. Programming divide and conquer on a MIMD machine. Softw. Pract. Exper. 15, 1 (Jan.), 41-53.
33. HALSTEAD, R. H. 1985. Multilisp: A language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7, 4 (Oct.), 501-538.
34. HILLIS, W. D. 1985. The Connection Machine. MIT Press, Cambridge, Mass.
35. HOARE, C. A. R. 1974. Monitors: An operating system structuring concept. Commun. ACM 17, 10 (Oct.), 549-557.
36. HOARE, C. A. R. 1978. Communicating sequential processes. Commun. ACM 21, 8 (Aug.), 666-677.
37. LAMPORT, L. 1978. Time, clocks, and the ordering of events in distributed systems. Commun. ACM 21, 7 (Jul.), 558-565.
38. LAMPORT, L. 1982. An assertional correctness proof of a distributed algorithm. Sci. Comput. Program. 2, 3 (Dec.), 175-206.
39. LAMPORT, L., SHOSTAK, R. AND PEASE, M. 1982. The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 3, 3 (Jul.), 382-401.
40. LAUER, H. C., AND NEEDHAM, R. M. 1978. On the duality of operating system structures. In Proceedings of the 2nd International Symposium on Operating Systems. (IRIA, Paris, Oct.). Reprinted in Oper. Syst. Rev. 13, 2 (Apr. 1979), 3-19.
41. LELANN, G. 1977. Distributed systems: Towards a formal approach. In Proceedings of Information Processing 77. North-Holland Publishing Co., Amsterdam, pp. 155-160.
42. MAEKAWA, M. 1985. A algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3, 2 (May), 145-159.
43. MAEKAWA, M., OLDEHOEFT, A. E., AND OLDEHOEFT, R. R. 1987. Operating Systems; Advanced Concepts. Benjamin/Cummings Publishing Co., Menlo Park, Calif.
44. MARZULLO, K., AND OWICKI, S. S. 1983. Maintaining the time in a distributed system. In Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing. (Montreal, Aug.), pp. 295-305.
45. MCCURLEY, R., AND SCHNEIDER, F. B. 1986. Derivation of a distributed algorithm for finding paths in directed networks. Sci. Comput. Program. 6, 1 (Jan.), 1-9.
46. MISRA, J. 1983. Detecting termination of distributed computations using markers. In Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing. ACM SIGOPS and SIGACT (Montreal, Aug.), pp. 290-294.
47. MISRA, J., AND CHANDY, K. M. 1982. Termination detection of diffusing computations in communicating sequential processes. ACM Trans. Program. Lang. Syst. 4, 1 (Jan.), 37-43.
48. MITCHELL, J. G., MAYBURY, W., AND SWEET, R. 1979. Mesa language manual, version 5.0. Report CSL-79-3, Xerox Palo Alto Research Center, Palo Alto, Calif.
49. MORGAN, C. 1985. Global and logical time in distributed algorithms. Inf. Process. Lett. 20, 4 (May), 189-194.
50. OWICKI, S. AND GRIES, D. 1976. An axiomatic proof technique for parallel programs. Acta Inf. 6, 319-340.
51. PETERSON, J. L., AND SILBERSCHATZ, A. 1985. Operating Systems Concepts. 2nd ed. Addison-Wesley, Reading, Mass.
52. RANA, S. P. 1983. A distributed solution of the distributed termination problem. Inf. Process. Lett. 17, 1 (Jul.), 43-46.
53. RAYNAL, M. 1986. Algorithms for Mutual Exclusion. The MIT Press, Cambridge, Mass.
54. RAYNAL, M. 1988a. Networks and Distributed Computation. The MIT Press, Cambridge, Mass.
55. RAYNAL, M. 1988b. Distributed Algorithms and Protocols. John Wiley & Sons, New York.
56. RICART, G. AND AGRAWALA, A. K. 1981. An optimal algorithm for mutual exclusion. Commun. ACM 24, 1 (Jan.), 9-17.
57. SANDBERG, R., GOLDBERG, D. KLEIMAN, S., WALSH, D., AND LYON, B. 1985. Design and implementation of the Sun network filesystem. In Proceedings of the Usenix Conference. (June). pp. 119-130.
58. SCHLICHTING, R. D., AND SCHNEIDER, F. B. 1983. Fail-stop processors: An approach to designing fault-tolerant computing systems. ACM Trans. Comput. Syst. 1, 3 (Aug.), 222-238.
59. SCHNEIDER, F. B. 1980. Ensuring consistency in a distributed database system by use of distributed semaphores. In Proceedings of International Symposium on Distributed Databases. (Versailles, France, Mar.), pp. 183-189.
60. SCHNEIDER, F. B. 1982 Synchronization in distributed programs. ACM Trans. Program. Lang. Syst. 4, 2 (Apr.), 179-195.
61. SCHNEIDER, F. B., AND LAMPORT, L. 1985. Paradigms for distributed programs. In Distributed Systems: Methods and Tools for Specification, An Advanced Course. Lecture notes in Comput. Sci. 190. Springer-Verlag, Berlin.
62. SCHNEIDER, F. B., GRIES, D., AND SCHLICHTING, R. D. 1984. Fault-tolerant broadcasts. Sci. Comput. Program. 4, 1-15.
63. SILBERSCHATZ, A 1979. Communication and synchronization in distributed systems. IEEE Trans. Softw. Engr. SE 5, 6 (Nov.), 542-546.
64. SUZUKI, I., AND KASAMI, T. 1985. A distributed mutual exclusion algorithm. ACM Trans. Comput. Syst. 3, 4 (Nov.), 344-349.
65. TANENBAUM, A. S. 1988. Computer Networks, Second Edition. Prentice-Hall, Englewood Cliffs, N.J THOMAS, R. H. 1979. A majority consensus approach to concurrency control in multiple copy databases. ACM Trans. Database Syst 4, 2 (Jun.), 180-209.
66. THOMAS, R. H., AND CROWTHER, W. 1988. The uniform system: An approach to runtime support for large scale shared memory parallel processors. In Proceedings of the 1988 International Conference on Parallel Processing. IEEE Computer Society (St. Charles, Illinois, Aug.), pp. 245-254.
67. THOMPSON, K. 1978. UNIX implementation. Bell Syst. Tech. J. 57, 6, part 2 (Jul.-Aug.), 1931-1946