Skip to main content

Suspend a process

 

Suspend a process


A process is an active program. It can also be said as a program that is under execution. It is more than the program code as it includes the program counter, process stack, registers, program code etc. Compared to this, the program code is only the text section.

A process passes through different states as it executes. These states may be different in different operating systems. However, the common process states are explained below with the help of a diagram −

OS States

New

This is the state when the process has just been created. It is the initial state in the process life cycle.

Ready

In the ready state, the process is waiting to be assigned the processor by the short term scheduler, so it can run. This state is immediately after the new state for the process.

Ready Suspended

The processes in ready suspended state are in secondary memory. They were initially in the ready state in main memory but lack of memory forced them to be suspended and gets placed in the secondary memory.

Running

The process is said to be in running state when the process instructions are being executed by the processor. This is done once the process is assigned to the processor using the short-term scheduler.

Blocked

The process is in blocked state if it is waiting for some event to occur. This event may be I/O as the I/O events are executed in the main memory and don't require the processor. After the event is complete, the process again goes to ready state.

Blocked Suspended

This is similar to ready suspended. The processes in blocked suspended state are in secondary memory. They were initially in the blocked state in main memory waiting for some event but lack of memory forced them to be suspended and gets placed in the secondary memory. A process may go from blocked suspended to ready suspended if its work is done.

Terminated

The process is terminated once it finishes its execution. In the terminated state, the process is removed from main memory and its process control block is also deleted.



Reasons For Process Suspension

Swapping

The OS needs to release sufficient main memory to bring in a  process that is ready to execute.

Other OS reason

The OS may suspend a backgrounds or utility process or  a process that is suspected of causing a problem

 

Interactive user request

A user may wish to suspend the execution of a program for purpose of debugging or in connection with the use of a resource.

Timing

A process may be executed periodically and may be suspended while waiting for the next time interval

Parent process request

A parent process may wish to suspend the execution of a  descendant to examine or modify the suspended process or to coordinate the activity of descendants

 

 

 

 

 

 

 

 

 

 

Resuming A Process

·         Resuming a process means restarting it from the point at which it was suspended.

·         A suspended process needs another process for its restoration as it cannot resume itself.

·         The resume service is also called wakeup in some system

·         Whenever a process resumes any suspended process the OS inserts the target process PCB in the ready list and update its state from suspended to ready .

 

 

 

Changing The Priority Of A Process

·         The priority of a process can be  changed in run time

·         The process priority may be changed so as to increase or decrease the process ability to compete for system resources

 


Comments

Post a Comment

Popular posts from this blog

Multi user Operating System

  Multi user operating system ·           In a multi-user operating system, multiple number of user can access different resources of a computer at a same time. ·           The access is provided using a network that consists of various personal computer attached to a mainframe computer system.                                                              diagram of multi -user operating system       ·           The various personal computer can send and receive information to mainframe computer system. ·           The example    of multi-user OS are UNIX, windows 2000,novell netware.            sing...
Post a Comment
Read more

Exokernel architecture

Exokernel architecture Most of us know what kernels are and how do they work to make programmers’ lives easier. But, how many of us know what exokernels are? I hope you will be able to get a brief introduction on this terminology through this blog. Let’s start with a brief introduction on kernel. What is a kernel? A kernel is the foundational layer of an operating system that functions at a basic level, communicating with hardware and managing resources, such as CPU and the memory. It works as an interface between the user application and the hardware. There   are two main types of kernel 1. Micro kernel 2. Monolithic Kernel 1.  Monolithic architecture 2.      Layerd archtecture . 3.       Virtual machine architecture 4.       Exokernel architecture 5.      Client server architecture   6.       Micro kernel architecture Now let’s head into our main focus. What is an Exokern...
Post a Comment
Read more

Shortest Job First Scheduling (SJF)

  Shortest Job First Scheduling (SJF) ·          SJF ia also known as shortest-job-next(SJN) algorithm and is faster than FCFS. ·          In SJF, the process with the least estimated execution time is selected from the ready queue for   execution. ·          For this, SJF algorithm associates with each process, the length of its next CPU burst. When the CPU is available, it is assigned to the process that has the smallest next CPU burst. ·          If tow processes have the same length of next CPU burst ,FCFS scheduling algorithm is used to break the tie. ·          SJF algorithm can be preemptive or non-preemptive.     Non-preeptive SJF ·          In non-preemptive SJF, scheduling, CPU is always assigned to the ...
Post a Comment
Read more

Scheduling Algorithms

     Scheduling Algorithms CPU scheduling algorithm deal with the problem of deciding which of the processes in the ready queue is to be allocated the CPU . six commonly used scheduling algorithms are: 1. first-come First-served(FCFS) 2. Shortest job First(SJF) 3. Priority scheduling 4. Round-Robin Scheduling(RR) 5. Multi-Level Queue Scheduling(MLQ) 6. Multi-Level Feedback Queue Scheduling (MFQ)       First-Come First-Served Scheduling (FCFS) ·       It is simplest and the most straight forward of all scheduling algorithms. ·       In this scheduling, the process that request the CPU first is allocated CPU first. Thus   the name first come first served. ·       We can say that in FCFS scheduling, a process is allocated CPU time according to the arrival time of a process. ·       The implementation of FCFS policy is easily manged with a FIFO queue...
Post a Comment
Read more

Multi Level Queue Scheduling (MLQ)

  Multi Level Queue Scheduling (MLQ) ·          Multilevel queue scheduling classifies the processes according to their types for example, a multilevel queue scheduling algorithm makes a common. ·          In this scheduling ready queue is divided into various queue that are called sub queues. A subqueue is a distinct operational queue ·          The process are permanently assigned to subqueues, generally based on some property of the process such as memory size,priority or process type ·          Each subqueue has its process sucheduling algorithm. For example interactive process at the foreground may use round robin scheduling while batch jobs at the background may use the FCFS method ·          For example, consider a system with four different queues 1.   ...
Post a Comment
Read more