9.Comparing optimal scheduling and page replacement algorithms (a) What is the t

Question

9.Comparing optimal scheduling and page replacement algorithms
(a) What is the theoretically best process scheduling algorithm (see text 6.3.2)?
(b) What is the main problem with implementing the optimal scheduling algorithm? (c) What is the theoretically best page replacement algorithm (see text 9.4.3)?
(d) What is the main problem with implementing the optimal page replacement algorithm? (e) Compare the "next best" solution in each case -- process scheduling and page replacement: how does each use the process's recent past to approximate the optimal algorithm?

Explanation / Answer

A.Shortest-Job-First Scheduling

B.Round-robin Scheduling alogirtham

C.Paging algoritham

d.online problem

e.Thread process.

Related Questions

Navigate

• Browse (All)
• Browse 9
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.