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

Compute physical address of data byte, Q. Compute Physical address of data ...

Q. Compute Physical address of data byte? Offset of data byte = 0020h Value of data segment register (DS) = 3000h Physical address of data byte   This computation

Illustrate 16-bit isa, Illustrate 16-bit ISA?  Compare it with 8-bit ISA bu...

Illustrate 16-bit ISA?  Compare it with 8-bit ISA bus.  The only difference between 8 and 16-bit ISA bus is that an extra connector is attached behind the 8-bit connector. 16-b

Mini project, give proper code for any kind of project in oop c++

give proper code for any kind of project in oop c++

Basic elements of assembly language, Basic elements of  Assembly language:...

Basic elements of  Assembly language: Any Assembly language which consists 3 types of instruction statements that are used to define the program operations: Data secti

Define about exe programs, Q. Define about EXE Programs? An EXE program...

Q. Define about EXE Programs? An EXE program is stored on disk with extension .exe. EXE programs are longer than COM programs as every EXE program is related with an EXE header

Minimum degree of t=1 for a b-tree, Why don't we permit a minimum degree of...

Why don't we permit a minimum degree of t=1 for a B-tree? According to the definition of B-Tree, a B-Tree of order n means that every node in the tree has a maximum of n-1 keys

What is segment directive, Q. What is SEGMENT Directive? Segment direct...

Q. What is SEGMENT Directive? Segment directive defines logical segment to which following instructions or data allocations statement belong.  It also provides a segment name t

Organisational inertia - obstacle to information system, Organisational Ine...

Organisational Inertia - Obstacle To Information System This is most easily understood as problems of change and culture. Like any change process technology led change will be

Performance and issues in pipelining-throughput, Performance and Issues in ...

Performance and Issues in Pipelining Throughput:  Throughput of a pipeline can be defined as the number of results that have been getting per unit time. It can be denoted as:

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