Scheduling types - Operating System

Q.  Match the following lists:

a. Gang scheduling ------------------------------- i. Guaranteed scheduling
b. Rate monotonic scheduling ------------------ ii. Real-time scheduling
c. Fair share scheduling ------------------------- iii. Thread scheduling

- Published on 27 Aug 15

a. a – i, b – iii, c - ii
b. a – iii, b – ii, c - i
c. a – i, b – ii, c - iii
d. a – ii, b – iii, c - i

ANSWER: a – iii, b – ii, c - i

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 12 Nov 15
    Gang scheduling
    - It is a scheduling algorithm for parallel systems that schedules related threads or processes to run simultaneously on different processors.

    Rate-monotonic scheduling (RMS)
    - It is a scheduling algorithm which is used in real-time operating systems (RTOS) with a static-priority scheduling class.
    - The static priorities are assigned on the basis of the cycle duration of the job: the shorter the cycle duration is, the higher is the job's priority.

    Fair-share scheduling
    - It is a scheduling algorithm for computer operating systems in which the CPU usage is equally distributed among system users or groups, as opposed to equal distribution among processes.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