CS 503 Fall 2008 HW 1: Process Management (70 pts) Due: Friday 02/15/2008, 11:59 PM Problem (30 + 20 + 20 pts) 1. Solaris supports real-time (RT) processes by allowing them to occupy the priority range 100--159. Timeshare (TS) processes occupy range 0--59 and system processes run with priorities in the range 60--99. As discussed in class, the Solaris scheduler, when invoked, picks a highest ready process to run. Sketch the design of a real-time scheduler that implements RMS on top of Solaris's legacy scheduler. That is, the RMS scheduler is "virtual" in the sense that the Solaris kernel is not modified and RMS is emulated on top of Solaris's native scheduler. Discuss the accuracy and overhead of the resultant RMS-over-Solaris scheduler when compared to a kernel-level implementation of RMS. Is the design only limited to RMS? 2. Suppose you decided to implement RMS in a modern kernel aimed at supporting hard real-time MPEG video playback at a given frame rate (e.g., 30 fps). What are the main technical hurdles to
This is the end of the preview.
access the rest of the document.