Example for while until, Database Management System

Assignment Help:

Assume you are given a uniprocessor system with one gigabyte of memory and a 300 gigabyte disk. The OS on the machine has a demand paged virtual memory system with a local page replacement policy and a multi-level feedback queue (MLFQ) CPU scheduler. On the system there are two compute-intensive jobs running: Job-A and Job-B. Job-A has a working set of 50 gigabytes while Job-B has a working set of 100 megabytes. Assume you left the system to run for a while until it reached a steady state with both jobs running.

a. Which job would you expect to have a higher CPU scheduling priority from the MLFQ scheduler?

b. Assume you add a second CPU to system, how would this affect the priorities of the jobs?

c. Assume you switch from a local to a global page replacement policy, how does this change affect the priorities of the jobs?

Justify your answer and state any assumptions you make.

 


Related Discussions:- Example for while until

Describe the relational model, a) Distinguish between ‘database' and ‘Data...

a) Distinguish between ‘database' and ‘Database Management Systems (DBMS)'. b) List and briefly describe five potential benefits of the database approach compared to conventio

Design and building a distributed information system, The scenario You ...

The scenario You have been approached to design and implement a prototype of a distributed information system for a national car part retail outlet chain. The company comprises

OLD HOME POLICIES, Write an sql statement to find what is the percentage of...

Write an sql statement to find what is the percentage of home policies which are from the state of Arizona out of all Home policies by Policy Value.

Explain optimistic locking and pessimistic locking, Explain the difference ...

Explain the difference between optimistic locking and pessimistic locking. Optimistic locking supposes no transaction conflict will occur and deals with the consequences if it

Two phase locking technique, growing phase and shrinking phase are disjoint...

growing phase and shrinking phase are disjoint, why ?

Er database theoretical and modeling database system, Need an expert in ER ...

Need an expert in ER database theoretical and modeling database system Project Description: Need an expert in ER database theoretical and modeling database systems? Skills

Define the basic operations of the relational algebra, Define the basic ope...

Define the basic operations of the relational algebra?     Ans: Basic operators of relational algebra are: 1. Union (∪) - Selects tuples which are in either P or Q or in bot

Explain the isa relationship, Explain the ISA relationship Answer: IS...

Explain the ISA relationship Answer: ISA relationship - ISA notation is employed in generalization/ specialization to depict relationship among lower and higer level entity s

Define boyce codd normal form, Define Boyce codd normal form A relation...

Define Boyce codd normal form A relation schema R is in BCNF with respect to a set F of functional dependencies if, for all functional dependencies in F + of the form.α ->β.

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