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

What are the differences between process and thread, What are the differenc...

What are the differences between process and thread? The fundamental difference between a process and a thread is that a process has an entire copy of the program to itself and

Explain the thread local storage (tls), Explain the Thread Local Storage (T...

Explain the Thread Local Storage (TLS) Windows NT provides unique functions for per-thread data management. Thread local storage (TLS) is a concept defined in NT so develope

Determine what a locality of reference entails, Locality of reference entai...

Locality of reference entails that the page reference being made by a process Locality of reference entails that the page reference being made by a process is similarly to be

Programable clock modes in computer systems, Ask question #Minimuexplain th...

Ask question #Minimuexplain the programable clock modes in a computer system m 100 words accepted#

Pthreads, A thread is defined as an independent stream of instructions that...

A thread is defined as an independent stream of instructions that can be scheduled to run as such by the operating system. Each program contains a number of threads which can be ru

Tlb replacement algorithm, Suppose a logical address space is 1KB, and the ...

Suppose a logical address space is 1KB, and the page-size is 16 bytes. Assume no page is in the main memory for this process initially and the pure demand paging is used. Current f

Define thread cancellation and target thread, Define thread cancellation & ...

Define thread cancellation & target thread. The thread cancellation is the task of terminating a thread before it has completed. A thread that is to be cancelled is often refer

Mutual exclusion, With software algorithms for mutual exclusion, such as De...

With software algorithms for mutual exclusion, such as Dekker's algorithm, Peterson's algorithm, or Lamport's bakery algorithm, note that optimizing compilers and out-of-order exec

Binary and data representation, Computing uses three number bases:- Binary ...

Computing uses three number bases:- Binary (base 2), Octal (base 8) and Hexadecimal (base 16). Binary has been described before, although various catchphrases are used to describe

What is co-operating scheduling?, What is co-operating scheduling? CPU ...

What is co-operating scheduling? CPU scheduling decisions may possibly place under the following four circumstances: 1. When process switches from the running state to

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages