Chapter 3: Processes: Silberschatz, Galvin and Gagne ©2013 Operating System Concepts - 9 Edition
Chapter 3: Processes: Silberschatz, Galvin and Gagne ©2013 Operating System Concepts - 9 Edition
Chapter 3: Processes: Silberschatz, Galvin and Gagne ©2013 Operating System Concepts - 9 Edition
Operating System Concepts – 9th Edition Silberschatz, Galvin and Gagne ©2013
Interprocess Communication
Operating System Concepts – 9th Edition 3.2 Silberschatz, Galvin and Gagne ©2013
Communications Models
(a) Message passing. (b) shared memory.
Operating System Concepts – 9th Edition 3.3 Silberschatz, Galvin and Gagne ©2013
Cooperating Processes
Independent process cannot affect or be affected by the execution
of another process
Cooperating process can affect or be affected by the execution of
another process
Advantages of process cooperation
Information sharing
Computation speed-up
Modularity
Convenience
Operating System Concepts – 9th Edition 3.4 Silberschatz, Galvin and Gagne ©2013
Producer-Consumer Problem
Paradigm for cooperating processes, producer process
produces information that is consumed by a consumer
process
unbounded-buffer places no practical limit on the size
of the buffer.
bounded-buffer assumes that there is a fixed buffer
size
Operating System Concepts – 9th Edition 3.5 Silberschatz, Galvin and Gagne ©2013
Bounded-Buffer – Shared-Memory Solution
Shared data
#define BUFFER_SIZE 10
typedef struct {
. . .
} item;
item buffer[BUFFER_SIZE];
int in = 0;
int out = 0;
Operating System Concepts – 9th Edition 3.6 Silberschatz, Galvin and Gagne ©2013
Bounded-Buffer – Producer
item next_produced;
while (true) {
/* produce an item in next produced */
while (((in + 1) % BUFFER_SIZE) == out)
; /* do nothing */
buffer[in] = next_produced;
in = (in + 1) % BUFFER_SIZE;
}
Operating System Concepts – 9th Edition 3.7 Silberschatz, Galvin and Gagne ©2013
Bounded Buffer – Consumer
item next_consumed;
while (true) {
while (in == out)
; /* do nothing */
next_consumed = buffer[out];
out = (out + 1) % BUFFER_SIZE;
Operating System Concepts – 9th Edition 3.8 Silberschatz, Galvin and Gagne ©2013
Interprocess Communication – Shared Memory
Operating System Concepts – 9th Edition 3.9 Silberschatz, Galvin and Gagne ©2013
Interprocess Communication – Message Passing
Operating System Concepts – 9th Edition 3.10 Silberschatz, Galvin and Gagne ©2013
Message Passing (Cont.)
Operating System Concepts – 9th Edition 3.11 Silberschatz, Galvin and Gagne ©2013
Message Passing (Cont.)
Hardware bus
Network
Logical:
Direct or indirect
Synchronous or asynchronous
Automatic or explicit buffering
Operating System Concepts – 9th Edition 3.12 Silberschatz, Galvin and Gagne ©2013
Direct Communication
Processes must name each other explicitly:
send (P, message) – send a message to process P
receive(Q, message) – receive a message from process Q
Properties of communication link
Links are established automatically
A link is associated with exactly one pair of communicating
processes
Between each pair there exists exactly one link
The link may be unidirectional, but is usually bi-directional
Operating System Concepts – 9th Edition 3.13 Silberschatz, Galvin and Gagne ©2013
Indirect Communication
Operating System Concepts – 9th Edition 3.14 Silberschatz, Galvin and Gagne ©2013
Indirect Communication
Operations
create a new mailbox (port)
send and receive messages through mailbox
destroy a mailbox
Primitives are defined as:
send(A, message) – send a message to mailbox A
receive(A, message) – receive a message from mailbox A
Operating System Concepts – 9th Edition 3.15 Silberschatz, Galvin and Gagne ©2013
Indirect Communication
Mailbox sharing
P1, P2, and P3 share mailbox A
P1, sends; P2 and P3 receive
Who gets the message?
Solutions
Allow a link to be associated with at most two processes
Allow only one process at a time to execute a receive
operation
Allow the system to select arbitrarily the receiver.
Sender is notified who the receiver was.
Operating System Concepts – 9th Edition 3.16 Silberschatz, Galvin and Gagne ©2013
Synchronization
Message passing may be either blocking or non-blocking
Blocking is considered synchronous
Blocking send -- the sender is blocked until the message is
received.
Blocking receive -- the receiver is blocked until a message
is available.
Non-blocking is considered asynchronous
Non-blocking send -- the sender sends the message and
continue
Non-blocking receive -- the receiver receives:
A valid message, or
Null message
Different combinations possible
If both send and receive are blocking, we have a rendezvous
Operating System Concepts – 9th Edition 3.17 Silberschatz, Galvin and Gagne ©2013
Synchronization (Cont.)
message next_produced;
while (true) {
/* produce an item in next produced */
send(next_produced);
}
message next_consumed;
while (true) {
receive(next_consumed);
Operating System Concepts – 9th Edition 3.18 Silberschatz, Galvin and Gagne ©2013
Buffering
Operating System Concepts – 9th Edition 3.19 Silberschatz, Galvin and Gagne ©2013
Examples of IPC Systems - POSIX
Operating System Concepts – 9th Edition 3.20 Silberschatz, Galvin and Gagne ©2013
IPC POSIX Producer
Operating System Concepts – 9th Edition 3.21 Silberschatz, Galvin and Gagne ©2013
IPC POSIX Consumer
Operating System Concepts – 9th Edition 3.22 Silberschatz, Galvin and Gagne ©2013
Examples of IPC Systems - Mach
Mach communication is message based
Even system calls are messages
Each task gets two mailboxes at creation- Kernel and Notify
Only three system calls needed for message transfer
msg_send(), msg_receive(), msg_rpc()
Mailboxes needed for commuication, created via
port_allocate()
Send and receive are flexible, for example four options if mailbox full:
Wait indefinitely
Wait at most n milliseconds
Return immediately
Temporarily cache a message
Operating System Concepts – 9th Edition 3.23 Silberschatz, Galvin and Gagne ©2013
Examples of IPC Systems – Windows
Operating System Concepts – 9th Edition 3.24 Silberschatz, Galvin and Gagne ©2013
Local Procedure Calls in Windows
Operating System Concepts – 9th Edition 3.25 Silberschatz, Galvin and Gagne ©2013
Communications in Client-Server Systems
Sockets
Remote Procedure Calls
Pipes
Operating System Concepts – 9th Edition 3.26 Silberschatz, Galvin and Gagne ©2013
Sockets
All ports below 1024 are well known, used for standard
services
Operating System Concepts – 9th Edition 3.27 Silberschatz, Galvin and Gagne ©2013
Socket Communication
Operating System Concepts – 9th Edition 3.28 Silberschatz, Galvin and Gagne ©2013
Sockets in Java
Operating System Concepts – 9th Edition 3.29 Silberschatz, Galvin and Gagne ©2013
Operating System Concepts – 9th Edition 3.30 Silberschatz, Galvin and Gagne ©2013
Remote Procedure Calls
Remote procedure call (RPC) abstracts procedure calls
between processes on networked systems
Again uses ports for service differentiation
Stubs – client-side proxy for the actual procedure on the
server
The client-side stub locates the server and marshalls the
parameters
The server-side stub receives this message, unpacks the
marshalled parameters, and performs the procedure on the
server.
On Windows, stub code compile from specification written in
Microsoft Interface Definition Language (MIDL)
Operating System Concepts – 9th Edition 3.31 Silberschatz, Galvin and Gagne ©2013
Remote Procedure Calls (Cont.)
Data representation handled via External Data
Representation (XDL) format to account for different
architectures
Big-endian and little-endian
Remote communication has more failure scenarios than local
Messages can be delivered exactly once rather than at
most once
OS typically provides a rendezvous (or matchmaker) service
to connect client and server
Operating System Concepts – 9th Edition 3.32 Silberschatz, Galvin and Gagne ©2013
Execution of RPC
Operating System Concepts – 9th Edition 3.33 Silberschatz, Galvin and Gagne ©2013
Pipes
Acts as a conduit allowing two processes to communicate
Issues:
Is communication unidirectional or bidirectional?
In the case of two-way communication, is it half or full-
duplex?
Must there exist a relationship (i.e., parent-child) between
the communicating processes?
Can the pipes be used over a network?
Ordinary pipes – cannot be accessed from outside the process
that created it. Typically, a parent process creates a pipe and
uses it to communicate with a child process that it created.
Named pipes – can be accessed without a parent-child
relationship.
Operating System Concepts – 9th Edition 3.34 Silberschatz, Galvin and Gagne ©2013
Ordinary Pipes
Operating System Concepts – 9th Edition 3.35 Silberschatz, Galvin and Gagne ©2013
Named Pipes
Operating System Concepts – 9th Edition 3.36 Silberschatz, Galvin and Gagne ©2013
End of Chapter 3
Operating System Concepts – 9th Edition Silberschatz, Galvin and Gagne ©2013