Unformatted text preview: t.
EE 4770 Lecture Transparency. Formatted 15:15, 26 April 1996 from hw.95.05.sol. 1 2 2 Priority 1 tasks used a xed quantum and are scheduled normally. Tasks at priority 2 will be allowed to run for a total of trq , after which they will move back to priority 1. When a task is moved back to the priority-1 ready list, its arrival time is set to tw , not the current time.
By setting the arrival time to this value the task does not loose its place in line. Priority 2 task X is run with a quantum of trq X , for all X at priority 2. If it uses up its quantum it is moved back to priority 1. Otherwise trq X is replaced with trq X , tx , where tx is the amount of time it ran. 2 EE 4770 Lecture Transparency. Formatted 15:15, 26 April 1996 from hw.95.05.sol. 2 3 3 Problem 2: Find timing constraints for the code in the self-balancing washing machine example. Brie y justify each constraint. Show how the code might be scheduled, including interrupt handlers and tasks. Show a situation in which there might be timing di culties and explain how they might be resolved. Solut...
View Full Document
- Fall '99
- Trigraph, Central processing unit, Interrupt, CPU time, Priority level, Lecture Transparency