retagged by
1,076 views
2 votes
2 votes

Consider the following justifications for commonly using the two-level $CPU$ scheduling:

I. It is used when memory is too small to hold all the ready processes.

II. Because its performance is same as that of the $FIFO$.

III. Because it facilitates putting some set of processes into memory and a choice is made from that.

IV. Because it does not allow to adjust the set of in-core processes.

Which of the following is true ?

  1. $I, III$ and $IV$
  2. $I$ and $II$ 
  3. $III$ and $IV$
  4. $I$ and $III$ 
retagged by

1 Answer

2 votes
2 votes

Answer : D

Two-level scheduling uses two different schedulers, one lower-level scheduler which can only select among those processes in memory to run. That scheduler could be a Round-robin scheduler. The other scheduler is the higher-level scheduler whose only concern is to swap in and swap out processes from memory.

Reference : Two-level scheduling 

Answer:

Related questions

4.1k
views
1 answers
2 votes
makhdoom ghaya asked Jul 23, 2016
4,139 views
In a demand paging memory system, page table is held in registers. The time taken to service a page fault is $8$ m.sec. if an empty frame is available or if the replaced page is not ... ?$11.6$ m.sec. $16.4$ m.sec. $28$ m.sec. $14$ m.sec.
4.6k
views
1 answers
4 votes
makhdoom ghaya asked Jul 23, 2016
4,554 views
For the implementation of a paging scheme, suppose the average process size be $x$ bytes, the page size be $y$ bytes, and each page entry requires $z$ bytes. The optimum page size ... \frac{x}{2}$\frac{xz}{2}$\sqrt{2xz}$\frac{\sqrt{xz}}{2}$
5.4k
views
1 answers
2 votes
makhdoom ghaya asked Jul 22, 2016
5,414 views
Which of the following conditions does not hold good for a solution to a critical section problem ? No assumptions may be made about speeds or the ... block other processes. Processes do not wait forever to enter its critical section.
1.8k
views
4 answers
2 votes
makhdoom ghaya asked Jul 22, 2016
1,832 views
A specific editor has $200 K$ of program text, $15 K$ of initial stack, $50 K$ of initialized data, and $70 K$ of bootstrap code. If five editors are started ... $335 K$1065 K$320 K$