3:42 PM .oooo AT&T; claflin learninghouse.com Chapter 9-Uniprocesser scheduling
ID: 3820475 • Letter: 3
Question
3:42 PM .oooo AT&T; claflin learninghouse.com Chapter 9-Uniprocesser scheduling T F 1 In a multiprogramming system multiple processes exist concurrently in main memory, T F 20 The key to multiprogramming is scheduling. The medium-term scheduler invoked whenever event occurs that may lead to the blocking of the current processor that may an opportunity to preempt currently nunning process in favor of another T F 4 Scheduling affects the performance of the system because it determines which processes will wait and which will progress. T F 5) The main objective of long-term scheduling isto allocate processor time in such a way aspects of system behavio T F 6) In most interactive operating systems adequate response time is the critical requirement. T F 7)One problem with a pure priority scheduling schen is that lower-priority processes may suffer starvation. T F 8 FCFS performs much better for short processes tha long ones. T F 90 Round robin is particularly effective in a general purpose time sharing system or transaction processing system. T F 10) The objective of a fair-share scheduler is to monitor usage to give fewer resources to users who have had more than their fair share, a more to those who have had less than their fairshare. T F 11 )The traditional UNIX scheduler employs multilevel feedback using round robin within each of the priority queues. T F 2 First-come-first-served FCFS) is a simple scheduling policy that tends to favor lo bound processes over processor bound processes. T F 3) In the Highest Response Ration Next RRN) scheduling policy, longer jobs are favored because they yield a larger ratio from the smaller in the equation. 4) A disadvantage of simulation is that results for a given run only apply to that particular processes under that particular set of T F 15) In fair share scheduling each user is assigned a weighting of some sort tat defines that users share of system as a fraction of the total usage of those resources. 18%Explanation / Answer
1) T
Multiprogramming itself tells that the multiple process executes concurrently at a time.
2) T
The key to multiprogramming is scheduling i.e. about how the process need to be executed in the memory.
3) F
Medium term scheduler never blocks the process it moves the suspended process to secondary memory inorder to allocate that main memory to another process.
4) F
It infacts improves the performance of system by efficiently allocating the processor to the running processes.
5) F
Long term scheduler tells which processes need to be allocated to the processor for processing.
6) T
The responce time is the main critical requirement for any interactive system. That is for what always advancements will be made to the existing one's.
7) T
Because it is priority based the one with higher priority only will be executed even it requires much time than the next other processes.
8) T
FCFS works better for the short processes because it doesnt require much time to wait for execution.
9) T
Because in transaction processing systems the processing time each transaction is very small. so it works better.
10) F
Fair share scheduling shares the CPU equally among the groups or users rather than the processes.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.