Scribd
Upload
27 views14 pages

Lecture 1.3.2 Process Structure States of Process

Process Structure States of Process

Uploaded by

360siddharth
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
27 views14 pages

Lecture 1.3.2 Process Structure States of Process

Process Structure States of Process

Uploaded by

360siddharth
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/ 14

UNIVERSITY INSTITUTE OF

COMPUTING
UNIT-1
Bachelor of Computer Applications
Operating System
(23CAT-153/22SCT-252)

INTRODUCTION TO OPERATING SYSTEM DISCOVER . LEARN . EMPOWER


COURSE OUTCOMES:

CO1 Classify the operating system categories

CO2 Identify OS as a resource manager that supports multiprogramming

CO3 Outline the concept of process and its scheduling algorithms used by the operating
system. CO2 Analyze the distributed and Network Operating Systems
and tabulate summary.
CO4 Explain how
. an operating system virtualises CPU and memory

CO5 Summarize the structure of file system


SYLLABUS (UNIT – I)

• Unit-1(Basics of Operating System)


• Generations of operating systems
• Definition, OS Architecture, Types of Operating Systems: Mainframe, Desktop, Multiprocessor, Distributed,
Clustered, Multiprogramming, Real time, Embedded and Time sharing.
• Multiprogramming
• Multitasking, Multiprogramming, Timesharing, Buffering, Spooling
• Components
• Process Management Component, Memory Management component, I/O Management component , File
Management component, Protection System, Networking management component, Command interpreter.
• Processes
• Processes: Definition, Process States, Process structure- PCB and components, Operations on Processes,
Threads.
SYLLABUS (UNIT – II)

• Cpu Scheduling
• Definition, Scheduling objectives, Types of Schedulers, Scheduling criteria, CPU utilization,
Throughput, Turnaround Time, Waiting Time, Response Time, Preemptive and Non – Preemptive,
FCFS, SJF, RR, Multiprocessor scheduling, Types, Performance evaluation of the scheduling.
• Shared Memory System
• Definition, Shared Memory System, Message passing, Critical section problem, Mutual Exclusion,
Semaphores.
• Deadlock
• Conditions, modeling, deadlock prevention, deadlock avoidance, detection and recovery, Banker’s
algorithms
SYLLABUS (UNIT – III)

• Multiprogramming
• Multiprogramming with fixed partition, variable partitions, virtual memory, paging, demand
paging, design and implementation issues in paging such as page tables, inverted page tables, page
replacement algorithms, page fault handling, working set model, local vs. global allocation, page
size, segmentation with paging.
• File system Structure
• Concept, Access Methods, File system Structure, Directory Structure, Allocation Methods, Free
Space Management, File Sharing, Protection and Recovery.
Topics to be Covered

1. Introduction of Process
2. How does Process Looks in memory? Or Process Structure
3. States of Process
4. Context Switching of Process
Introduction of Process

• A process is basically a program in execution. The execution of a


process must progress in a sequential fashion.
• To put it in simple terms, we write our computer programs in a text
file and when we execute this program, it becomes a process which
performs all the tasks mentioned in the program.
• When a program is loaded into the memory and it becomes a process,
it can be divided into four sections ─ stack, heap, text and data. The
following image shows a simplified layout of a process inside main
memory −
Process Structure

8
Explanation of Process Structure Diagram

• Stack: The process stack stores temporary information such as method


or function arguments, the return address, and local variables.
• Heap: This is the memory where a process is dynamically allotted
while it is running.
• Text: This consists of the information stored in the processor's
registers as well as the most recent activity indicated by the program
counter's value.
• Data: In this section, both global and static variables are discussed.

9
States of Process or Process Life Cycle

• A process is in one of the following states:


• New: Newly Created Process (or) being-created process.
• Ready: After the creation process moves to the Ready state, i.e. the
process is ready for execution.
• Run: Currently running process in CPU (only one process at a time
can be under execution in a single processor)
• Wait (or Block): When a process requests I/O access.
• Complete (or Terminated): The process completed its execution.
• Suspended Ready: When the ready queue becomes full, some
processes are moved to a suspended ready state
• Suspended Block: When the waiting queue becomes full.
10
States of Process

11
Context Switching of Process

• The process of saving the context of one process and loading the
context of another process is known as Context Switching.
• In simple terms, it is like loading and unloading the process from the
running state to the ready state.

12
When Does Context Switching Happen?

1. When a high-priority process comes to a ready state (i.e. with higher


priority than the running process).
2. An Interrupt occurs.
3. User and kernel-mode switch (It is not necessary though)
4. Preemptive CPU Scheduling is used.

13
THANK YOU

You might also like