ACM Home Page
Please provide us with feedback. Feedback
Polling in concurrent programming
Full text PdfPdf (536 KB)
Source ACM Annual Computer Science Conference archive
Proceedings of the 17th conference on ACM Annual Computer Science Conference table of contents
Louisville, Kentucky
Pages: 204 - 209  
Year of Publication: 1989
ISBN:0-89791-299-3
Authors
C.-D. Jung  IBM Corporation, P.O. Box 6, Endicott, NY
E. Siberrt  Syracuse University, School of Computer and Information Science, Syracuse, NY
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 26,   Citation Count: 0
Additional Information:

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

ABSTRACT

Hoare introduced the concept of polling in his Communicating Sequential Processes (CSP) to handle nondeterministic message communication in distributed and concurrent programming. In order to introduce the polling concept effectively in a programming language, the problems of simultaneous polling, effective termination, busy waiting, and expressive power in one-to-many or many-to-one communication must be solved. This paper discusses the concept of polling, the details about the problems, and how a new concurrent programming language, COPL, solves the problems. COPL introduces a general algorithm to establish a hierarchical relationship between two communicating processes, an efficient mechanism to handle polling termination, a flexible polling to avoid busy waiting, and implicit polling to add asymmetry in the language for more expressive power. [Key words: concurrent programming, programming languages, polling, nondeterminism, and distributed systems]


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
J.G.P. Barnes. "An Overview of Adam' Software and Practice Experience, 10, 1980, pp. 851-887.
4
 
5
6
 
7
8
9
10
11
 
12
 
13
 
14
M. Jazayeri et al. "CSP/80 - A Language for Communicating Sequential Processes"' Proc. IEEE Compcon Fall 1980, Sep. 1980, pp. 736-740.
15
 
16
 
17
 
18
T.J. Roper and C.J. Barter. "A Communicating Sequential Process Language and Implementation'.' Softw. Prac. Exp., 1981, pp. 1215-1234.
 
19
A. Silberschatz. "Communication and Synchronization in Distributed Systems"' IEEE Trans. Softw. Eng., 5, 6, Nov. 1979, pp. 542-546.
 
20
J. Welsh and A. Lister. "A Comparative Study of Task Communication in Adam' Softw. Prac. Exp., 11, 1981, pp. 257-290.
 
21
R. Williamson and E. Horowitz. "Concurrent Communication and Synchronization Mechanisms?' Softw. Prac. andExp., 14, 2, Feb. 1984, pp. 135-151.
22