Lovely Professional University,Punjab

Format For Instruction Plan [for Courses with Lectures and Labs

Course No CAP536

Cours Title REAL TIME SOFTWARE AND SYSTEMS

Course Planner 13676 :: Gargi Sharma

Lectures Tutorial Practical Credits 4 0 0 4

Text Book:

1

Jane W.S.Liu, Real Time System, Pearson Education, 2008.

Other Specific Book:

2 2. Philip Laplante, Real-time systems design and analysis, an engineer's handbook, IEEE Computer Society Press , New York. 3 3. J.E. Cooling, Software Design for Real-time Systems, Chapman and Hall, New York. 4 4. Hassan Gomaa, Software Design Methods for Concurrent and Real-time Systems, Addison-Wesley, Masschachusetts

Other Reading Sr No Jouranls atricles as compulsary readings (specific articles, Complete reference) 5 Other readings 6 http://www. speedqoatsvstems. com 7 http://en.wikipedia.org/wiki/Real-time_computing Relevant Websites Sr. No. (Web adress) (only if relevant to the courses) 8 http:// www.mathworks.com 9 http//books.google.co.in/books?isbn=047118 4063 10 http//www. real-time-systems.com/ 11 http//www. springer, com/com puter/com m un ic ations/journal/11241 Salient Features helps in numerical Topics Case studies on different topics are mentioned. Bank Case Study Topics are well explained with diagrams

1

Approved for Spring Session 2010-11

Detailed Plan For Lectures
Week Number Lecture Number Lecture Topic Chapters/Sections of Homework to be Assigned Pedagogical tool Textbook/other to students Demonstration/case reference study/images/anmatio n ctc. planned

Part 1
Week 1 Lecture 1 Lecture 2 Lecture 3 Lecture 4 Week 2 Lecture 5 Lecture 6 Lecture 7 Lecture 8 Week 3 Lecture 9 Lecture 10 Lecture 11 Lecture 12 Week 4 Lecture 13 Introduction to real time Applications Digital Control High Levels Control Signal Processing Other Real Time Applications. Hard Versus Soft Real-Time System Jobs and Processors Release Time, Deadline and Timing constraints Hard and Soft Timing constraints Hard real time systems Soft real time systems. A Reference Model of Real Time System Processors and Resources ->Reference :1,CH 1 1.1(p-1-16) ->Reference :1,CH 1 1.2(p-16-24) ->Reference :1,CH 1 1.3(p-24-28) ->Reference :1,CH 1 1.4 (p-33-39) ->Reference :1,Chap 1 HomeWork 1 Allocation ->Reference :1,Ch 2 ->Reference :1,Ch 2 2.1 (p-40) ->Reference :1,Ch 2 (p-40-41) ->Reference :1,Ch 2 p- Term Paper 1 Allocation 41 ->Reference :1,Ch 2 (p-41-43) ->Reference :1,Ch 2 (p-43-45) ->Reference :1,ch 3 ->Reference :1,Ch3 p49 CA/Regular/cap536/Lect -1(PPT) CA/Regular/cap536/Lect -2(PPT) CA/Regular/cap536/Lect -3(PPT) CA/Regular/cap536/Lect -4(PPT) CA/Regular/cap536/Lect -5(PPT) CA/Regular/cap536/Lect -6(PPT) CA/Regular/cap536/Lect -7(PPT) CA/Regular/cap536/Lect -8(PPT) CA/Regular/cap536/Lect -9(PPT) CA/Regular/cap536/Lect -10(PPT) CA/Regular/cap536/Lect -12(PPT) CA/Regular/cap536/Lect -12(PPT) CA/Regular/cap536/Lect -13(PPT)

Part 2
Week 4 Lecture 14 Temporal Parameters of real time model ->Reference :1,Ch3 p- HomeWork 1 Submission CA/Regular/cap536/Lect 62 -14(PPT)

2

Approved for Spring Session 2010-11

Week 4

Lecture 15 Lecture 16

Precedence constraints and data dependencies. Precedence constraints and data dependencies. Precedence constraints and data dependencies. Functional parameters Resource parameters of jobs and parameters of resources Resource parameters of jobs and parameters of resources scheduling hierarchy. Commonly used Approaches to Real Time Scheduling Clock-Driven approach Weight Round-Robin Approach Priority-Driven Approach Dynamic versus Static system Effective Release Times and Deadlines. Effective Release Times and Deadlines. Revison of syllabus upto mid term

->Reference :1,Ch3 p- HomeWork 2 Allocation 56

CA/Regular/cap536/Lect -15(PPT) CA/Regular/cap536/Lect -16(PPT)

Week 5

Lecture 17 Lecture 18 Lecture 19 Lecture 20

->Reference :1,Ch3 p56-59 ->Reference :1,Ch3 p62 ->Reference :1,Ch3 p65 ->Reference :1,Ch3 p65-66

CA/Regular/cap536/Lect -17(PPT) CA/Regular/cap536/Lect -18(PPT) CA/Regular/cap536/Lect -19(PPT) CA/Regular/cap536/Lect -19(PPT)

Week 6

Lecture 21 Lecture 22 Lecture 23 Lecture 24

->Reference :1,ch4 ->Reference :1,Ch3 p74 ->Reference :1,Ch4 (p75)

CA/Regular/cap536/Lect -20(PPT) CA/Regular/cap536/Lect -22(PPT) CA/Regular/cap536/Lect -23(PPT)

->Reference :1,Ch4 (p- HomeWork 2 Submission CA/Regular/cap536/Lect 76) -24(PPT) ->Reference :1,Ch4 (p77-79) ->Reference :1,1Ch3page(96-102) ->Reference :1,Ch4 (p79) ->Reference :1,Ch1-4 CA/Regular/cap536/Lect -23(PPT) CA/Regular/cap536/Lect -23(PPT) CA/Regular/cap536/Lect -24(PPT) CA/Regular/cap536/Lect -24(PPT)

Week 7

Lecture 25 Lecture 26 Lecture 27 Lecture 28

MID-TERM Part 3
Week 8 Lecture 29 Lecture 30 Lecture 31 Lecture 32 Commonly used Approaches to Real Time Scheduling Optimality of the EDF and LST Algorithm Non optimality of the EDF and the LST Algorithm Challenges in validating Timing Constraints in Priority-Driven System ->Reference :1,Ch-4 ->Reference :1,Ch4-4.6-(p-81) ->Reference :1,Ch4-4.7(p-84) ->Reference :1,Ch4-4.8(p-86) HomeWork 3 Allocation CA/Regular/cap536/Lect -29(PPT) CA/Regular/cap536/Lect -30(PPT) CA/Regular/cap536/Lect -31(PPT) CA/Regular/cap536/Lect -32(PPT) Approved for Spring Session 2010-11

3

Week 9

Lecture 33 Lecture 34

Off-Line versus On –Line Scheduling. Clock-Driven Scheduling

->Reference :1,Ch4-4.9(p-91) ->Reference :1,Ch-4 4.1 p-74 ->Reference :1,Ch-5 5.1 p-99 ->Reference :1,Ch-5 5.2 p-100 ->Reference :1,Ch-5 5.3 p-102 ->Reference :1,1 chap 6(159-160) ->Reference :1,Ch-5 5.4 p-104

CA/Regular/cap536/Lect -33(PPT) CA/Regular/cap536/Lect -34(PPT) CA/Regular/cap536/Lect -35(PPT) CA/Regular/cap536/Lect -36(PPT) CA/Regular/cap536/Lect -37(PPT) CA/Regular/cap536/Lect -38(PPT)

Lecture 35 Lecture 36 Week 10 Lecture 37 Lecture 38

Clock-Driven Scheduling Notations and Assumptions Static, Timer-Driven Scheduler General Structure of Cyclic Scheduler

Lecture 39

Cyclic Scheduling.

HomeWork 3 Submission CA/Regular/cap536/Lect -39

Part 4
Week 10 Week 11 Lecture 40 Lecture 41 Lecture 42 Lecture 43 Lecture 44 Week 12 Lecture 45 Lecture 46 Lecture 47 Lecture 48 Clock-Driven Scheduling ->Reference :1,Ch-4 HomeWork 4 Allocation 4.1 p-74 Ch-5 5.1 p-99 CA/Regular/cap536/Lect -40(PPT) CA/Regular/cap536/Lect -41(PPT) CA/Regular/cap536/Lect -42(PPT) CA/Regular/cap536/Lect -43(PPT) ->Reference :1,Ch-5 p116-120 ->Reference :1,Ch-5 p120-127 ->Reference :1,1 chap 6(183-186) CA/Regular/cap536/Lect -44(PPT) CA/Regular/cap536/Lect -45(PPT) CA/Regular/cap536/Lect -46(PPT) Improving the Average Response Time of Aperiodic ->Reference :1,Ch-5 pjobs 106-110 Scheduling Sporadic Jobs Practical Consideration and Generalizations Algorithm for Constructing Static Schedules Pros and Cons of Clock Driven Scheduling. Priority Driven Scheduling of Periodic Tasks, Static Assumptions Fixed Priority versus Dynamic Priority Algorithms Maximum Schedule able Utilization, Optimality of the RM and DM Algorithms ->Reference :1,Ch-5 p110-120

->Reference :1,1 chap Term Paper 1 Submission CA/Regular/cap536/Lect 6(186-188) -47(PPT) ->Reference :1,1 chap 6(188- 198) ->Reference :1,Chapter 6 6.3 p-138144 CA/Regular/cap536/Lect -48(PPT)

4

Approved for Spring Session 2010-11

Week 13

Lecture 49

A Schedulability Test for Fixed-Priority Tasks with Short Response Time.

->Reference :1,1 chap HomeWork 4 Submission CA/Regular/cap536/Lect 7(204-207) -49(PPT) ->Reference :1,Chapter 6 6.5 p144153 ->Reference :1,Chapter 6 ->Reference :1,Chapter 6 6.6 p-154160 ->Reference :1,Chapter 6 6.7 p-160173 CA/Regular/cap536/Lect -50(PPT) CA/Regular/cap536/Lect -51(PPT) CA/Regular/cap536/Lect -52(PPT)

Lecture 50 Lecture 51

Priority Driven Scheduling of Periodic Tasks Schedulability Test for Fixed--Priority Tasks with Arbitrary Response Time Sufficient Schedulability conditions for the RM and DM Algorithm, Practical Factors

Lecture 52

Spill Over
Week 14 Lecture 53 Lecture 54 Lecture 55 Lecture 56 Modelling Timing Constraint in Real time Systems. ->Reference :2, CA/Regular/cap536/Lect -11(PPT) CA/Regular/cap536/Lect -27(PPT) CA/Regular/cap536/Lect -53(PPT) CA/Regular/cap536/Lect -44(PPT) Handling Tasks Dependence in Real Time Systems ->Reference :3, Interrupt Processing Overhead Resource Reservation Protocol. ->Reference :4, ->Reference :7,

Details of homework and case studies
Homework No. Homework 1 Homework 2 Topic of the Homework Nature of homework (group/individuals/field work

Real Time Systems,Types of Real Time Tasks,Non real time tasks,Working and applications of Real time Individual tasks and Systems,suitable example. Algorithm for scheduling real time task ,classifications & their features, Constraints of periodic real time Individual tasks, optimal scheduling algorithm EDF algorithm,dynamic priority scheduling algorithm,EDF,clock driven, event driven and hybrid scheduler. critical resources,priority inversion,unbounded priority inversion,resource sharing protocol,synchronization,RTOS priority-based token ring network (IEEE 802.5),use of timed token protocol (IEEE 802.4),Target Token rotation Time (TTRT), jitter,2 phase locking (2PL) based concurrency control protocol Individual

Homework 3

Homework 4

Individual

5

Approved for Spring Session 2010-11

Scheme for CA:out of 100*
Component Homework Term Paper Frequency 3 1 Total :Out Of 4 Each Marks Total Marks 25 25 50 75 25 100

* In ENG courses wherever the total exceeds 100, consider x best out of y components of CA, as explained in teacher's guide available on the UMS List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper) Sr. No. Topic 1 Bounded Access Protocols for LAN and its performance comparison. 2 Dynamic Allocation of tasks and fault tolerant scheduling of tasks.. 3 Communication in LAN 4 application of RTS in Robotics 5 Synchronization in RTS 6 Concurrency control in Real Time Databases 7 Real Time Systems(RTS) Routing and its Resource Reservation and Rate Control.

8 QoS Framework 9 Relation between e-commerce and RTS 10 Schedulers used in RTS 11 Real time application in Medical field 12 Handling resource sharing and Dependencies among real time tasks. 13 Multiprocessor Task Allocation 14 Comparison between the Different protocols used in RTS 15 RTS and Routing and its Resource Reservation and Rate Control.

16 Windows as a real time operating system 17 Benchmark real time operating system. 6 Approved for Spring Session 2010-11

7

Approved for Spring Session 2010-11

Sign up to vote on this title
UsefulNot useful