Meny
Memorizer
Logg inn
Registrering
Logg inn
Emner
TDT4258
K15
V11
V13
V14
V15
Tips
Kildekode
Kontakt
Maskinnær programmering -
V15
Spørsmål #50
Assume we are using rate monolitic scheduling. Three processes, A,B and C contend for the CPU. Their periods (and deadlines) are 3s, 4s and 6s, respectively. They run for exactly 1, 2 and 1 seconds each time they execute, respectively:
All deadlines are met because the utilization of the CPU of the 3 processes is 100% (1/3 + 2/4 + 1/6 = 1).
Process A fails to meet its second deadline (t = 6s).
Only process C will ever miss deadlines, assuming no context switch overhead.
Earliest deadline first scheduling would meet all deadlines, even assuming realistic context switch overheads.
Svar
Forrige
Tilfeldig
Neste
Funnet en feil? Rediger spørsmålet
-
Poeng: 0/0 (0%)
Combo: 0
Spørsmål: 0/74
Nullstill poeng