Explain process states in the unix system, Operating System

Assignment Help:

Process States

A total of nine states are acknowledged by the UNIX system. They are like as follow:

User running Executing in user mode

Kernel running Executing in kernel mode

Ready to run, in memory Ready to run the instant the kernel schedules it.

Asleep in memory Unable to execute until an event take place; process is within the main memory

Ready to run, swapped Process is set to run, but the swapper should swap the process into the main memory before the kernel is able to schedule to execute.

Sleeping, swapped The process is stay an event and has been swapped to secondary storage

Preempted Process is recurring from kernel to user mode, other than the kernel preempts it and does a process switch to schedule another process

Created Process is recently created and not yet ready to run

Zombie Process no longer be present, other than it leaves a record for its parent process to collect

Related Discussions:- Explain process states in the unix system

Define implementation of segmentation with an example, IMPLEMENTATION OF SE...

IMPLEMENTATION OF SEGMENTATION WITH AN EXAMPLE Segmentation is a memory-management scheme that represents the user view of memory. A logical address space is the collection of

Principles of operating systems, Objective - Tiny Shell (tish) In this...

Objective - Tiny Shell (tish) In this exercise you will write a small shell program to run different programs in foreground and background mode. Background Usually when

Why global variables are unacceptable, Why Global variables are unacceptabl...

Why Global variables are unacceptable Global variable, for instance, are unacceptable because they break the rules of self - containment. If all procedural components are runni

Performance of job scheduling strategies, Performance of Job Scheduling St...

Performance of Job Scheduling Strategies In this project you will investigate the performance of Job Scheduling strategies, Memory Allocation strategies and a CPU Scheduling s

Explian reference string, What is reference string We evaluate an algor...

What is reference string We evaluate an algorithm by running it on a definite string of memory reference and computing the number of page faults. The string of memory reference

Explain the features that bash shell provides, LINUX OPERATING SYSTEM 1...

LINUX OPERATING SYSTEM 1. Write a brief explanation about the Linux distribution. 2. Explain the features that Bash shell provides? 3. Who is responsible for managing use

CPU, TURNAROUND TIME

TURNAROUND TIME

Explain the circumstances under which os use mutexes, Q. Give the reasons ...

Q. Give the reasons why Windows XP, Solaris and Linux implement multiple locking mechanisms. Explain the circumstances under which they use mutexes, spinlocks, semaphores, adaptiv

Explain fifo page replacement, Explain FIFO page replacement A FIFO rep...

Explain FIFO page replacement A FIFO replacement algorithm associates with every page the time when that page was brought into memory. When a page must be changed, the oldest p

Explain multilevel feedback queue in detail, Explain multilevel feedback qu...

Explain multilevel feedback queue in detail A process can move among the various queues; aging can be executed this way Multilevel-feedback-queue scheduler explained b

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages