A structure for interprocess communication in a data communications handler
Pages 356 - 360
Abstract
The use of an implementation which models a simple single server queuing system to control transfers between processes in a communications handler is described. Exchanges between processes are carried by three word elements, called LINKs, which are used to transfer control information and to assign data to processes. The managements of interactions by the single queue structure is used to coordinate parallel, time-independent operation of the attached processes, with the interface provided by the LINKs giving a simple yet flexible interface between activities. The implementation is a special purpose operating system designed for use in a PDP-11 computer dedicated to handling transfers of control and data between a number of communicating processes, which are connected to the PDP-11 by communications lines, direct memory access interfaces and shared memory.
References
[1]
Dijkstra, E.W. Solution of a problem in concurrent programming control, Comm. ACM 8, 9 (Sept. 1965), 569.
[2]
Knuth, D.E. Additional comments on a problem in concurrent programming control, Comm. ACM 9, 5 (May 1966), 321-322.
[3]
Eisenberg, M.A. and McGuire M.R. Further comments on Dijkstra's concurrent programming control problem, Comm. ACM 15, 11. (Nov. 1972), 999.
[4]
deBruijn, N.G. Additional comments on a problem in concurrent programming control, Comm. ACM 10, 3 (Mar. 1967), 137-138.
[5]
Lamport, Leslie. A new solution of Dijkstra's concurrent programming problem, Comm. ACM 17, 8 (Aug. 1974), 453-455.
[6]
Tibbals, H.F. A treatment of Dijkstra's concurrent programming problem by a formalism based on queuing theory, submitted for publication, Comm. ACM
[7]
Dijkstra, E.W. The structure of THE multiprogramming system, Comm. ACM 11, 5 (May 1968) 341-346.
[8]
Habermann, A.N. Synchronization of Communicating processes, Comm. ACM 15, 3 (Mar. 1972),171-176.
[9]
Chan, W.C. and Chung, W.K. Computer controlled queuing systems with feedback, Proc. Inst. Elec. Engrs. 118, (1971) 1373-1377.
[10]
Adiri, I., Hofri, M. and Yadin, M. A multiprogramming queue, JACM 20, 4 (Oct. 1973), 589-603.
[11]
Mitrani, I. A queuing model of priority multiprogramming, Univ. of Newcastle-upon-Tyne Computing Laboratory, Tech. Rept. No. 41, (Dec. 1972)
[12]
Cohen, J.W. Some aspects of queuing theory, Statistic Neerlandica 28, (1974), 55-67.
[13]
Spier, Michael J. and Organick, Eliott I. The Multics interprocess communication facility, Proc. Second Symp. on Operating Systems Principles (Oct. 1969) 83-91.
[14]
Brinch Hansen, P. The nucleus of a Multiprogramming system, Comm. ACM 13, 4 (Apr. 1970), 238-241, 250.
[15]
Furtek, Frederick. A new approach to Petri Nets, MIT Project MAC Computation Structures Group Memo 123 (Apr. 1975)
[16]
Feinroth, Y., Franceschini, E. and Goldstein, M. Telecommunications using a front end mini-computer, Comm. ACM 16, 3 (Mar. 1973) 153-160
[17]
Pettersen, Odd. Synchronization of Concurrent Processes, Staford University Computer Science Dept. Rept. No. STAN-CS-75-502 (July 1975)
[18]
M. Kolar, A.A. Young, P. Shelton and H.F. Tibbals. Sharing a Communications Line between Interactive VDU Terminals and a Batch Remote Job Entry Terminal via a specially designed Interface. Proc. Int. Conf. on Mini-computers in Data Communications (AIM, Liege, Jan. 1975)
Index Terms
- A structure for interprocess communication in a data communications handler
Recommendations
One-to-many interprocess communication in the V-system
SIGCOMM '84: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposiumInterprocess communication (IPC) normally allows one process to communicate with only one other process at a time. One-to-many IPC allows one process to communicate simultaneously with a group of processes., possibly of unknown membership. While the ...
Comments
Information & Contributors
Information
Published In
Copyright © 1976 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 October 1976
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 174Total Downloads
- Downloads (Last 12 months)13
- Downloads (Last 6 weeks)7
Reflects downloads up to 15 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in