Task:1 Consider a set of three periodic tasks with the execution profiles of following table. Develop scheduling diagrams for this set of tasks. Process Arrival time Execution time Ending deadline A(1) 0 10 20 A(2) 20 10 40 B(1) 0 10 50 B(2) 50 10 100 . C(1) 0 15 50 C(2) 50 15 100 Solution: For fixed priority, we do the case in which the priority is A, B, C. Each square represents five time units; the letter in the square refers to the currently running process. The first row is fixed priority; the second row is earliest deadline scheduling using completion deadlines. AABBAACCAABBAACCAA AABBAC CACAABBAACCCAA For fixed priority scheduling, process C always misses its deadline.