Real Time Systems 2071

Group A

Attempt any Two questions.(2 x 12 = 24)

1. Describe  how is the polling, priority scheduling and schedulability analysis performed for prioritized access in IEEE 802.5 Token Rings. What are the other factors those should be taken into account?

2. Define priority driven algorithms. State and prove the optimal earliest deadline first (EDF) theorem.

3. What do you understand by slack stealing in a deadline driven system? Explain the operation of a slack stealer with example.

Group B

Attempt any Eight questions.(8 x 7 = 56)

4. Define schedule and scheduler. List out the conditions under which a schedule becomes a "valid  schedule".

5. What do you understand  by timing constraints and tardiness? Why does a hard real time system require time guarantees?

6. Differentiate between offline and online scheduling in a real time system.

7. List out the advantages and disadvantages of a clock driven approach to scheduling.

8. Explain the meaning of "priority-invention" with the help of timing diagram.

9. Differentiate between priority inheritance and priority ceiling protocols.

10. Describe a simple bin parking formulation method of task assignment in a multiprocessor system.

11. How is the connection established in a Greedy  WRR scheduling algorithms ? Explain.

12. Describe a real time communication architecture of distributed system with diagram.