cap536

Lovely Professional University,Punjab

Course No Cours Title Course Planner Lectures Tutorial Practical Credits

CAP536 REAL TIME SOFTWARE AND SYSTEMS 13676 :: Gargi Sharma 4 0 0 4

Sr. No. (Web adress) (only if relevant to the courses) Salient Features

8 http:// www.mathworks.com helps in numerical Topics

9 http//books.google.co.in/books?isbn=047118 4063 Case studies on different topics are mentioned.

10 http//www. real-time-systems.com/ Bank Case Study

11 http//www. springer, com/com puter/com m un ic ations/journal/11241

Topics are well explained with diagrams

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

Jane W.S.Liu, Real Time System, Pearson Education, 2008.1Text Book:

Other Specific Book:2. Philip Laplante, Real-time systems design and analysis, an engineer's handbook, IEEE Computer Society Press , New York.2

3. J.E. Cooling, Software Design for Real-time Systems, Chapman and Hall, New York.3

4. Hassan Gomaa, Software Design Methods for Concurrent and Real-time Systems, Addison-Wesley, Masschachusetts4

Relevant Websites

Other Reading

Format For Instruction Plan [for Courses with Lectures and Labs

1 Approved for Spring Session 2010-11

Detailed Plan For Lectures

Week Number Lecture Number Lecture Topic Chapters/Sections of Textbook/other reference

Homework to be Assigned to students

Pedagogical tool Demonstration/case study/images/anmation ctc. planned

Part 1Week 1 Lecture 1 Introduction to real time Applications ->Reference :1,CH 1

1.1(p-1-16)CA/Regular/cap536/Lect-1(PPT)

Lecture 2 Digital Control ->Reference :1,CH 1 1.2(p-16-24)

CA/Regular/cap536/Lect-2(PPT)

Lecture 3 High Levels Control ->Reference :1,CH 1 1.3(p-24-28)


Lecture 4 Signal Processing ->Reference :1,CH 1 1.4 (p-33-39)


Week 2 Lecture 5 Other Real Time Applications. ->Reference :1,Chap 1 HomeWork 1 Allocation CA/Regular/cap536/Lect-5(PPT)

Lecture 6 Hard Versus Soft Real-Time System ->Reference :1,Ch 2 CA/Regular/cap536/Lect-6(PPT)

Lecture 7 Jobs and Processors ->Reference :1,Ch 2 2.1 (p-40)


Lecture 8 Release Time, Deadline and Timing constraints ->Reference :1,Ch 2 (p-40-41)


Week 3 Lecture 9 Hard and Soft Timing constraints ->Reference :1,Ch 2 p-41

Term Paper 1 Allocation CA/Regular/cap536/Lect-9(PPT)

Lecture 10 Hard real time systems ->Reference :1,Ch 2 (p-41-43)


Lecture 11 Soft real time systems. ->Reference :1,Ch 2 (p-43-45)


Lecture 12 A Reference Model of Real Time System ->Reference :1,ch 3 CA/Regular/cap536/Lect-12(PPT)

Week 4 Lecture 13 Processors and Resources ->Reference :1,Ch3 p-49


Part 2Week 4 Lecture 14 Temporal Parameters of real time model ->Reference :1,Ch3 p-

62HomeWork 1 Submission CA/Regular/cap536/Lect

-14(PPT)


Week 4 Lecture 15 Precedence constraints and data dependencies. ->Reference :1,Ch3 p-56

HomeWork 2 Allocation CA/Regular/cap536/Lect-15(PPT)

Lecture 16 Precedence constraints and data dependencies. CA/Regular/cap536/Lect-16(PPT)

Week 5 Lecture 17 Precedence constraints and data dependencies. ->Reference :1,Ch3 p-56-59


Lecture 18 Functional parameters ->Reference :1,Ch3 p-62


Lecture 19 Resource parameters of jobs and parameters of resources

->Reference :1,Ch3 p-65


Lecture 20 Resource parameters of jobs and parameters of resources scheduling hierarchy.

->Reference :1,Ch3 p-65-66


Week 6 Lecture 21 Commonly used Approaches to Real Time Scheduling

->Reference :1,ch4 CA/Regular/cap536/Lect-20(PPT)

Lecture 22 Clock-Driven approach ->Reference :1,Ch3 p-74


Lecture 23 Weight Round-Robin Approach ->Reference :1,Ch4 (p-75)


Lecture 24 Priority-Driven Approach ->Reference :1,Ch4 (p-76)

HomeWork 2 Submission CA/Regular/cap536/Lect-24(PPT)

Week 7 Lecture 25 Dynamic versus Static system ->Reference :1,Ch4 (p-77-79)


Lecture 26 Effective Release Times and Deadlines. ->Reference :1,1Ch3page(96-102)


Lecture 27 Effective Release Times and Deadlines. ->Reference :1,Ch4 (p-79)


Lecture 28 Revison of syllabus upto mid term ->Reference :1,Ch1-4 CA/Regular/cap536/Lect-24(PPT)

MID-TERMPart 3

Week 8 Lecture 29 Commonly used Approaches to Real Time Scheduling

->Reference :1,Ch-4 CA/Regular/cap536/Lect-29(PPT)

Lecture 30 Optimality of the EDF and LST Algorithm ->Reference :1,Ch4--4.6-(p-81)

HomeWork 3 Allocation CA/Regular/cap536/Lect-30(PPT)

Lecture 31 Non optimality of the EDF and the LST Algorithm ->Reference :1,Ch4--4.7(p-84)


Lecture 32 Challenges in validating Timing Constraints in Priority-Driven System

->Reference :1,Ch4--4.8(p-86)



Week 9 Lecture 33 Off-Line versus On –Line Scheduling. ->Reference :1,Ch4--4.9(p-91)


Lecture 34 Clock-Driven Scheduling ->Reference :1,Ch-4 4.1 p-74


Lecture 35 Clock-Driven Scheduling ->Reference :1,Ch-5 5.1 p-99


Lecture 36 Notations and Assumptions ->Reference :1,Ch-5 5.2 p-100


Week 10 Lecture 37 Static, Timer-Driven Scheduler ->Reference :1,Ch-5 5.3 p-102


Lecture 38 General Structure of Cyclic Scheduler ->Reference :1,1 chap 6(159-160)->Reference :1,Ch-5 5.4 p-104


Lecture 39 Cyclic Scheduling. HomeWork 3 Submission CA/Regular/cap536/Lect-39

Part 4Week 10 Lecture 40 Clock-Driven Scheduling ->Reference :1,Ch-4

4.1 p-74 Ch-5 5.1 p-99HomeWork 4 Allocation CA/Regular/cap536/Lect

-40(PPT)

Week 11 Lecture 41 Improving the Average Response Time of Aperiodic jobs

->Reference :1,Ch-5 p-106-110


Lecture 42 Scheduling Sporadic Jobs ->Reference :1,Ch-5 p-110-120


Lecture 43 Practical Consideration and Generalizations CA/Regular/cap536/Lect-43(PPT)

Lecture 44 Algorithm for Constructing Static Schedules ->Reference :1,Ch-5 p-116-120


Week 12 Lecture 45 Pros and Cons of Clock Driven Scheduling. ->Reference :1,Ch-5 p-120-127


Lecture 46 Priority Driven Scheduling of Periodic Tasks, Static Assumptions

->Reference :1,1 chap 6(183-186)


Lecture 47 Fixed Priority versus Dynamic Priority Algorithms ->Reference :1,1 chap 6(186-188)

Term Paper 1 Submission CA/Regular/cap536/Lect-47(PPT)

Lecture 48 Maximum Schedule able Utilization, Optimality of the RM and DM Algorithms

->Reference :1,1 chap 6(188- 198)->Reference :1,Chapter 6 6.3 p-138-144



Week 13 Lecture 49 A Schedulability Test for Fixed-Priority Tasks with Short Response Time.

->Reference :1,1 chap 7(204-207)->Reference :1,Chapter 6 6.5 p144-153

HomeWork 4 Submission CA/Regular/cap536/Lect-49(PPT)

Lecture 50 Priority Driven Scheduling of Periodic Tasks ->Reference :1,Chapter 6


Lecture 51 Schedulability Test for Fixed--Priority Tasks with Arbitrary Response Time

->Reference :1,Chapter 6 6.6 p-154-160


Lecture 52 Sufficient Schedulability conditions for the RM and DM Algorithm, Practical Factors

->Reference :1,Chapter 6 6.7 p-160-173


Spill OverWeek 14 Lecture 53 Modelling Timing Constraint in Real time Systems. ->Reference :2, CA/Regular/cap536/Lect

-11(PPT)

Lecture 54 Handling Tasks Dependence in Real Time Systems ->Reference :3, CA/Regular/cap536/Lect-27(PPT)

Lecture 55 Interrupt Processing Overhead ->Reference :4, CA/Regular/cap536/Lect-53(PPT)

Lecture 56 Resource Reservation Protocol. ->Reference :7, CA/Regular/cap536/Lect-44(PPT)

Details of homework and case studies Homework No. Topic of the Homework Nature of homework

(group/individuals/field work

Homework 1 Real Time Systems,Types of Real Time Tasks,Non real time tasks,Working and applications of Real time tasks and Systems,suitable example.

Individual

Homework 2 Algorithm for scheduling real time task ,classifications & their features, Constraints of periodic real time tasks, optimal scheduling algorithmEDF algorithm,dynamic priority scheduling algorithm,EDF,clock driven, event driven and hybrid scheduler.

Individual

Homework 3 critical resources,priority inversion,unbounded priority inversion,resource sharing protocol,synchronization,RTOS

Individual

Homework 4 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


Scheme for CA:out of 100*Component Frequency Out Of Each Marks Total Marks

Homework 3 4 25 75

Term Paper 1 25 25

Total :- 50 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.



Documents

cap536