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?

Explain swapping, Explain Swapping Swapping is a method of temporarily ...

Explain Swapping Swapping is a method of temporarily removing inactive programs from the memory of computer system.

Explain peterson''s solution for the critical section problem, Explain the ...

Explain the Peterson's solution for the critical section problem? In Peterson's solution two variables a) flag and b) turn are used as shared variables. If the both shared vari

Create a gantt chart for scheduling algorithms, Question: (a) The follo...

Question: (a) The following table (table 1.0) gives the length of the CPU burst time in milliseconds of processes P 1 to P 4 . Assume the processes arrived in the order P 1 ,

Benefits of dynamic linkage of libraries, Q. What are three benefits of dyn...

Q. What are three benefits of dynamic (shared) linkage of libraries compared to static linkage? What are two situations where static linkage is preferable? Answer: The

What are the various available scheme in ipc, Several schemes available are...

Several schemes available are as follows: Pipes : One-way communication process through which different process can interact. The problem is that the two processes could have

Explain about file allocation methods, Explain about file allocation method...

Explain about file allocation methods? The main problem in direct-access nature is how to assign space to these files so that disk space if utilized effectively and files can b

Explain concept of buffering, Buffering Messages exchanged by communica...

Buffering Messages exchanged by communication processes reside in a impermanent queue. Such a queue can be executed in three ways. Zero capacity: The queue length is 0.

Comparing gc to malloc, Garbage collectors trade space for time. If we coll...

Garbage collectors trade space for time. If we collect all the time (which requires a lot of processing time), the GC allocator will use the least memory possible. On the other han

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