Homework #3: Scheduling
CMSC 421, Section 0101 (Fall 1999)
Assigned: 12 Oct 1999
Due: 19 Oct 1999 at 2:30 PM
Late homeworks will not be accepted.
Remember: your homework must be turned in online via submit.
- Distinguish between long term and short term schedulers. What are the criteria that influence their design?
- Schedule the following processes using FCFS, non-preemptive SJF, preemptive SJF, and round-robin (5 ms quantum). For each algorithm, show the Gantt chart for the schedule and list the average waiting time for the schedule.
||Arrival time (ms)
||Burst time (ms)
- Problem 5.5 from the text.
- Problem 5.7 from the text.
- Your measurements of a computer system show that some processes are CPU-bound (make few, if any, I/O requests), and that the remainder of the processes are I/O-bound (make many I/O requests, but use little CPU time between them).
- In which scheduling algorithms (FCFS, preemptive & non-preemptive SJF, RR, priority) are I/O-bound processes penalized? Explain.
- Propose a scheduling algorithm that gives I/O-bound processes as much CPU time as they need to complete their tasks. Your solution may not depend on users identifying I/O-bound processes (they usually don't), and should be able to handle cases where a single process alternates between I/O-bound and CPU-bound periods.
- Problem 5.10 from the text.
Syllabus | Schedule | News & Notes | Grades | Feedback
Submit | Homework: 1 2 3 4 5 6 | Project: 1 2 3 4
3 Dec 1999
by Ethan Miller (firstname.lastname@example.org)