What is a process control block?, Operating System

Assignment Help:

What is a Process Control Block?

Every process in the operating system is represented by a process control block as well called a task control block. It contains several pieces of information associated with a specific process such as

  • Process state: The state perhaps new, ready, running, and waiting, halted and etc.
  • Program counter: The counter point to the address of the next instruction to be executed for this process.
  • CPU registers: The registers differ in number and type, depending on the computer architecture. They comprise index registers, accumulators, stack pointers and general purpose registers plus any condition code information. Along with PC, this state information has to be saved when an interrupt occurs, to permit the process to be continued correctly afterward.
  • CPU scheduling information: This information comprises a pointer to scheduling queues, process priority and any other scheduling parameters.
  • Memory management information: this information may comprise such information as the value of the base and limit registers the page tables or the segment tables depending on the memory system used by the OS.
  • Accounting information: It comprise information about the amount of CPU and time limits, account numbers, real time used, job or process numbers and so on.
  • I/O status information: The information comprises the list of I/O devices allocated to this process, a list of open files and so on.

 


Related Discussions:- What is a process control block?

Pages into physical memory, For reading, most operating systems use demand ...

For reading, most operating systems use demand paging. This means that pages are only read from the disk into physical memory when they are needed. In the page table, there is a re

Prevention of a data race in a parallelised program, Present your own fully...

Present your own fully documented and tested programming example illustrating the prevention of a data race in a parallelised program. This is an example where total number of p

Explain disk scheduling algorithms-scan, SCAN o Go from the outside to...

SCAN o Go from the outside to the inside servicing requests and after that back from the outside to the inside servicing requests. o Replicate this over and over. o Diminish

Memory hierarchy, Difference between cache and associate memory

Difference between cache and associate memory

Deadlocks, At the end of this lecture, and into the next lecture, we will d...

At the end of this lecture, and into the next lecture, we will discuss the last major type of logical error that can occurwhen programming with threads. A deadlock occurswhen two t

Medium term scheduler, Medium term scheduling is form of the swapping ope...

Medium term scheduling is form of the swapping operation. This attaches to processes that are in a suspended or blocked state. They are swapped out of real-memory storage until t

Describe the buddy system of memory allocation, Buddy system of memory allo...

Buddy system of memory allocation Free memory is used to maintain in linked lists, each of similar sized blocks. Every block is of size 2^k. When some memory is needed by a th

How does communication takes place in a distributed system?, How does commu...

How does communication takes place in a distributed system? Distributed systems depend on the networking for their functionality. A network is a communication path among two

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