OSLec 4& 5(Processesinoperatingsystem).ppt

3.2
Chapter 3: Processes
 Process Concept
 Process Scheduling
 Operations on Processes
 Interprocess Communication
 Examples of IPC Systems
 Communication in Client-Server Systems

3.3
Objectives
 To introduce the idea of a process -- a
program in execution, which forms the
basis of all calculation
 To describe the various features of
processes, including scheduling,
creation and termination, and
communication
 To describe communication in client-
server systems

3.4
Process
 Process ---- Program in execution
 process-- Instance of a running program
 Program counter -- Address of the next
instruction to be executed
 Data section --- Global variable
 Stack -- Temporary data, return the address
 Process is a active entity -- Program is a
passive entity


3.5
Process
 An execution of program is a process. It is an
active entity . It contain program code as well as
current information of executing program.
 It has a program counter which store address of
the next instruction ,stack,CPU register, data
section.

3.6
Process Concept
 An operating system executes a variety of
programs:
 Batch system – jobs
 Time-shared systems – user programs or tasks
 Process – a program in execution; process
execution must progress in sequential fashion
 A process includes:
 program counter
 stack
 data section

3.8
Process State
 As a process executes, it changes state
 new: The process is being created
 running: Instructions are being
executed
 waiting: The process is waiting for
some event to occur
 ready: The process is waiting to be
assigned to a processor
 terminated: The process has finished
execution

3.10
Process in Memory
 Text section-- Consist of compiled program
code.
 Data Section-- allocated and initialized to
executing e.g: Global variable
 Heap-- memory dynamically allocated during
process runtime
 Stack.-- containing temporary data.

3.11
Process Control Block (PCB)
Information associated with each process
 Process state
 Program counter
 CPU registers
 CPU scheduling information
 Memory-management information
 Accounting information
 I/O status information

3.12
 Data structured maintained by OS for every
process
 PCB identified by an integer process ID (PID).
 PCB keeps all the information needed to keep
track of the process.

3.13

3.14
CPU Switch From Process to Process

3.15
Process Scheduling Queues
 Job queue – set of all processes in the
system
 Ready queue – set of all processes
residing in main memory, ready and
waiting to execute
 Device queues – set of processes
waiting for an I/O device
 Processes migrate among the various
queues

3.16
Types of scheduling
 Preemptive scheduling--- CPU can be taken
away from running process at any time weather
the process has completed its execution or not.
1. If the process switches Running to Ready state.
2. If the process switches from waiting to ready
state.
 Non- Preemptive scheduling-- In this state,
CPU can’t be taken away from the process till
the process completes it’s execution or
terminates.
1. If the process switches from Running to waiting

3.17
Ready Queue And Various I/O Device Queues

3.18
Representation of Process Scheduling

3.19
Schedulers
 Long-term scheduler (or job scheduler)
– selects which processes should be
brought into the ready queue
 Short-term scheduler (or CPU
scheduler) – selects which process should
be executed next and allocates CPU
 Medium Term Scheduling
Time sharing system

3.20
Addition of Medium Term Scheduling

3.21
Schedulers (Cont)
 Short-term scheduler is invoked very frequently (milliseconds) 
(must be fast)
 Long-term scheduler is invoked very infrequently (seconds,
minutes)  (may be slow)
 The long-term scheduler controls the degree of multiprogramming
 Processes can be described as either:
 I/O-bound process – spends more time doing I/O than
computations, many short CPU bursts
 CPU-bound process – spends more time doing computations;
few very long CPU bursts

3.22
Context Switch
 When CPU switches to another process, the system must save the state of
the old process and load the saved state for the new process via a context
switch
 Context of a process represented in the PCB
 In the Context-switch the process is stored in PCB to save the new process
 So that old process can be resumed from the same part it was left
 To make context switch time to be less , registers which are the fastest
access memory are used.

3.23
Process Creation
 Parent process create children processes, which, in turn create other
processes, forming a tree of processes
 Generally, process identified and managed via a process identifier (pid)
 Resource sharing
 Parent and children share all resources
 Children share subset of parent’s resources
 Execution
 Parent and children execute concurrently
 Parent waits until children terminate

3.24
Process Creation (Cont)
 Address space
 Child duplicate of parent
 Child has a program loaded into it
 UNIX examples
 fork system call creates new process
 exec system call used after a fork to replace the process’ memory
space with a new program

3.26
C Program Forking Separate Process
int main()
{
pid_t pid;
/* fork another process */
pid = fork();
if (pid < 0) { /* error occurred */
fprintf(stderr, "Fork Failed");
exit(-1);
}
else if (pid == 0) { /* child process */
execlp("/bin/ls", "ls", NULL);
}
else { /* parent process */
/* parent will wait for the child to complete */
wait (NULL);
printf ("Child Complete");
exit(0);
}
}

3.27
A tree of processes on a typical Solaris

3.28
Process Termination
 Process executes last statement and asks the operating system to
delete it (exit)
 Output data from child to parent (via wait)
 Process’ resources are deallocated by operating system
 Parent may terminate execution of children processes (abort)
 Child has exceeded allocated resources
 Task assigned to child is no longer required
 If parent is exiting
 Some operating system do not allow child to continue if its
parent terminates
– All children terminated - cascading termination

3.29
Inter process Communication
 It is a mechanism that allow the processes to communicate each
other and synchronize .
 Processes within a system may be independent or cooperating
 Cooperating process can affect by other executing program o
 Independent process can not be affected by other processes,
