ACM Home Page
Please provide us with feedback. Feedback
Limitations of synchronous communication with static process structure in languages for distributed computing
Full text PdfPdf (1.48 MB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages table of contents
St. Petersburg Beach, Florida
Pages: 150 - 159  
Year of Publication: 1986
Authors
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 28,   Citation Count: 10
Additional Information:

abstract   references   cited by   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/512644.512658
What is a DOI?

ABSTRACT

Modules in a distributed program are active, communicating entities. A language for distributed programs must choose a set of communication primitives and a structure for processes. This paper examines one possible choice: synchronous communication primitives (such as rendez-vous or remote procedure call) in combination with modules that encompass a fixed number of processes (such as Ada tasks or UNIX processes). An analysis of the concurrency requirements of distributed programs suggests that this combination imposes complex and indirect solutions to common problems and thus is poorly suited for applications such as distributed programs in which concurrency is important. To provide adequate expressive power, a language for distributed programs should abandon either synchronous communication primitives or the static process structure.


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
3
4
5
 
6
Cook, R. P. "Starmod- a language for distributed programming". <i>IEEE Transactions on Software Engineering 6,</i> 6 (November 1980), 563--571.
 
7
8
 
9
Gehani, N. "Concurrency in Ada and Multicomputers". <i>Computer Languages 7,</i> 2 (1982).
 
10
11
12
13
14
15
16
 
17
B. Liskov and M. Herlihy. Issues in Process and Communication Structure for Distributed Programs. Proceedings of the Third IEEE Symposium on Reliability in Distributed Software and Database Systems, October, 1983.
18
19
 
20
Mitchell, J., G., Maybury, W., and Sweet, R. Mesa language manual, version 5.0. CSL-79-3, Xerox Palo Alto Research Center, April, 1979.
 
21
 
22
Rashid, R. An inter-process communication facility for Unix. CMU-CS-81-124, Carnegie-Mellon University, 1980.
 
23
Schuman, S. A., Clarke, E. M., Nikolaou, C. N. Programming Distributed Applications in Ada: a First Approach. Proceedings of the 1981 Conference on Parallel Processing, Aug., 1981.
 
24
Segall, Z. and Rudolph, L. PIE - a programming and instrumentation environment for parallel processing. CMU-CS-85-128, Carnegie-Mellon University, 1985.
 
25
Wegner, P. and Smolka, S. "Processes, tasks, and monitors: a comparative study of concurrent programming primitives". <i>IEEE Transactions on Software Engineering 9,</i> 4 (July 1983), 39--59.
 
26
Welsh, J., and Lister, A. "A comparative Study of Task Communication in Ada". <i>Software - Practice and Experience 11</i> (1981), 257--290.
 
27
Yemini, S. On the suitability of Ada multitasking for expressing parallel algorithms. Proceedings of AdaTEC Conference on Ada, Oct., 1982.

CITED BY  10
Collaborative Colleagues:
Barbara Liskov: colleagues
Maurice Herlihy: colleagues
Lucy Gilbert: colleagues