Verified Document

Resource Ownership, Namely A Process That Includes Essay

¶ … resource ownership, namely a process that includes a virtual address space to hold the process image. The process is the key to the system. Each process is constantly in one of three stages: Ready, Running, or Blocked. The operating system keeps track of its state and manages its movement amongst the various states. It is in charge of operating, managing, and terminating the various processes as well as seeing that its activities are coordinated, managing conflicting demands, and allocating system resources to the processes. A running process can also be interrupted either by an even outside the process (an "interrupt') or by execution of the operating system. The two main elements of the process are the program code and the set of data that is connected with that code. Every process also contains the following elements:

Identifier -- a unique tag that separates it from other processes

State -- i.e. running, ready or blocked

Priority level

Program counter -- the address of the next instruction in the program to be performed

Memory pointers -- pointers to the program code with related data

Context data -- data that is contained in registers in the processor whilst the process is running

I/O status information -- system requests and devices that are connected with the process

Accounting information -- for instance the amount of processor time and clock time used.

All of the information listed above is stored within the "process control block" which can handle and enable multiple processes and simultaneous multiprocessing (Stalings, 152).

Windows, in contradictions to Linux, distinguishes between processes and threads with the latter (see later) referring to program execution. Doing so may lead to improved efficiency of system and better coding.

The Windows...

Parts of this document are hidden

View Full Document
svg-one

They processes in Windows differ in several ways including:
How processes are named

Whether threads are provided within the processes.

How the processes resources are protected and how the processes are represented

The mechanisms that are used for interprocess communication and synchronizations

The Windows process structure is relatively simple. The processes are implemented as objects; each has built-in synchronization possibilities; and all contain various threads.

In Linux, on the other hand, a process, or task, is represented by a "task-struct" data structure which contains information in various categories such as the execution state of the process; the information needed by Linux to schedule the process; the unique identifier of the process; its address space; and so forth. The differences between Windows and Linux are that in Windows, processes are exclusively containers for the address space and threads run in the process. In Linux, on the other hand, processes are both containers and operate as threads.

Other differences between Linux and Windows include the following: The processes in Windows are created via discrete steps spawning threads. In Linux, they are created a different way using code to do so. The kernel objects are used and characterized differently in Linux and Windows. With Windows supporting up to 16 million handles on kernel objects whilst Linux supports up to 64 open files or sockets per process. The kernels are multi-threaded on Windows whilst Linux uses only a few kernel processes. Kernel preemption is new on Linux whilst on Windows it was embedded from the start. Finally, most Linux process services are implemented in the kernel whilst Windows uses a client / server computing system to implement its…

Sources used in this document:
The other sort of resource that can become deadlocked is consumable resource, which can be engineered and removed, such as signals or messages. Deadlock occurs if a signal (for instnace0 is obstructed so that it cannot be received. There is no single system that can remove all the different types of deadlocks that can possibly occur and the best way is prevention, in other words designing a system in such a way that none of the 4 conditions of deadlock can occur. Deadlock avoidance can also be practiced where three conditions for the deadlock situation may be allowed to exist, but the user endeavors to ascertain that a deadlock situation will not occur. Finally, detection too can be used where the user wishes to check for deadlock in order to take action to break it (Stalings, 269)

Source

Stalings, W. (2009). Operating systems: Internals and design principles, 6th ed. Prentice Hall.
Cite this Document:
Copy Bibliography Citation

Sign Up for Unlimited Study Help

Our semester plans gives you unlimited, unrestricted access to our entire library of resources —writing tools, guides, example essays, tutorials, class notes, and more.

Get Started Now