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

Explain about directory structure, Normal 0 false false fal...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Beladys anomaly algorithm, Q.  You have devised a fresh page-replacement a...

Q.  You have devised a fresh page-replacement algorithm that you think may be optimal. In a few contorted test cases Belady's anomaly occurs. Is the fresh algorithm optimal? Descr

Explain partitions and mounting, Partitions and mounting A disk can be ...

Partitions and mounting A disk can be sliced into many partitions, or a partition can span multiple disks. Every partition can be either "raw", having no file system, or "cooke

Semispace, Semispace works by maintaining two disjoint areas from which mem...

Semispace works by maintaining two disjoint areas from which memory can be allocated. These areas are called the from-space and the to-space. At ?rst, the algorithm allocates memor

Explain the various methods for handling deadlocks, Explain the various met...

Explain the various methods for handling deadlocks.      A set of processes is deadlocked if every process in the set is waiting for an event that only a process in the

Explain about spooling, Q. Explain about Spooling? Acronym for simu...

Q. Explain about Spooling? Acronym for simultaneous peripheral operations on line. Spooling denotes to putting jobs in a buffer, a special area in memory or on a disk where

Basic synchronization, (Add synchronization to your solutions to HW 3 to el...

(Add synchronization to your solutions to HW 3 to eliminate all of the race conditions.  You should not remove any of the sleep() commands that you used to produce the race conditi

Explain indexed allocation, Indexed allocation Indexed allocation bring...

Indexed allocation Indexed allocation bringing all the pointers together into one location: the index block. Every file has its own index block, which is an array of disk-block

What is a file path name, What is a file path name? A list of the subdi...

What is a file path name? A list of the subdirectories, directories, and files we must traverse to reach a file from the root directory.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd