Shortest Job First Scheduling
Explain the following algorithm: a) First Come, First Served Scheduling. b) Shortest Job First Scheduling. c) Priority Scheduling.
Explain the following algorithm:
a) First Come, First Served Scheduling.
b) Shortest Job First Scheduling.
c) Priority Scheduling.
Expert
First Come, First Served Scheduling:
Within this Scheduling, the process which requests the CPU first is assigned the CPU first. This Scheduling algorithm is said to be Non Pre-emptive.
Shortest Job First Scheduling:
When the CPU is available, it is allocated to the process which has the smallest next CPU burst. This Scheduling algorithm can be either as Pre-emptive or Non Pre-emptive.
Priority Scheduling:
A Priority is linked with every process and the CPU is assigned to the process that is having the highest priority. This is also either Pre-emptive or Non Pre-emptive.
Memory-Management Unit:
Run-time mapping form the virtual to the physical addresses is done by the hardware device is a known as the Memory Management Unit.
Write down the latest editions of Windows 7?
Explain the term Indefinite Blocking or Starvation.
What is meant by the reference string?
Explain the term semaphores?
Write down the drawbacks of Micro-kernels?
What is meant by Distributed systems?
Give a brief introduction of the term Kernel in the reference of OS?
What do you mean by the term arm-stickiness? Illustrate in brief.
What is meant by the term mutex?
What do you meant by the CPU-bound process?
18,76,764
1951408 Asked
3,689
Active Tutors
1417425
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!