Question
1. Is a non-preemptive or preemptive scheme more suitable for: a. Time-sharing systems? b. Interactive systems? c. Real-time systems? 2. What is the appropriate method
1. Is a non-preemptive or preemptive scheme more suitable for: a. Time-sharing systems? b. Interactive systems? c. Real-time systems?
2. What is the appropriate method of selecting a process to be dispatched to the CPU by the scheduler?
3. Why is it important to balance the amount of CPU-bound processes in the system against I/O-bound processes?
4. How well does the Earliest Deadline First (EDF) algorithm fulfill scheduling objectives as discussed in class?
5. Why would it be difficult to implement the Shortest Job First (SJF) or Shortest Remaining Time First (SRTF) algorithms?
6. Why is it desirable to keep processes running on the same CPU instead of moving it to another CPU in a SMP system?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Machine Learning And Knowledge Discovery In Databases European Conference Ecml Pkdd 2016 Riva Del Garda Italy September 19 23 2016 Proceedings Part 1 Lnai 9851
Authors: Paolo Frasconi ,Niels Landwehr ,Giuseppe Manco ,Jilles Vreeken
1st Edition
3319461273, 978-3319461274
