Scribd
Upload
20 views18 pages

Chapter 3 Lecture 6 30092024 012452pm

Uploaded by

haiderjaleel349
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
20 views18 pages

Chapter 3 Lecture 6 30092024 012452pm

Uploaded by

haiderjaleel349
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Chapter 3: Processes

Week 3
Lecture 5

Operating System Concepts 10th edition - Silberchatz, Galvin, & Gagne 1


Chapter 3: Processes
 Process Concept
 Process Scheduling
 Operations on Processes
 Inter-process Communication
 Examples of IPC Systems
 Communication in Client-Server Systems

Operating System Concepts 10th edition - Silberchatz, Galvin, & Gagne 2


Objectives

 To introduce the notion of a process -- a program in


execution, which forms the basis of all computation
 To describe the various features of processes,
including scheduling, creation and termination, and
communication
 To explore inter-process communication using shared
memory and message passing
 To describe communication in client-server systems

Operating System Concepts 10th edition - Silberchatz, Galvin, & Gagne 3


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
 Multiple parts
 The program code, also called text section
 Current activity including program counter, processor
registers
 Stack containing temporary data
 Function parameters, return addresses, local variables
 Data section containing global variables 4

 Heap containing memory dynamically allocated during run


time
Process Concept (Cont.)
 Program is passive entity stored on disk (executable
file), process is active
 Program becomes process when executable file loaded into
memory
 Execution of program started via GUI mouse clicks,
command line entry of its name, etc
 One program can be several processes
 Consider multiple users executing the same program

5
Process in Memory

6
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

7
Diagram of Process State

8
Process Control Block (PCB)
Information associated with each process
(also called task control block)
 Process state – running, waiting, etc
 Program counter – location of
instruction to next execute
 CPU registers – contents of all process-
centric registers
 CPU scheduling information- priorities,
scheduling queue pointers
 Memory-management information –
memory allocated to the process
 Accounting information – CPU used,
clock time elapsed since start, time
limits
 I/O status information – I/O devices
allocated to process, list of open files
9
CPU Switch From Process to Process

10
Threads

 So far, process has a single thread of execution


 Consider having multiple program counters per process
 Multiple locations can execute at once
 Multiple threads of control -> threads
 Must then have storage for thread details, multiple
program counters in PCB
 See next chapter

11
Process Scheduling
 Maximize CPU use, quickly switch processes onto CPU
for time sharing
 Process scheduler selects among available processes
for next execution on CPU
 Maintains scheduling queues of processes
 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

12
Ready Queue And Various I/O Device Queues

13
Representation of Process Scheduling
 Queueing diagram represents queues, resources, flows

14
Schedulers
 Short-term scheduler (or CPU scheduler) – selects which process
should be executed next and allocates CPU
 Sometimes the only scheduler in a system
 Short-term scheduler is invoked frequently (milliseconds)  (must
be fast)
 Long-term scheduler (or job scheduler) – selects which
processes should be brought into the ready queue
 Long-term scheduler is invoked 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
 Long-term scheduler strives for good process mix 15
Addition of Medium Term Scheduling
► Medium-term scheduler can be added if degree of multiple
programming needs to decrease
► Remove process from memory, store on disk, bring back in
from disk to continue execution: swapping

16
Multitasking in Mobile Systems

 Some mobile systems (e.g., early version of iOS) allow


only one process to run, others suspended
 Due to screen real estate, user interface limits iOS
provides for a
 Single foreground process- controlled via user interface
 Multiple background processes– in memory, running, but not
on the display, and with limits
 Limits include single, short task, receiving notification of
events, specific long-running tasks like audio playback
 Android runs foreground and background, with fewer limits
 Background process uses a service to perform tasks
 Service can keep running even if background process is
suspended
 Service has no user interface, small memory use 17
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
 Context-switch time is overhead; the system does no
useful work while switching
 The more complex the OS and the PCB  the longer the
context switch
 Time dependent on hardware support
 Some hardware provides multiple sets of registers per CPU
 multiple contexts loaded at once

18

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy