ACM Home Page
Please provide us with feedback. Feedback
Primitives for distributed computing
Full text PdfPdf (877 KB)
Source ACM Symposium on Operating Systems Principles archive
Proceedings of the seventh ACM symposium on Operating systems principles table of contents
Pacific Grove, California, United States
Pages: 33 - 42  
Year of Publication: 1979
ISBN:0-89791-009-5
Author
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 29,   Citation Count: 31
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800215.806567
What is a DOI?

ABSTRACT

Distributed programs that run on nodes of a network are now technologically feasible, and are well-suited to the needs of organizations. However, our knowledge about how to construct such programs is limited. This paper discusses primitives that support the construction of distributed programs. Attention is focussed on primitives in two major areas: modularity and communication. The issues underlying the selection of the primitives are discussed, especially the issue of providing robust behavior, and various candidates are analyzed. The primitives will ultimately be provided as part of a programming language that will be used to experiment with construction of distributed programs.


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
 
2
Scherr, A. L. Distributed data processing. IBM Systems Journal 17, 4 (1978), 324-343.
 
3
Fuller, S. H., et al. A Collection of Papers on CM: A Multi-microprocessor Computer System.# Department of Computer Science, Carnegie Mellon University, February 1977.
 
4
Hewitt, C. Viewing control structures as patterns of passing messages. Artificial Intelligence 8, 1977, 323-364.
5
 
6
Feldman, J. A. A Programming Methodology for Distributed Computing, Technical Report 9, Department of Computer Science, University of Rochester, Rochester, N. Y., 1977.
7
 
8
9
 
10
Brinch Hansen, P. The programming language Concurrent Pascal. |IEEE Trans. on Software Engineering 1,# 2 (June 1975), 199-207.
 
11
 
12
Saltzer, J. H., and Schroeder, M. D. The protection of information in computer systems. Proc. of the IEEE 63, 9 (September 1975), 1278-1308.
 
13
Hewitt, C., and Atkinson, R. Specification and proof techniques for serializers. IEEE Trans. on Software Engineering SE-5, 1 (January 1979), 10-23.
14
 
15
Thomas, R. H. A Solution to the Update Problem for Multiple Copy Data Bases Which Uses Distributed Control. BBN Reporta 3340, Bolt Beranek and Newman, Inc., Cambridge, Mass., July 1976.
 
16
 
17
Rothnie, J. B., Bernstein, P. A., Goodman, N., and Papadimitriou, C. A. The Redundant Update Methodology of SDD-1: A System for Distributed Databases. Technical Report. Computer Corporation of America, Cambridge, Mass., February 1977.
 
18
Lampson, B., and Sturgis, H. Crash Recovery in a Distributed Data Storage System Xerox Research Center, Palo Alto, Ca., 1976.
 
19
 
20
21
 
22
Balzer, R. M. PORTS—a method for dynamic interprogram communication and job control. Proc. of the AFIPS Conference 39 (1971).

CITED BY  31