The Best App on the Basics of Real time systems, learn a topic in a minute

This free App covers most important topics in simple English and diagrams for a quick study and revisions at the time of Exams, Viva, Assignments and Job interviews. It is the most useful App for last minute preparations.

The best app for school, college and work. If you are a student It will help to learn a lot.

This useful App lists 121 topics in 5 chapters, totally based on practical as well as a strong base of theoretical knowledge with notes written in very simple and understandable English.

Consider this App as a quick note guide which professors use in a classroom. The App will help in faster learning and quick revisions of all the topics.

Some of the topics Covered in the app are:

1. Processors Reserves and resource kernel

2. Application Program Interface and SSP Structure

3. Controlling Concurrent Accesses to Data Objects

4. Introduction to Real Time Systems

5. Time

6. Simulation

7. Testing

8. Verification of Systems

9. Run Time Monitoring

10. Symbolic Logic

11. Predicate Logic

12. Interpretation

13. Automata and Languages

14. Finite Automata

15. Typical Real-Time Applications

16. More Complex Control-Law Computations

17. Heigh Level Control

18. Signal Processing

19. Other Application of Real Time Systems

20. Jobs and Process

21. Real Times, Dead Lines and Timing Constraints

22. Hard and Soft Timing Constraints

23. Hard Real time Systems

24. Soft Real Time Systems

25. Processors and Resources

26. Temporal Parameters of Real time Workload

27. Fixed, Jittered, and Sporadic Release Times

28. Execution Time

29. Periodic Task Model

30. Aperiodic and Sporadic Tasks

31. Precedence Constraints and Data Dependency

32. Data Dependency

33. Other Type of Dependencies

34. Clock Driven Approach

35. Weighted Round-Robin Approach

36. Priority-Driven Approach

37. Dynamic versus static system

38. Effective Release Times and Deadlines

39. Optimality of Effective-Deadline-First (EDF) and Least-Slack-Time-First (LST) Algorithms

40. Nonoptimility of the EDF and LST Algorithm

41. Challenges in validating timing Constraints in Priority Driven Approach

42. Offline Versus Online Scheduling

43. Objectives, Correctness, and Optimality

44. Alternative Approaches

45. Diferrable Servers

46. Schedulability of Fixed-Priority Systems Containing Deferrable Server(s)

47. Schedulability of Deadline-Driven Systems in the Presence of Deferrable Server

48. Sporadic Servers

49. Enhancements of Fixed-Priority Sporadic Server

50. Simple Sporadic Servers in Deadline-Driven Systems

51. Constant Utilization, Total Bandwidth with Weighted Fair-Queueing Servers

52. Constant Utilization Server Algorithm

53. Total Bandwidth Server Algorithm

54. Fairness and Starvation

55. Preemptive Weighted Fair-Queuing Algorithm

56. Scheduling of Sporading jobs

57. Real time Performance for Jobs with Soft Timing Constraints

58. Performance of Bandwidth-Preserving Server Algorithms

59. A Two Level Scheme for Integrated Scheduling

60. Scheduling Predictable Applications

61. Scheduling Non predictable Applications

62. Algorithms for Scheduling Aperiodic Jobs

63. Assumptions on resources and their Usage

64. Effect of Resource Contention and Resource Access Control (RAC)

65. Additional Terms, Notations, and Assumptions

66. Non preemptive Critical Sections