Scribd
Upload
10 views

Ch3 Processes

Uploaded by

cawilyare9885
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
10 views

Ch3 Processes

Uploaded by

cawilyare9885
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 20

Chapter 3: Processes

 Process Concept
 Process Scheduling
 Operations on Processes
 Cooperating Processes
 Interprocess Communication

Operating System Concepts 4.1 Silberschatz, Galvin and Gagne 2002


Process Concept

 An operating system executes a variety of


programs:
 Batch system – jobs
 Time-shared systems – user programs or tasks
 Textbook uses the terms job and process
almost interchangeably.
 Process – a program in execution; process
execution must progress in sequential fashion.
 A process includes:
 program counter
 stack
 data section

Operating System Concepts 4.2 Silberschatz, Galvin and Gagne 2002


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
process.
 terminated: The process has finished execution.

Operating System Concepts 4.3 Silberschatz, Galvin and Gagne 2002


Diagram of Process State

Operating System Concepts 4.4 Silberschatz, Galvin and Gagne 2002


Process Control Block (PCB)

Information associated with each process.

 Pointer
 Process state
 Program counter
 CPU registers
 Memory-management information

Operating System Concepts 4.5 Silberschatz, Galvin and Gagne 2002


Process Control Block (PCB)

Operating System Concepts 4.6 Silberschatz, Galvin and Gagne 2002


CPU Switch From Process to
Process

Operating System Concepts 4.7 Silberschatz, Galvin and Gagne 2002


Process Scheduling Queues

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

Operating System Concepts 4.8 Silberschatz, Galvin and Gagne 2002


Representation of Process
Scheduling

Operating System Concepts 4.9 Silberschatz, Galvin and Gagne 2002


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.

Operating System Concepts 4.10 Silberschatz, Galvin and Gagne 2002


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.

Operating System Concepts 4.11 Silberschatz, Galvin and Gagne 2002


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.
 Context-switch time is overhead; the system
does no useful work while switching.
 Time dependent on hardware support.

Operating System Concepts 4.12 Silberschatz, Galvin and Gagne 2002


Process Creation

 Parent process create children processes,


which, in turn create other processes, forming
a tree of processes.
 Resource sharing
 Parent and children share all resources.
 Children share subset of parent’s resources.
 Parent and child share no resources.
 Execution
 Parent and children execute concurrently.
 Parent waits until children terminate.

Operating System Concepts 4.13 Silberschatz, Galvin and Gagne 2002


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.

Operating System Concepts 4.14 Silberschatz, Galvin and Gagne 2002


Processes Tree on a UNIX
System

Operating System Concepts 4.15 Silberschatz, Galvin and Gagne 2002


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 4.16 Silberschatz, Galvin and Gagne 2002


Interprocess Communication
(IPC)
 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)

Operating System Concepts 4.17 Silberschatz, Galvin and Gagne 2002


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?

Operating System Concepts 4.18 Silberschatz, Galvin and Gagne 2002


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 4.19 Silberschatz, Galvin and Gagne 2002


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.

Operating System Concepts 4.20 Silberschatz, Galvin and Gagne 2002

You might also like