Skip to the content.

Process Data Structures and Satte Transictions

Process Management

A process is basically a program in execution. The execution of a process must progress in a sequential fashion.

A Program/Process here Refers any code

// Example code
#include<iostream>
int main(){
  int a,b;
  cin>>a>>b;
  cout<<a+b<<endl;
}

Memory of every process is broadly devided into 4 types

  1. Stack : Where all temporary data such as method/function parameters, return address and local variables etc will be present.
  2. Heap : temporary data such as method/function parameters, return address and local variables.
  3. Text : Other core data like program counter and data of registers involved
  4. Data: Globl and static variables

Process table

The process table is a data structure maintained by the operating system to facilitate context switching and scheduling, and other activities

Ex: The IO event Wait and copmletion are two transitions

some people may also represent transitions like this picture 5

Context of Process Levels

User Level

kernel Level

Process Level