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

Explain the working of static ram - computer memory, Explain the working of...

Explain the working of Static RAM - Computer Memory? SRAM devices tender extremely fast access times (approximately four times faster than DRAM) but are much more expensive to

Diiferentiate between ROM and PROM, Diiference between ROM and PROM. R...

Diiference between ROM and PROM. ROM: It also called Read Only Memory is a Permanent Memory. The data is permanently stored and cannot be changed in Permanent ROM. This can o

What is external interrupt, External Interrupt: Interrupt signal came ...

External Interrupt: Interrupt signal came from input-output devices connected external to processor. These interrupts depend on external conditions that are independent of the

What do you mean by parallel virtual machine, Q.What do you mean by Paralle...

Q.What do you mean by Parallel virtual machine? PVM is essentially a simulation of a computer machine running parallel programs. It is a software package which allows a heterog

Differentiate b/w wml-script & web-based scripting language, Differentiate ...

Differentiate between WML-Script and Web-based scripting languages. WML Script is a lightweight procedural scripting language, optimized for small-memory, low-power CPU wireles

Combinatorial and scheduling problems, Combinatorial and Scheduling Proble...

Combinatorial and Scheduling Problems: One class of problems is concerned with specifying optimal scheduled. A classical example is the Travelling Salesperson Problem where

Canonical genetic algorithm - artificial intelligence, Canonical Genetic Al...

Canonical Genetic Algorithm: In such a scenario with all search techniques there one of the first questions to ask along with GAs is how to define a search space that is actua

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