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.
Explain what is meant by the shared libraries?
Specify some of the various file attributes.
List various scheduling queues and explain them?
Briefly describe the rings in Windows NT?
Illustrated out the essential differentiation between non-pre-emptive and pre-emptive scheduling?
In the framework of memory management, describe the placement and replacement algorithms?
What is meant by the process synchronization?
Describe in detail the Translation Look aside Buffer (TLB)?
Illustrate the term RAS Server? Describe in brief.
18,76,764
1939214 Asked
3,689
Active Tutors
1421294
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!