|
ABSTRACT
Much of the work to date on distributed systems has focused on the correct choice of communication paradigm, stressing (for example) message primitives, remote procedure call, problem- oriented protocols and so on. A distributed system service is then implemented as a module executing on particular server machine that is accessed using these communication facilities. In contrast, the shared memory paradigm has been used on multiprocessor and uniprocessor systems. In the shared memory paradigm, the state of a service is stored in shared memory and implemented in a decentralization fashion across multiple processors using this shared memory.This paper describes some preliminary thoughts on applying the shared memory paradigm to distributed systems. For efficiency reasons, shared memory is not provided in its full generality, but only with the semantics required for the applications of interest. This type of application-specific memory is called a problem-oriented shared memory. The use of problem- oriented shared memory is illustrated by describing several applications we are exploring in the V distributed system. We also discuss basic requirements on a communication system to support this approach.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
E.J. Berglund and D.R. Cheriton. Amaze: A Distributed Multi-Player Game Program using the Distributed V Kernel. Fourth International Conference on Distributed Systems, 1984.
|
 |
2
|
|
 |
3
|
|
 |
4
|
|
| |
5
|
J. Bloch, D. Daniels and A. Spector. Weighted Voting for Directories: a Comprehensive Study. Tech. Rept. CMU-CS-84-114, CMU Computer Science Technical Report, 1984.
|
 |
6
|
|
| |
7
|
D.R. Cheriton. "The V Kernel: A Software Base for Distributed Systems." IEEE Software 1, 2 (April 1984).
|
 |
8
|
|
| |
9
|
D.R. Cheriton. Atomic Transactions in V. Stanford Distributed Systems Group - working paper
|
| |
10
|
D. Cheriton and T. Mann. A Decentralized Naming Architecture. Stanford Distributed Systems Group - working paper
|
 |
11
|
|
| |
12
|
E. Cooper. Circus: a Replicated Procedure Call. Proc. 4th Symp. on Reliability in Distributed Software and Database Systems, October, 1984, pp. 11--24.
|
| |
13
|
F. Cristian, H. Aghili, R. Strong and D. Dolev. Atomic Broadcast: From Simple Message Diffusion to Byzantive Agreement, 15th Int. Symp. on Fault-Tolerant Computing, June, 1985.
|
| |
14
|
D. Gelernter, N. Carriero, S. Chandran and S. Chang. Parallel Programming in Linda. Int. Conf. on Parallel Processing, IEEE Computer Society, August, 1985.
|
 |
15
|
|
 |
16
|
Joseph Y. Halpern , Barbara Simons , Ray Strong , Danny Dolev, Fault-tolerant clock synchronization, Proceedings of the third annual ACM symposium on Principles of distributed computing, p.89-102, August 27-29, 1984, Vancouver, British Columbia, Canada
[doi> 10.1145/800222.806739]
|
 |
17
|
|
 |
18
|
Michael B. Jones , Richard F. Rashid , Mary R. Thompson, Matchmaker: an interface specification language for distributed processing, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.225-235, January 14-16, 1985, New Orleans, Louisiana, United States
[doi> 10.1145/318593.318644]
|
 |
19
|
|
| |
20
|
H.C. Lauer and R.M. Needham. On the Duality of Operating Systems Structures. Proceedings Second International Symposium on Operating Systems, IRIA, October, 1978.
|
 |
21
|
|
| |
22
|
R.M. Needham and A.J Herbert. The Cambridge Distributed Computing System. Addison-Wesley, 1982.
|
| |
23
|
|
 |
24
|
|
 |
25
|
|
 |
26
|
Bruce Walker , Gerald Popek , Robert English , Charles Kline , Greg Thiel, The LOCUS distributed operating system, Proceedings of the ninth ACM symposium on Operating systems principles, p.49-70, October 10-13, 1983, Bretton Woods, New Hampshire, United States
|
|