# Fakultät für informatik informatik 12 technische universität dortmund Lab 3: Scheduling - Session 10 - Peter Marwedel Heiko Falk TU Dortmund Informatik.

## Presentation on theme: "Fakultät für informatik informatik 12 technische universität dortmund Lab 3: Scheduling - Session 10 - Peter Marwedel Heiko Falk TU Dortmund Informatik."— Presentation transcript:

fakultät für informatik informatik 12 technische universität dortmund Lab 3: Scheduling - Session 10 - Peter Marwedel Heiko Falk TU Dortmund Informatik 12 Germany

- 4 - technische universität dortmund fakultät für informatik  p. marwedel, informatik 12, 2008 TU Dortmund Latest Deadline First  3. Exercise: Assume a system of five interdependent tasks T 1 to T 5. The dependencies between the tasks are described by the task graph below (Note: an edge T i  T j means that task T j can only be executed if T i has finished execution). c n denotes the execution time of a task and d n denotes the deadline interval of a task. T 1 with c 1 = 2 and d 1 = 15, T 2 with c 2 = 5 and d 2 = 20, T 3 with c 3 = 4 and d 3 = 12, T 4 with c 4 = 3 and d 3 = 15, T 5 with c 5 = 3 and d 5 = 20 Schedule this task set using latest deadline first. T2T2 T3T3 T1T1 T4T4 T5T5

- 5 - technische universität dortmund fakultät für informatik  p. marwedel, informatik 12, 2008 TU Dortmund Resource Access Protocols  4. Exercise: A task set consisting of tasks T 1, T 2, T 3 and T 4 should be executed on a processor with the following priorities: P 1 = 4 (lowest), P 2 = 3, P 3 = 2, P 4 = 1 (highest). The table shows the values for the arrival times, execution times and the resource accesses for each task. a)Generate an empty task scenario in the software leviRTS and select the algorithm Resource Access Protocol (priority based, preemptive). Create the tasks T 1 to T 4 with the above properties. b)Start the visualization of this scenario. Which problems occur during scheduling? What can be done to solve them? c)Draw (manually) a schedule of the above tasks under the assumption that priority inheritance is used. Verify your drawn schedule using leviRTS. TaskArrival Time Execution Time PrinterCOM1  t P  t V  t P  t V T1T1 02011445 T2T2 210--16 T3T3 45---- T4T4 4513--

Download ppt "Fakultät für informatik informatik 12 technische universität dortmund Lab 3: Scheduling - Session 10 - Peter Marwedel Heiko Falk TU Dortmund Informatik."

Similar presentations