Data structure, Computer Engineering

Assignment Help:

Process:

pid

start time

end time

priority

timeslice

list of CPU bursts

list of IO bursts (the number of IO burst will always be 1 less than the number of CPU bursts)

Start up Queue:

 holds the processes which have not started executing (start time > clock)

(recommendation: order by start time)

Active/Expired Queue:

holds the processes that are waiting to use the cpu

(recommendation: order by priority)

IO Queue:

holds processes that are currently waiting for IO burst to finish.

(recommendation: order by current io burst left)

Finished Queue:

holds the processes that have completed all its cpu bursts

(recommendation: order by finish time)

CPU:

holds the process that is currently executing in the cpu.


Related Discussions:- Data structure

Convert the binary number to gray code, Convert the binary number 10110 to ...

Convert the binary number 10110 to Gray code ? Ans. For changing binary number 10110 in its equivalent Gray code the rules are as, the left most bit that is MSB in Gray code is 1

Explian two limitations of dead-box analysis, (a) Explian two limitations o...

(a) Explian two limitations of dead-box analysis. (b) Describe why memory analysis is difficult. (c) With reference to the "Shadow Walker" rootkit, explain what is meant by

Arrays, how to calculate students''s averange test scores

how to calculate students''s averange test scores

Explain the concepts and definitions of e-commerce, The Internet has emerge...

The Internet has emerged as a major worldwide distribution channel for goods, managerial, services, and professional jobs. It has impacted market economics and industry structure,

Backward chaining - artificial intelligence, Backward Chaining - Artificial...

Backward Chaining - Artificial intelligence Given that we are just interested in constructing the path, we may set our initial state to be the theorem statement and search backw

Explain chaining method, Chaining: In this method, instead of hashing func...

Chaining: In this method, instead of hashing function value as location we use it as an index into an array of pointers. Every pointer access a chain that holds the element having

What are priority queues, What are priority Queues? There are many queu...

What are priority Queues? There are many queues in which we can insert items or delete items from any of the position based on some property. Now, those queues based on the pro

What is computer, WHAT IS COMPUTER? Computer is termed in the Oxford di...

WHAT IS COMPUTER? Computer is termed in the Oxford dictionary as "An automatic electronic apparatus for making controlling operations or calculations    which are expressible i

What is meant by Wired-AND connection of digital ICs, What is meant by Wire...

What is meant by Wired-AND connection of digital ICs?                                                                                                               Ans: Wir

What are different adder circuits you studied, Half Adder (for addition of ...

Half Adder (for addition of two bits) Full Adder (for addition of three bits) Carry look ahead adder Carry save adder Carry propagate adder

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