OS Real Time Operating Systems(RTOS)
Rate monotonic scheduling assumes that the __________
processing time of a periodic process is same for each CPU burst
processing time of a periodic process is different for each CPU burst
periods of all processes is the same
none of the mentioned
processing time of a periodic process is same for each CPU burst
Related posts
The amount of time required for the scheduling dispatcher to stop one process and start another is known as ______________A. event latency
B. interrupt latency
C. dispatch latency
D. context switch
A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. Can the processes be scheduled without missing the deadlines?
A. Yes
B. No
C. Maybe
D. None of the mentioned
If a set of processes cannot be scheduled by rate monotonic scheduling algorithm, then __________
A. they can be scheduled by EDF algorithm
B. they cannot be scheduled by EDF algorithm
C. they cannot be scheduled by any other algorithm
D. none of the mentioned
T shares of time are allocated among all processes out of N shares in __________ scheduling algorithm.
A. rate monotonic
B. proportional share
C. earliest deadline first
D. none of the mentioned
In a safety critical system, incorrect operation ____________
A. does not affect much
B. causes minor problems
C. causes major and serious problems
D. none of the mentioned
A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35., the priorities of P1 and P2 are?
A. remain the same throughout
B. keep varying from time to time
C. may or may not be change
D. none of the mentioned
In which scheduling certain amount of CPU time is allocated to each process?
A. earliest deadline first scheduling
B. proportional share scheduling
C. equal share scheduling
D. none of the mentioned
Leave a Reply