What is an operating system process, Operating System

Assignment Help:
What is an operating system process? How is it different from a program? Why do we need the concept of a process, rather than simply talk about programs running in memory?

The execution environment in which the class instances and the instances of subsystems run and reside and its unique address space is combined known as Operating system process. The execution environment may be divided into one or more threads of control.

Difference between program & operating system process

 The process may be called the active state of a program. It also gives the status of given task mentioned in that particular program, it provides the information to main memory about the task's state and other details, for example the position it has executed up-to that instance. It keeps track of the status of registers and instances of the resources it hold and required resources, what cost it incurs on the CPU after it is done with its work.

Program is an active entity, it can be seen as the overall information on what has to be done with CPU and other resources which are likely to be needed or liable to complete that given task. In some cases it simply is a combination of Lighten weight processes (known as threads) and thick weight processes as we may require running various modules of different programs in some single program. Thus the process is similar to a platform on CPU for executing various tasks of given program and part of the main set of process. 

Why do we need the concept of a process? 

Processes are inert. We know that process is basically the active state of a program which is the set of instruction destined to execute some specific job. Prior to execution, the instructions must be converted to binary code form in order to be understood by loader OS. It is stored in Portable Executable (PE) Format on Secondary Memory Like hard disk. in windows this is generally the file with .exe extension.

A process consists of a kernel object which keeps statistical information about the process and an address space containing the entire executable or DLL module's code, data and dynamic memory allocations such as thread stacks and heap allocations.

The code contained in the process's address space is run by a thread of the process

One process may contain n number of threads, and all of them execute the code simultaneously in the address space of the process. Each thread has its own set of stack and CPU registers.

If no threads were executing the code in the process's address space the system would automatically destroy the process and its address space.


Related Discussions:- What is an operating system process

Explain how indefinite blocking or starvation occur, explain how indefinit...

explain how indefinite blocking or starvation occurs..

Synchronization, What is the different between basic synchronization and hi...

What is the different between basic synchronization and high level synchronization

Explain the proper distribution of functionality and code, Explain the Prop...

Explain the Proper Distribution of Functionality and Code It is important to note that the bandwidth of the server operating system and server processor availability is fixed.

Explain segmentation hardware?, Explain segmentation hardware? We defin...

Explain segmentation hardware? We define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means

Define secondary memory, Define secondary memory. This memory holds tho...

Define secondary memory. This memory holds those pages that are not there in main memory. The secondary memory is usually a high speed disk. It is called as the swap device, an

What is meant by file management systems?, What is meant by file management...

What is meant by file management systems? File Management systems are as well referred to as simply a file system .File system is the system that an OS operating system or prog

Explain enhanced second-chance algorithm, Enhanced second-chance algorithm....

Enhanced second-chance algorithm. When we increase the second-chance algorithm by considering both the reference bit and the modify bit as an order pair. We have the following

Packets and time division multiplexing (tdm), Broken data into small packet...

Broken data into small packets allow time division multiplexing. In TDM every packet leaves the sender and is switched on the shared interaction channel through a multiplexer. At t

Describe demand-paged environment, Q. Which of the subsequent programming ...

Q. Which of the subsequent programming techniques and structures are good for a demand-paged environment? Which aren't good? Describe your answers. a. Stack b. Hashed symbol

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