Paradigms for process interaction in distributed programs

作者: Gregory R. Andrews

DOI: 10.1145/103162.103164

关键词: Computer scienceAlgorithmicsServerNetwork architectureDistributed algorithmDistributed memoryMessage passingParallel computingDistributed computingConcurrencyFile server

摘要: Distributed computations are concurrent programs in which processes communicate by message passing. Such typically execute on network architectures such as networks of workstations or distributed memory parallel machines (i.e., multicomputers hypercubes). Several paradigms—examples models—for process interaction described. These include filters, clients, and servers, heartbeat algorithms, probe/echo broadcast token-passing decentralized bags tasks. paradigms appliable to numerous practical problems. They illustrated solving problems, including sorting, file computing the topology a network, termination detection, replicated databases, adaptive quadrature. Solutions all problems derived step-wise fashion from general specification problem concrete solution. The derivations illustrate techniques for developing algorithms.

参考文章(71)
William R. Crowther, Robert H. Thomas, The Uniform System: An approach to runtime support for large scale shared memory parallel processors. international conference on parallel processing. pp. 245- 254 ,(1988)
G. Hommel, B. Liskov, L. Lamport, F. B. Schneider, M. W. Alford, G. P. Mullery, J. P. Ansart, Distributed Systems: Methods and Tools for Specification. An Advanced Course ,(1985)
Mamoru Maekawa, Arthur E Oldehoeft, Rodney R Oldehoeft, Operating Systems: Advanced Concepts ,(1987)
Leslie Lamport, Fred B. Schneider, Paradigms for Distributed Programs Distributed Systems: Methods and Tools for Specification, An Advanced Course, April 3-12, 1984 and April 16-25, 1985 Munich. pp. 431- 480 ,(1985)
Abraham Silberschatz, Operating Systems Concepts ,(2003)
M. Raynal, D. Beeson, Algorithms for mutual exclusion ,(1986)