Unformatted text preview: 300ms. Task Round 1 Round 2 Arrival Run Activity Name Class Info Time Time A α Prio 2 0ms ∞ Repeats: 15ms, wait until multp of 100ms. B α Prio 1 0ms 200ms C β 235ms deadline 215ms 10ms D β 265ms deadline 205ms 30ms E γ FCFS 5ms 70ms F γ FCFS 10ms 90ms Problem 2: The scheduling used above does not guarantee that deadline-scheduled tasks will run as soon as they arrive. Modify the scheduling so that tasks C and D will not have to wait for any of the others, while maintaining the round-robin relationship between tasks in classes α and γ , and the priority and FCFS used within those classes. Problem 3: Compute the worst-case latency and response time for the one-shot events listed in the table below. Event Strong Weak Handler Name Prior. Prior. Run Time A 2 2 2 μ s B 2 1 3 μ s C 1 3 4 μ s D 1 2 5 μ s E 1 1 100 μ s...
View Full Document
- Fall '99
- Central processing unit, American novels, Scheduling algorithm