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?
What do you mean by demand and pre-paging?
Give a brief introduction of the term named pipe?
Describe what is UFD and MFD.
Specify the difference between Primary storage and secondary storage?
Explain deadlock?
What do you mean by the TLB and Hit-Ratio?
Explain about the java threads?
What do you understand by the term resident set and working set of a process?
Briefly describe the condition when the system is in safe state?
18,76,764
1958764 Asked
3,689
Active Tutors
1460451
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!