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

Properties of e-cash, Properties: 1.  Monetary Value: Monetary value mu...

Properties: 1.  Monetary Value: Monetary value must be backed by either cash, bank - authorized credit cards or bank certified cashier's cheque. 2.  Interoperability: E-cash

Illustrate the uses of assembly language, Q. Illustrate the Uses of Assembl...

Q. Illustrate the Uses of Assembly Language? Uses of Assembly Language Assembly language is used mainly for writing short, efficient, specific interfacing modules/ subrou

#title.sequential circuit, design modulo 12 up synchronous counter using t ...

design modulo 12 up synchronous counter using t flip flop

Functionality of hyper thread processor, Hyper-threading works by duplicati...

Hyper-threading works by duplicating those sections of processor that kept the architectural state-but not duplicates the main implementation resources. This allows a Hyper-threadi

Machine centred versus human centred, Machine Centred versus human Centred ...

Machine Centred versus human Centred The discussion here is based on the difference in approach to the design of the work system when we prioritise either the needs of the mac

Find simplified function f and implement, Q. Find simplified function F and...

Q. Find simplified function F and implement that function using only NAND gates. 1. F(A,B,C) = (A+B) (A'+B+C') (A'+B'+C') 2. F (A,B,C) = A'B'C'+B'CD'+A'BCD'+AB'C' 3. F(X,Y

Move the layout table, You can select and move a layout table to other area...

You can select and move a layout table to other areas in a particular document. You can't, though, move a layout table so that it overlaps another. Next you will move the table

Give a simple example of dynamic modelling, Give a simple example of dynami...

Give a simple example of dynamic modelling using these notation A simple example using these notation is shown below in Figure:

Explain about distributed shared memory systems, Explain about Distributed ...

Explain about Distributed Shared Memory Systems? Distributed Shared Memory (DSM) systems emulate a shared memory abstraction on loosely coupled architectures in order to allow

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