Question 2 0.5 pts The two decision modes of CPU scheduling algorithms are: Shortest Job First and Shortest Remaining Time First Preemptive and Non-preemptive Round-Robin and FCFS Multi-level Queues with and without feedback Question 3 0.5 pts Preemption is done by the kernel: when a process terminates when a process requests I/O after the quantum expires when a process gives up the CPU voluntarily
Added by Morgan H.
Close
Step 1
The two decision modes of CPU scheduling algorithms are: Show more…
Show all steps
Your feedback will help us improve your experience
Robert Fox and 88 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Which of the following scheduling algorithms could result in starvation? Justify your answer. 1. First Come First Served (FCFS) 2. Shortest Job First (SJF) (nonpreemptive) 3. Shortest Remaining Time First (SRTF) (preemptive) 4. Round Robin (RR) 5. Priority
Paul G.
A processor in a parallel processing computer can work on up to four tasks at once. When the processor is working on one or more tasks, the task completion rate is three tasks per millisecond. When there are three or fewer tasks assigned to the processor, tasks are assigned at the rate of two tasks per millisecond. The processor is unreliable in the sense that at any time the processor is working, it may reboot and discard all of its tasks. In any state i ≠ 0 (e.g. unless the processor is idle), reboots occur at a rate of 0.01 per millisecond. Sketch the continuous-time Markov chain and find the stationary probabilities.
Aarti K.
Assume we need to allocate N tasks onto M CPU cores, and use static priority based scheduling on every core (scheduling on different cores are independent). Please answer the following: (a) How many different options do we have in task allocation? (b) Assume after allocation, there are (N1, N2, ..., NM) tasks on each core. How many different options do we have in task scheduling?
Akash M.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD