Chapter-2

Q1. Define Reliability? Ans. Reliability is the Probability that the system will not under go failure over any part of prescribed interval. The computational reliability R* (S, t, T) is the probability that the system can start a task. T at time t to successfully execute it to completion the system can start state at time t is s. Which is assumed to be a functional state. Related to this is the computational availability. Which is the expected value of the system computation capability at any given time. Q2.Define Availability? Ans. Availability is the fraction of time for which the system up. Throughput is the average number of instructions pr unit time that the system cam process. Q3. Define Performability? Ans. Performability improves upon the traditional measures by explicitly and formally accounting for the fact that the performance of a real time computer should be tied to the consequent performance of the process that it controls the controlled process is defined as having several accomplishment levels.

Q4.Define Virtual Memory? Ans. Virtual memory is a major source of execution time uncertainly. flat is why it is wise to avoid using virtual memory whenever possible. The time taken to handle page faults for example, can very widely and obtaining a good bound on the page fault rate is almost impossible.

Q5.Describe Performance Measure? Ans. Performance Measures are yardsticks by which perfonnance expressed. They are, in a very real sense, languages through which we convey system performance. A performance measures must concise. It must encapsulate in very few numbers (preferably a single number) the performance of a system.

Q6. Explain Properties of Performance Measures? Ans. A good perfonnance measure must: (1) Represent an efficient encoding of relevant information. (2) Provide an objective basis for the Ranking of candidate controllers for a given application. (3) Provide objective optimization criteria for design. (4) Represent verifiable facts.

Q7. Define cost functions? Ans. These functions are obtained by comparing the Performability at a real lime system with a zero Reposes time to a system with given positive response times. The cost function at a particular task execution given by:

Where P(x) is the perfonnability associated with a response time of

Q8. Define Compiler? Ans. The Compiler maps the source level code into a machine level program. This mapping is not unique, the actual mapping will depend on the actual implementation of the particular compiler that is being used. The execution time will depend on the nature of the mapping.

Q9.Define operating system? Ans. The operating system determines such issues as task scheduling and memory management, both of which have major impact on the execution time. Although with machine architecture, it determines the interrupt handling overhead. Q10. Explain Functions and Hard deadlines? Ans. Real-time tasks frequently have hard deadlines the time by which they must finish executing if catastrophic failure of controlled process is to be avoided. They also have cost functions of the response time. These functions are obtained by

comparing the perfonnability of a real-time system with a zero response time to a system with given positive response times. The cost function of a particular task execution is given by Where P(x) is the performability associated with a response time of Cost function and hard deadlines are best explained through a simple and idealized.

Q11. Explain the factor which estimating program run times? Ans. Its depend upon following factors: (1) Source code: Source code that is carefully turned and optimized takes ten time to execute. (2) Complier: The compiler maps the source level code into a machine level program. (3) Machine architecture: Many aspects of the machine architecture have an effect on the execution time that is difficult to quantity exactly. Executing a program may require much interaction between the processor(s) and memory and I/O devices. (4) Operating system: The operating system determines such issues as task scheduling and memory management, both of which have a major impact on the execution time. Along with the machine architecture. It determines the interrupt handling overhead.

Q12.What are the performance measures for Real time systems and explain its properties? Ans. Real time systems are often used in critical applications, and must therefore be carefully designed and validated before being put into, operation the validation process includes checking design correctness using formal and informal methods and characterizing performance and reliability. Performance measures are yardsticks by which performance is expressed. They are, in a very real sense, language through which we convey system performance.

A performance measure must be concise. That is, it must encapsulate in very few numbers, the performance of a system. Example: Consider two system A and B. A And B have system response times with the probability density functions shown system A is clearly more predictable than system B and is only slightly shown flowers, if the mean response time is our performance measure, we rank B higher than A. Properties of performance Measures: (1) A good performance measure must. Represent an efficient encoding of relevant information. (2) Provide an objective basis for the ranking of candidate controllers for a given application. (3)Provide objective optimization criteria for design. (4)Represent verifiable facts. (i) Efficient encoding: One of the problems of dealing with complex systems is the volume of information that is available about them and interactions with the environment. Determining the relevance of individual pieces of data is impossible unless the data are viewed within a certain context or frame work. Such a context suppresses the irrelevant and light lights the relevant. (ii)Objective Basis for ranking: Performance measures must by clyination, quantify the goodness of computer systems in a given application or class of applications. (iii)Objective optimization criteria: The more Complex a system, the more difficult it is to optimize or to fine- tune its structure. There are numerous side effects of even simple actions, for example changing the number of buses in the computer. (iv)Verifiable facts: A performance measure that is impossible to derive is of no use to anybody. To be acceptable, a performance measure should hold out prospect of being estimated reasonably some accurately.