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

Order by clause-data manipulation language, Order by clause By usin...

Order by clause By using this rows can be sorted It is used in the last portion of select statement By default it gets ascending order DESC: is used

Design and building a distributed information system, prototype of a distri...

prototype of a distributed information system for a national car part retail outlet chain.

What is the difference between a key and a superkey, What is the difference...

What is the difference between a key and a superkey? Key - A key a single attribute or a combination of two or more attributes of an entity set which is used to identify one

Define the method of recursion, What is recursion? Is it possible for a sto...

What is recursion? Is it possible for a stored procedure to call itself or recursive stored procedure?  How many levels of SP nesting is possible? Recursion is method of proble

Clinic, Need a sample of a clinic database relationships

Need a sample of a clinic database relationships

Explain traditional programming languages, How persistent programming langu...

How persistent programming languages differ from traditional programming languages? Database languages vary from traditional programming languages in that they directly manipul

Data files indices and data dictionary, The indices are accumulated in the ...

The indices are accumulated in the index files. The data is accumulated in the data files. Indices give fast access to data items. For example, a book database may be managed in th

What is a primary key, What is a primary key? Primary key is chosen by ...

What is a primary key? Primary key is chosen by the database designer as the principal means of identifying an entity in the entity set.

Differentiate between a unique key and a primary key, Differentiate between...

Differentiate between a unique key and a primary key. - By default, clustered index on column are created by primary key while nonclustered index are created by unique key.

Fragmentation-design of distributed databases, Fragmentation: It is defini...

Fragmentation: It is definite as partitioning of a relation into various fragments.Every fragment can be stored at a dissimilar site.

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