including sharing data
 It is a mechanism allow process to communicate with each other
and synchronize their action.
 Reasons for cooperating processes:
 Information sharing
 Computation speedup
 Resource sharing
 Synchronization
 Modularity
 Convenience

3.30
Inter process Communication
 Cooperating processes need inter process communication (IPC)
 Two models of IPC
 Shared memory- Process save the record in shared memory
 Message passing-- process communicate with each other with out
using the shared memory.
P1-p2: ---1st establish the communication link
--- 2nd start exchange message using basic primitives
• Send
• Receive
 Message passing will be direct or indirect communication
 Symmetric or asymmetric
 Automatic


3.32
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
modularity is the degree to which a system's components may be
separated and recombined, often with the benefit of flexibility and variety in
use

3.33
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

3.34
Bounded-Buffer – Shared-Memory Solution
 Shared data
#define BUFFER_SIZE 10
typedef struct {
. . .
} item;
item buffer[BUFFER_SIZE];
int in = 0;
int out = 0;
 Solution is correct, but can only use BUFFER_SIZE-1 elements

3.35
Bounded-Buffer – Producer
while (true) {
/* Produce an item */
int count=0;
void producer(void)
int itemp;
while (true){
produce-item(itemp);
while while (count==n);// buffer full
buffer[in]=itemp;
in=(in+1)modn;
Count=count+1;
}
}

3.36
Bounded Buffer – Consumer
int itemc;
while (true) {
while (count== 0)// Buffer empety
; // do nothing -- nothing to consume
// remove an item from the buffer
itemc = buffer[out]modn;
count=count-1;
process item(itemc);
return item;
}

3.37
Interprocess Communication – Message Passing
 Mechanism for processes to communicate and to synchronize their actions
 Message system – processes communicate with each other without
resorting to shared variables
 IPC facility provides two operations:
 send(message) – message size fixed or variable
 receive(message)
 If P and Q wish to communicate, they need to:
 establish a communication link between them
 exchange messages via send/receive
 Implementation of communication link
 physical (e.g., shared memory, hardware bus)
 logical (e.g., logical properties)

3.38
Implementation Questions
 How are links established?
 Can a link be associated with more than two processes?
 How many links can there be between every pair of communicating
processes?
 What is the capacity of a link?
 Is the size of a message that the link can accommodate fixed or variable?
 Is a link unidirectional or bi-directional?

3.39
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

3.40
Indirect Communication
 Messages are directed and received from mailboxes (also referred to as
ports)
 Each mailbox has a unique id
 Processes can communicate only if they share a mailbox
 Properties of communication link
 Link established only if processes share a common mailbox
 A link may be associated with many processes
 Each pair of processes may share several communication links
 Link may be unidirectional or bi-directional

3.41
 Operations
 create a new mailbox
 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

3.42
 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.

3.43
Synchronization
 Message passing may be either blocking or non-blocking
 Blocking is considered synchronous
 Blocking send has the sender block until the message is
received
 Blocking receive has the receiver block until a message is
available
 Non-blocking is considered asynchronous
 Non-blocking send has the sender send the message and
continue
 Non-blocking receive has the receiver receive a valid message
or null

3.44
Buffering
 Queue of messages attached to the link; implemented in one of three
ways
1. Zero capacity – 0 messages
Sender must wait for receiver (rendezvous)
2. Bounded capacity – finite length of n messages
Sender must wait if link full
3. Unbounded capacity – infinite length
Sender never waits

3.45
Examples of IPC Systems - POSIX
 POSIX Shared Memory
 Process first creates shared memory segment
segment id = shmget(IPC PRIVATE, size, S IRUSR | S
IWUSR);
 Process wanting access to that shared memory must attach to it
shared memory = (char *) shmat(id, NULL, 0);
 Now the process could write to the shared memory
sprintf(shared memory, "Writing to shared memory");
 When done a process can detach the shared memory from its address
space
shmdt(shared memory);

3.46
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()

3.47
Examples of IPC Systems – Windows XP
 Message-passing centric via local procedure call (LPC) facility
 Only works between processes on the same system
 Uses ports (like mailboxes) to establish and maintain communication
channels
 Communication works as follows:
 The client opens a handle to the subsystem’s connection port object
 The client sends a connection request
 The server creates two private communication ports and returns the
handle to one of them to the client
 The client and server use the corresponding port handle to send
messages or callbacks and to listen for replies

3.48
Local Procedure Calls in Windows XP

3.49
Communications in Client-Server Systems
 Sockets
 Remote Procedure Calls
 Remote Method Invocation (Java)

3.50
Sockets
 A socket is defined as an endpoint for communication
 Concatenation of IP address and port
 The socket 161.25.19.8:1625 refers to port 1625 on host
161.25.19.8
 Communication consists between a pair of sockets

3.52
Remote Procedure Calls
 Remote procedure call (RPC) abstracts procedure calls between processes
on networked systems
 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 peforms the procedure on the server

3.54
Remote Method Invocation
 Remote Method Invocation (RMI) is a Java mechanism similar to RPCs
 RMI allows a Java program on one machine to invoke a method on a
remote object

OSLec 4& 5(Processesinoperatingsystem).ppt

Recommended

More Related Content

Similar to OSLec 4& 5(Processesinoperatingsystem).ppt (20)

More from ssusere16bd9 (20)

Recently uploaded (20)

OSLec 4& 5(Processesinoperatingsystem).ppt