RTS Ptu Sample Paper Lords MBD

Real Time Systems
Recommend 6k
Press Ctrl & '+' To enlarge text and pics!
Chapter Notes!
Home TOPICS Chapter 1 : Introduction Real Time System Chapter 2 : Characterizing Real Time System and Task Chapter 3 : Task Assignment and Scheduling Chapter 4 : Programming Languages and Tools Chapter 5 : Real Time Database Chapter 6 : Real Time Communication Chapter 7 : Fault - Tolerance Techniques Chapter 8 : Reliability Evaluation Techniques Chapter 9 : Clock Synchronization
Home
Chapter 1 : Introduction Real Time System
Q1.What is real time system? Ans. Any system where a timely response by the computer to external stimuli in vital is a real time system. Example: A CAR-AND-DRIVE EXAMPLE If we consider a familiar problem of human control driving a car. The driver is the real-time controller, the car is the controlled process, and the other cars together with the road conditions make up the operating environment.
Q2 Explain all types of system? Ans. We have two types of real time system: (1)Soft real time system. (2)Hard real time system. (i) Hard real time system: The requirement that all hard timing constraints must be validated invariably places many restrictions on the design and implementation of hard real-time applications as well as the architectures of hardware and system software used to support them. (ii)Soft real time system: A system in which jobs have soft deadlines is a soft-real system. The developer of a real time system is surely required to prove rigorously that the system surely mee its real time performance objective. Example: On line transaction system, telephone switches as well as electronic games.
open in browser PRO version
Are you a developer? Try out the HTML to PDF API
pdfcrowd.com
Example: On line transaction system, telephone switches as well as electronic games.
Q3. What are the issues in real time system? Ans. A real time computer must be much more reliable than its individual hardware and software component. It must be capable of working in harsh environments. For example: Take task scheduling. Real time computer systems differ from their general-purpose counterparts in two important ways. Firstly they are much more specific in their applications, and second, the consequences of their failure all more drastic.
Q4. Define real time database? Ans. The term real time database system refers to a diverse spectrum of information systems, ranging from stock price quotation systems, to tracks records databases, to real time file systems a real time database contains data objects, called Image objects, that represent real-world object the attributes of an image object are these of represented real world object for example an air traffic control database contains image objects that represent aircraft in the courage area. Q5. Explain release time, deadlines and timing Constraints? Ans. Release Time: The release time of job is the instant of time at which the job becomes available for execution. The job can be scheduled and executed at any time at or after its release time whenever its data and control dependency conditions are met. As an example: We consider a system which monitors and Controls several furnaces. Dead lines: The dead lines of a job is the instant of time by which its execution is required to be computed suppose that in the pervious example, each control low computation job must complete by the release time of the subsequent job. Then, their deadlines are 120 msec, 220 msec and so on, respectively. Timing Constraints: A timing constraints of a job can be specified in termS of its release time and relative or absolute deadlines as illustrated by the above example: some complex timing constraints cannot be specified conveniently in terms of release times and deadlines.
pdfcrowd.com
Q6. Describe Trigger Generator? Ans. The Trigger generator is a representation at the mechanism used to trigger the execution of individual jobs. It is not really a separate hardware unit, typically it is part of the executive software Many of the jobs are periodic i.e. they execute regularly. The Schedule for these jobs can be obtained offline and loaded as a look up table to used by the scheduler.
Q7.Draw structure or block diagram of Real time system OR the components of the RTS. Ans. Schematic block diagram of a Real time system.
Q.8. Explain all types of tasks classes in real time system? OR Explain the concept of periodic and a periodic task with the help of suitable example? Ans. There are five types of task classes: (i) Periodic and aperiodic tasks
pdfcrowd.com
(i) Periodic and aperiodic tasks (ii) Sporadic task (iii) Critical task (iv) Noncritical task (1) Periodic task: There are many tasks in real time systems that are done repetitively. For example one may wish to monitor the speed altitude and attitude of an aircraft every 100 ms. This sensor information will be used by periodic tasks that control and control surfaces of the aircraft (e.g., the ailerons, elevator, rudder and engine thrusts), in order to maintain stability and other desired characteristics. The periodicity of these tasks is known to the designer, and much tasks can be prescheduled. (2) Aperiodic task: There are many other tasks that are aperiodic, that occur only occasionally. For instance, when the pilot wishes to execute a turn a large number subtasks. Associated with that action are self off aperiodic tasks cannot be predicated and sufficient completing power must be held in reserve to execute them in a timely fashion. Aperiodic task with bounded imperatival time are called sporadic tasks. (3) Critical tasks: Critical tasks are those whose timely executions is critical; if deadlines are missed catastrophes occur. Example include life -support systems and the ctahility control of air craft. Critical tasks, are often executed at a higher frequency than is absolutely necessary. (4) Non critical tasks: Non critical tasks are real times tasks, the name implies not critical to the application. However they do deal with time varying data and hence they useless if not completed within a deadline, the goal in scheduling these tasks is these to maximize the percentage of jobs successfully executed within their deadlines.
Q.9. Explain all structure of Real time system? OR Explain the architecture of Real time system How can you classify the tasks for the real time system? Ans. Structure of a real system: The state of the controlled process and of the operating environment (e.g., pressure, temperature, speed and attitude) is acquired by sensors, which provide input to the controller, the real time computer. There is a fixed set of application tasks or jobs, the job list. The software for these tasks is preloaded into the computer. If the computer has a should main memory, then the entire software is loaded into that. The trigger generator is a representation of the mechanism used to trigger the execution of individual jobs. It is not really a separate hardware unit typically it is part of the executive software many of jobs are periodic, the schedule for these jobs can be obtained offline and loaded as a lookup table to be used by the schedule.
pdfcrowd.com
A schematic block diagram of a real time system. There are following phases of civilian aircraft. (1) Take off and crisis until VHF omni range VOR/DME (distance measuring equipment) is out of range. (2) Cruise until VOR/DME is in range again. (3) Cruise until landing is to be initiated. (4) Land.
Q.10. Explain all types of Issues in real time system? Ans. Architecture Issues: (a) Processor architecture: For reasons of economy, off-the-shelf processors are preferred, real time designs seldom design their own processor, for this reason, we do not treat processor architectural. (b) Network architecture: To make systems reliable provide sufficient processing capacity, most real time systems are multiple processor machine. (c) Architecture for clock synchronization: In order to facilitate the interaction between the multiple units of a real time system, the clocks of these unit must be synchronized & tightly (d) Fault-tolerance and reliability evaluation: People can die when real time system fail such systems must therefore be liguly fault-tolerant. Operating system Issues. (a) Task assignment and scheduling: The scheduling of tasks t ensure that real time dead lines are met is central to the mission of a real-time operating system. (b) Communication protocols: It is important to - have interprocessor communication that the has
pdfcrowd.com
(b) Communication protocols: It is important to - have interprocessor communication that the has predictable delays and is controllable. (c) Failure management and recovery: when a processor or software module fails, the system must limit such failure and recover from it. (d) Clock synchronization algorithm: We Mentioned a hardware synchronization architecture built out of phase locked locks. Other Issues (a) Programming languages: Real time engineers need much greater control our timing and used to interface to special purpose device. (b) Data bases: There are many real time data-base applications, such as the stock market, airline, reservations and artificial, Intelligence. (c)Performance measures: Commonly used performance measures such as conventional reliability and through put are useless for real time systems
Loremate.com
Like 6,065
pdfcrowd.com
Real Time Systems

Recommend 6k
Chapter Notes!
Home
Chapter 2 : Characterizing Real Time System and Task
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?
pdfcrowd.com
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?
pdfcrowd.com
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 are best explained through a simple and idealized.
Cost function and hard deadlines
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 Are you a developer? Try out the HTML to PDF API pdfcrowd.com
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.
pdfcrowd.com
(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.
Loremate.com
Like 6,065
pdfcrowd.com
Real Time Systems

Recommend 6k
Chapter Notes!
Home
Chapter 3 : Task Assignment and Scheduling
Q1. Explain Tasks? Ans. Tasks may have precedence constraints, which specific if any task(s, needs to precede other tasks. If task T s output is needed as input by task T, then task T is constrained to be preceded by task T- each task has resource requirements. All tasks require some execution time on a processor.
Q2. What is relative deadline? Ans. The relative deadline of a task is the absolute deadline minus the release time that is, if task T has a relative deadline d1 and is released at lime a, it must be executed by time t d. The absolute deadline is the lime by which the task must be completed. Example is the absolute deadline of T1 is t+d.
Q3. Define schedule? Ans. Schedule is said to be feasible if all the tasks start after their rules times and complete before their deadlines a sit of tasks is A- feasible if cm assignment scheduling algorithm A, when run on that set of tasks, result in a feasible schedule The bulk of the work in real time scheduling deals with obtaining feasible schedules.
Q4. Explain static and dynamic priority algorithm?
pdfcrowd.com
Ans. There are algorithms that assumes that the task priority does not change with in a mode; these and called static priority algorithm dynamic priority algorithms assume that priority car change with time, the best known examples of static and dynai nic priority algorithms are the rate monotonic (RM) algorithm and the earliest deadline first (EDF) algorithm.
Q5. Define Myopic offline scheduling (MOS) Algorithm? Ans. The myopic. offline scheduling (MOS) heuristic is an assignment/scheduling algorithm meant for non preemptive tasks. This algorithm tasks account not of processing needs but also of any requirements that tasks may have for additional resources. MOS is an affline algorithm in that iii. Explain Bin Packing Algorithm? . The bin Packing algorithm assigns tasks to processors under the constraint that the total processor utilization must not exceed a given threshold. The threshold is set in such a way that the uniprocessor schedule the tasks arrived to each processor. Tasks assumed to be premeetiable. Q7. Define Buddy strategy? Ans. The buddy strategy takes roughly the same approach as the focused addressing algorithm. Processors are divided into there categories: under loaded, fully loaded overloaded processors to after to take over some of their load. Q.8.Explain Next fit Algorithm? Ans. The Next fit Algorithm is designed to work in conjunction with the rate monotonic uniprocessor scheduling algorithm. It divides the set at tasks into various classes. A set of processors is exclusively assigned to each task class. Tasks are assumed to be premeetiable.
Q.9.Explain utilization Balancing Algorithm? Ans. This algorithm assigns tasks to .Processors one by one in such a way that at the end of each step, the utilizations of the various processors are as nearly balanced as possible. Tasks are assumed to be preemptiable. Are you a developer? Try out the HTML to PDF API pdfcrowd.com
Q10. Difference between preemptive and non preemptive scheduling? Ans. Non preemptive schedule according to the same priority assignment. This schedule is same as the preemptive schedule. However at time 4 when is in released both processors are busy. It has to wait until by computer before it can begin execution.
Example of priority-driven scheduling. Non preemptive scheduling is not better than preemptive scheduling. Preemptive scheduling is better when the cost of preemption is ignored. Specifically, in a multiprocessor system.
Q11. Explain Rate Monotonic Algorithms? Ans. A will known fixed priority algorithm is the rate monoto algorithm. This algorithm assigns priorities to tasks based on the periods. The shorter the period, the higher the priority the rate of a is the inverse of its periods. Hence the higher its rate the higher will refer to this algorithm as RM the algorithm for short and a e produced by algorithm as a RM schedule. example: the RM schedule of the system whose cyclic schedule is
pdfcrowd.com
example: the RM schedule of the system whose cyclic schedule is system, contains three tasks T1 (4, 1), T2 = (5, 2) T3 = (20, 5) the priority of T1 is the highest because its rate is the higher each job in the
task is placed at head of the priority. Another wellknown fixed priority algorithm is deadlines monotonic algorithm called the DM algorithm hereafter. This algorithm assigns priorities to tasks according this relative deadlines. The shorter relative deadlines the higher priority.
Q12. Explain uniproeessor scheduling and multiprocessor scheduling. Ans. Uniprocessor scheduling is part of the process of developing multiprocessor schedule our ability to obtain a feasible multiproces schedule is therefore linked to our ability to obtain f - uniprocessor schedule.
pdfcrowd.com
feasible multiproces schedule is therefore linked to our ability to obtain f - uniprocessor schedule.
(1) Traditional rate monotonic (RM): The task ;et consists of periQdic, preemptiable tasks whose deadlines equal the task period. A task set of n tasks is schedulable under RM if its total processor utilization is not greater than n(2-l) (2) Rate monotonic deferred snuer (DS): This is similar to the RM algorithm except that it can handle both periodic and aperiodic tasks. (3) Earliest deadline first (EDF): Tasks are preemptible and the task with the earliest deadline has the highest priority. EDF is an optimal uniproussor algorithm. 4) Precedence and exclusion conditions: Both the RM and EDF algorithms assume that the tasks one Independent and preemptive anytime. (5) Multiple task unisons: The system has primary and alternative versions vary in their execution time and in the quality of output they provide. Primary versions are the full fledged tasks, providing top quality output. Multiprocessor Scheduling: (1) Utilization balancing algorithm: This algorithm assigns tasks to processors one by one in such a way that at the end of each step, (2) Next fit algorithm: The next fit algorithm is designed to work in conjunction with the rate monotonic uniprocessor scheduling algorithm. It divides the set of tasks into various classes. (3) Bin packing algorithm: The bin packing algorithm assigns tasks to processor under the constraint th,t the total processorutilization must not exceed a given threshold. (4) Myopic offline scheduling algorithm: This algorithm can deal with non-preemptive tasks, It builds up the Are you a developer? Try out the HTML to PDF API pdfcrowd.com
Myopic offline scheduling algorithm: This algorithm can deal with non-preemptive tasks, It builds up the schedule using a starch process. (5) Focused addressing and building algorithm: In this algorithm, tasks are assumed to arrive at the individual processors. A processor that finds itself unable to meet the deadline or other constraints of all its tasks tries to offload some of its workload onto other processors. (6) Buddy strategy: The buddy strategy tasks roughly the some approach as the focused addressing algorithm. Processors are divided in to three categories under loaded, fully loaded and ourhead-our loaded processors ask the under loaded processors ask the under loaded processors to offers to take over some of their load. (7) Assignment with precedence constraints: The last task assignment algorithm takes task precedence constraints into account.
Q13.Explain Preemptive Earliest Deadline First? Ans. A Processor following the EDF algorithm always executes the ti whose absolute deadline is the earliest. EDF is a dynamic priorit scheduling algorithm; the task priorities are not fixed but depending on the closeness of their absolute deadline. EDF is also called the deadline monotonic scheduling algorithm. e.g. consider the following set of (aperiodic) task arrivals to a system.
When T1 arrives, it is the only task waiting to run and so starts executing immediately. T2 arrives at time 4, since d2 <d1, it has higher priority than T1 and preempts it. T3 arrives at time 5, now ever since d3 > d, it has lower priority than t2 finishes (at time t), T3 starts since it has higher priority than Ti). T3 runs until 15 at which point T can resume and runs to completion. EDF is an optimal uniprocessor scheduling algorithm. EDF can not feasibly schedule a task set on a uniprocessor, there is no other scheduling algorithm that can. If the total utilization of the task set is no greater than 1, the task set can be feasibly scheduled on a single processor by the EDF algorithm.
Loremate.com
Like 6,065
pdfcrowd.com
Real Time Systems

Recommend 6k
Chapter Notes!
Home
Chapter 4 : Programming Languages and Tools
Q1. Define Programming Language? Ans. Programming Languages are the medium in which computer Programs are written. A Language shapes are not only how we express an idea but also the very idea itself. A good programming languages enables the programmer to state, with a low probability of error, his directions to the computer. It also forces the programmer into the discipline of formatting his thoughts according to the computer language frame work.
Q2. Why Readability is Important? Ans. It is important for two Reason: (1) It makes the debugging process easier. (2) It makes possible the maintenance of the_ program even if the original developers are no longer available.
Q3.Describe features of Real Time Programs and Language? Ans. (1) It real time programs have to deal with a large variety at I/O devices. A real time system acquire their input from and deliver their output to many different kinds of sensors and actuators. (2)A good Real time Language must give the programmer Flexibility as to the scheduling of processor and other resources. (3) Programs must lend themselves to analysis for schedulability.
pdfcrowd.com
(4)A Real time Program, we must be able to analyze it to determine if it meets all the task deadline.
Q4.Define Data Typing? Ans. Data types are used by programmers. The main purpose of Data typing is: (i)To guard against programming errors (ii)To specify the desire degree of numerical precision.
Q5. Define Record? Ans. A Record is a data type that allows the grouping of different data types and is especially useful in database. The dot notation can be used to access individual fields of a Record. e.g. student name denotes the name field by the record student. New components may not be added. e.g. If we define the type student as a type derived from the type student, we cannot add another component, say social-security- number.
Q6. List the important features of ADA useful for Real time Programming? Ans. In Real time Programming, with the help of ADA we can remove the limitation at Record i.e. If we can not add another component in Record, with the help of ADA we can add the component i.e. this limitation is Removed in ADAx by the introduction of the tagged data type that is we could define type student! as derived from student.
Q7. Define Blocks? Ans. A block consists at two parts: a specification, which defines the variables used within the block and a body which contains the statrnents to be executed. A block way be placed anywhere in a program that a statement is written. The ,main purpose of block is infuriation hiding.
pdfcrowd.com
Q8. Define Packages? Ans. Packages take the concept at procedures and functions one step further. A package consist of a package specification, which is the interface to the outside world, in the package declaration, together with a package body Package can be written, debugged and compiled independently of one another. Packages can be placed ir a library and made accessible to everyone who has access to that library.
Q9.Write down the disadvantage of blocks. Ans. The main disadvantage at block is that they have to be explicitly repeated every time they are needed. A procedure or fu.iction can be written out once and called whenever it is needed. This allows economy and permits a hierarchical decomposition of pro grams.
Q10.Explain Run-Time Error? Ans. It is also know as Exception handling. There are two kinds at errors: compile time errors are detected by the compiler, Run time errnrs escape the compiler and occur during execution of the software.
Q11.Describe Euclid? Ans. Euclid is an experimental language developed at the university at Toronto. (1) It has the features at strong type checking and the ability to declare variables at specified memory addresser, which are necessary as security against errors and for handling I/O devices resp. (2) It also has extensive used defined exception handling facilities. (3) Euclid is that it is specifically designed to allow for reasonably accurate estimates of worst case program run times. Such estimates make it possible to determine the schedulability of the Real time work load that is to find out if the Real time tasks of the work load can all meet their hard deadline.
pdfcrowd.com
load that is to find out if the Real time tasks of the work load can all meet their hard deadline. These are features not unique to Euclid (i.e. similar to Ada). > In particular, dynamic data structures are not allowed. > The syntax at the process declaration in Euclid shows how much timing control the programmer is given in this language.
Q 12.Explain the Run Time support? Ans. The key tools of the Run time support are the compiler, the linker. the debugger and the kernel. (1) Compiler: The compiler translate the source code into machine language. A good compiler will have an excellent diagnostic capability, which is used to improve the efficiency of the debugging Process. The compiler should also list, on demand, the machine instructions of the complied unit this is useful in making timing estimator. (2) Linker: It links together the parts. (Which may be separately compiled units at the program or library routines) that makes up the program. (3) Debugger: (i) It allows program execution to be suspended and then Resumed on the programmers command. It makes variables value to the programmer. (ii) It allow the insertion at breakpoints into the program, when a program encounter breakpoint, it suspends execution so that the programmer can inspect the variable values at that point. (iii) It allows the programmer to execute the program step by step. (4) Kernel: The kernel is responsible for arranging the resources of the system. It includes routines for allocating and scheduling the tasks, managing the memory running the algorithm for inter processor communication, handling processor failures and carrying out input and output operations.
Q13. Explain the concept of Run Time error? Ans. There are two kinds of errors: (1) Compile time errors are detected by the compiler. (2) Run time errors escape the compiler and occur during execution of the software.
pdfcrowd.com
(2) Run time errors escape the compiler and occur during execution of the software. (3) It is also known as exception handling. Mechanisms for exception handling in general must have the following rather obvious properties: (i) They must be simple to use without making the s/w difficult to read. (ii) They should have low run time overheads. (iii) The Programmer should have the freedom to specify the recovery actions in response to various kinds of run time error. (4) Ada handles run time errors by raising exceptions. An exception causes controlled to be trans ferred to an exception handler, which is a program for suitably handling chat exception. (5) Every exception condition has a unique name. There are five exception condition that are predefined and programmer is able to define additional conditions. (6) The Predefined conditions are: (i)Constraint Error: Asserted whenever a variable value goes outside its prescribed bounds, if any (ii)Numeric Error: Asserted to indicate an inability to maintain the required levels at precision (usually due to an attempt to divide by zero). (iii)Strong Error: Asserted when the program rums out of memory space.. (iv)Program Error: Asserted whenever an exception occurs that is not captured by any at the other conditions. (v)Tasking Error: Asserted in connection within errors that arise due to the incurrence at use of the tasking mechanism The Programmer has to explicitly state due response to an exception (7)The name of the exception is defined much as a variable type is declared. The programmer must then explicitly raise the exception where its warranted. What happens if an exception is raised in a block, procedure or function but there is no handling routine within that unit? In Ada, the normal execution a the unit ceares and exception keeps propagating until it finds an exceptional handler. If the exception occurs in a block, control is transferred to a point just after the end at the block, if it occurs in a procedure or function, control is transferred to a point just after where that procedure was called
Loremate.com
Like 6,065
pdfcrowd.com
Real Time Systems

Recommend 6k
Chapter Notes!
Home
Chapter 5 : Real Time Database
Q1.Define Database. Ans. Database are a structured and convenient way to manage the sharing ofi large quantities of data among multiple tasks. In many cases, interaction b/w tasks can be defined in terms of read and write operations by those tasks on the database.
Q2.Give the applications of Real Time database? Ans. Real Time database occurs in many important applications: (1) Airline Reservations (2) Banking (3) Stock Market Systems. In airline reservation and banking systems the response time needs to be kept low in order not to annoy customer. In stock market systems, the slow execution of orders can be very expensive in volatile markets.
Q2.Define Transaction? Ans. Transaction is a sequence of read and write operations. If t is a set of transactions a history over t is an interleaving of the reads and writes in the transactions in t. Transaction is said to be a query if it consists only of Read operations and up date otherwise.
pdfcrowd.com
Q3.Define Atomicity? Ans. An action is said to be atomic if it is either done completely or not at all. Thus, if a transaction specifies several steps the end Result must be as if either all or none at there steps are carried out.
Q4.Define Consistency? Ans. The Transaction Transforms the database from one coi sistent state to another. A consistent state is one that Results from the execution of some given sequence of transaction.
Q5.Define Isolation? Ans. The actions of a transaction are not visible to any other transaction until and unless that transaction has committed.
Q6.Define Durability? Ans. The actions of a transaction on a database (upon commitment) are permanent.
Q7.Explain Absolute Consistency. Ans. Absolute Consistency is accuracy, that is, data about the operating environment must be consistent with the environment. e.g. we interrogate a database to find the current temperature or pressure in a chemical reactor vessel, we want to return data to be close to the current temperature or pressure.
pdfcrowd.com
reactor vessel, we want to return data to be close to the current temperature or pressure.
Q8.Define Relative consistency? Ans. Relative Consistency means that, for multiple data, the data must have been collected reasonably close to one another.
Q9.Explain Database for hard Real Time system? Ans.No conventional database exist that can meet the Requirements at hard Real time systems. All the Real time database of which we are aware have an average transaction time of more than 1 00 ms. This is an average time and many individual transaction suffer for longer response time.
Q10.Explain Need for Response Time Predictability? Ans. There are many factors that make it difficult to predict the response time of transactions: (1) Transactions may be aborted one or more times before they are finally completed. Transaction aborts may be needed to avoid deadlock. (2)Database are often much too large to entirely fit in the main memory and must therefore rely on disc systems. (3)Transaction access (read/writes) may be data dependent. e.g. if we have a transaction that is supposed to deduct a certain amount from a bank balance, it will have one set as accesses the balance is large enough & another if it is not. (4) Transactions may suffer a delay because they are waiting access datum that is currently locked by another transaction.
Q11. Explain Transaction Porftics? Ans.
pdfcrowd.com
Ans. Transactions are granted access to the processors based on their priorities. These priorities are designed to ensure that some system measure of performance is optimized. This implicitly assume that all transactions have equal value to the system. If this in true then some means must be found to incorporate the value at the transaction in the priority assigned to it. The Priority scheme is as follows: (1) Transaction is a higher value class always have priority over transaction in a lower value group. (2) If transaction A$ both belong to the HIT group of the same value class, the one with the earlier deadline in given priority. (3) If A belongs to the ifiT and B to the MISS group of the same value class, A has priority over B. (4) If A and B belongs to the MISS group of the same value class. (a) The value of A is greater than value of B, then A has priority. (b) If they both have same value, the tie is broken on the basis at their relative positions in the list at pending transaction.
Q12. Explain Concurrency control issues in detail? Ans. The Problem of Concurrency control is to allow transactions to execute in parallel while ensuring that the net effect of the execution on database is as if they had been executed in some serial order. There are two basic approaches to concurrency control, pessimistic and optimistic. (1) Pessimistic Concurrency Control: In the Pessimistic approach, we first ensure that the transaction will not violate serialization consistency before letting it execute. The most commonly used approach is two phase locking. The Procedure Requires that the transaction Lock and unlock into two distinct phases. In the locking phase, it acquire the Read and write locks, it needs. In the unlocking phase, it release the locks. The unlocking phase must follow the locking phase. Thus Transactions must haveobtained all the lock it will need before it release any lock. This process has the potential to dedlock. Transactions are limited to Reading the latest certified version of data. This constraint ensure that cascading abort are avoided. (2) Optimistic Concurrency Control: In the optimistic approach, we first carry out the transaction execution and then only check see if the execution at that transaction have violated serialization consistency. (3) Under the optimistic concurrency control, the execution at each transaction consist of there phases, a Read phase, validation phase and a write phase in that order. During Read phase, the transaction Reads the data if needs and writes only into its own private address space. During validation phase, the system check to See if any at the writes has potentially violated specialization consistency for every transaction A
pdfcrowd.com
check to See if any at the writes has potentially violated specialization consistency for every transaction A whose timestamp antedates that at transaction T, serialization consistency is not violated due to T is the following conditions holds. (i) A has completed its write phase before T starts its Read phase. (ii) The read set of A is distinct from the write set of T & A has finished its write phase before T starts its write phase. (iii)The write set of A is distinct from both Read & Write set of T If these conditions are not satisfied, T must be aborted. Since a transaction confines its write to its own private space until it is validated such as abortion requires no cleaning up of the database itself and can be done with little recovery overhead.
Loremate.com
Like 6,065
pdfcrowd.com
Real Time Systems

Recommend 6k
Chapter Notes!
Home
Chapter 6 : Real Time Communication
Q1. Define communication in Real Time system? Ans. Effective communication b/w the various devices of a Real Time system is vital to its correct functioning. Hard Real systems must therefore use communication protocols that allow the communication overhead to the bounded. In soft Real Time systems, such as multimedia or video couferencing where voice and image data are being transmitted.
Q2. Explain the Reasons for Message delay? Ans. (1) Formatting and Packetizing the message. (2) Queuing the message at it wait for access to the communication medium. (3) Sending the message from the source to the destination. (4) Deformatting the messages:
Q3. Define Contant Rate? Ans. Contant Rate: Fixed size packets are generated at periodic intervals. Many sensors produce such traffic. Contant Rate traffic is the earliest to handle since it is smooth and not bursty. The smoother the traffic, the smaller the number of buffer that must be provided at each node.
pdfcrowd.com
Q4.Define Variable Rate? Ans. This may take the forms of fixed size packets being generated at regular intervals or of variable size packets being generated at regular intervals. Video packets are an example of variable sized packet being generated at regular intervals.
Q5. Define Fault Tolerance? Ans. This measures the extent to which the network can with stand the failure of the individual links and under while still remaining functional.
Q6.Define Token? Ans. A token is a grant of permission to a node to transmit its packets on the network when the token holding node completes its transmission, it surrender the token to another node. A node is only permitted to transmit on the N/W if it currently holds the token.
Q7. Explain Packet switching? Ans. The message is broken down into packet, which are messages at a standard or variable length. Packets have headers, which specify their source, destination and any other information that may be required. They are then sent to their destination by the routing and flow control algorithm.
Q8. Define Circuit Switching? Ans. A circuit is a set up bfw source and destination for such time as it required to send the message. The entire circuit it then meant exclusively for this message, any other message that require all or part of this path must wait for the transmission to be completed.
pdfcrowd.com
must wait for the transmission to be completed.
Q9.Give advantages and Disadvantages of optical fiber? Ans. Advantages: (1) The raw bandwidth at a typical fiber can be high or several hundred GHz. (2) Optical signals are immune to the effect at electromagnetic Disadvantage: (1) It is difficult to passively tap them without a significant signal loss. (2) Optical amplifier to restore signal level are expensive and so taps are impractical unless the system is very small.
Q10.Explain Network topologies? Ans. Network topologies can be broadly classified into point to point and shared categories. In point to point topology nodes are connected by dedicated link. In shared topology, the holds all have access to the communication channel and only one node can transmit at any time over a channel.
Q.11. Explain Network Architecture Issues? Ans. We have three types of Network Architecture Issues. (1) High Level Architecture Issues: At the highest level, a distributed system comprise a set of nodes communicating through an interconnection network. Each made may itself be a multiprocessor comprising application system and N/w processor, a shared memory segment and I/o interface. The nodes of the system nut be interconnected by a suitable N/w. (2) Low Level Architectural Issues: Low Level Architectural Issues involves Packet Processing, routing and error/flow control. In the distributed real time system, there are additional issues related to the support for meeting deadlines, time management and housekeeping. Since the support at these low level issues impedes the execution at application task nodes in a distributed real time system usually have a custom-designed processor for handling there chore. (3) I/o Architecture: A real time computer can process data no faster than it acquire it from senurs & operators. The nature of Ito devices in a real time environment, consisting at it does of sensors and actuator, in quite different from the magnetic disk and taps that are the I/o devices commonly encountered in the general purpose system. Are you a developer? Try out the HTML to PDF API pdfcrowd.com
encountered in the general purpose system.
Q12. Explain Network Topologies in detail? Ans. The network topology for a computer or a distributed system must be carefully chosen since it affect the system response time and reliability. The following feature are important. (1) Diameter: This is the maximum distance b/w any two nodes in the system, as a function of the number of nodes. Ideally, the diameter should increase only slowly as a function at the number of nodes. In a completely connected N/w, where each node has a dedicated link to every other node, the diameter is one, regardless of the number of nodes. (2) Node Degree: This is the number of edges adjacent to the each node and determines the number at I/o ports per node and the number of links in the system. The greater this number, the greater the cost. (3) Fault Tolerance: This measures the extent to which the NIw can withstand the failure of individual links and nodes while still remaining functional. (4) N/w topologies can be broadly classified into point to point and shared categories. In point to point topology, nodes are connected by dedicated links. In shared topology, the nodes all have access to the communication channel and only one node can transmit at any time over a channel.
Q13.Explain Protocols? Ans. Protocols: In which we describe Protocols suitable for real time system. We have different types of Protocols. (1) Contention Based Protocol: These are distributed Protocols that assume a broadcast medium. Nodes monitor the channel and transmit only when they detect that it is idle. If multiple nodes start transmitting at about the same time, there is a collision of packets and the transmissions have to be aborted and then retried. (2) Virtual-Time Carrier-sensed Multiple Access (VTCSMA): The VTC SMA Protocol has been designed for single channel broadcast networks and for the bus and ring topologies. In the Carrier sensed Multiple Access (CSNA) protocols, all the nodes can monitor the communication channel. CSMA is truly distributed algorithm with each node deciding when it will transmit.
pdfcrowd.com
truly distributed algorithm with each node deciding when it will transmit. Performance of the VTCSMA Algorithms: (i) VTCMSA Protocols have a better loss rate, in general than the CSMA Protocols. (ii)The best performance in terms of fraction of loss rate it obtained by the VTCSMA-D Algorithm. (iii) The Performance is a function of the value of , however as long of the transmission delays are not too great and the network is not overloaded. (3)Window Protocol: Like the VTCSMA Protocol, the window protocol is based on collision sensing. Again it can not be guaranteed that messages will be transmitted in time to meet their deadlines. This protocol is therefore only suitable for soft real time system. The protocol ones its name to the window maintained at each node. (4) Timed Token Protocol: The timed token protocol is a simple mechanism by which each node it guaranteed timely access to the network. It distinguishes b/w two basic classes of traffic synchronous and asynchronous. (i) Synchronous traffic is the Real time traffic, the protocol guarantees that each node can send out up to a certain amount at synchronous traffic every time unit. (ii) Asynchronous traffic is non real time traffic that takes up any bandwidth left unused by the synchronous traffic. (5) Stop and go multihop Protocol: (i) The stop and go protocol is another technique to meet hard deadline on packet delivery times. (ii) The stop and go protocol is a distributed algorithm each node works independently without central control. (6) The Polled Bus Protocol: The poled bus protocol assumes a bus N/W within a bus-busy line. When a processor broadcast on the bus, it also maintain this line high. When it finishes broadcasting, this line it reset. (7) Hierarchical Round Robin Protocol: This protocol guarantees that each traffic class i can transmit up to m1 packets every t1 time units for prespecifed m1 and. T1. As with the stop and go protocol, we can bound the delay encountered by a packet at each intermediate node. (8) Deadline Based Protocols: A deadline based protocol on a point to point Network consist of each node transmitting the packet with the earliest deadline. There are two iariations on this, preemptive, and non-preemptive.
Loremate.com
Like 6,065
pdfcrowd.com
Real Time Systems

Recommend 6k
Chapter Notes!
Home
Chapter 7 : Fault - Tolerance Techniques
Q1.Define Hardware Fault? Ans. Hardware Fault is some physical defect that can cause a component to malfunction. A broken wire or the output of a logic gate that is perpetually stuck at some logic value (0 or 1) are hardware faults.
Q2.Define Software Fault? Ans. A software Fault is a bug that can cause the program to fail for a given set at inputs. An error in a manifestation of a fault.
Q3.What is Fault Latency? Ans. The Fault Latency is the duration b/w the onset of a fault and its manifestation as an error. This duration can be considerable. Since the faults themselves are invisible to the outside world, only showing themselves when they cause error, such latency can as we shall see, impact the reliability at the overall system.
Q4.Define error latency?
pdfcrowd.com
Q4.Define error latency? Ans.The error Latency is the duration between when an error is produced and when it is either recognized at an error or cause the failure of the system like fault latencies, error latencies can have a considerable impact on the overall system reliability.
Q5.Explain Error Recovery? Ans. Error Recovery is the process by which the system attempts to recover from the effects of an error. There are two forms of error Recovery forward and backward. In forward error recovery, the error in marked- without any computations having to be redone. In backward recovery, the system is rolled back to a moment in time before the error is believed to have occurred and computation is carried out again.
Q6.Define ADUlT TRALIS? Ans. Audit Trails: A second way of enabling backward error recovery is through audit trails. There are especially popular in database. An audit trait consists of a record at all the actions that have been taken by the system, together with a time stamp indicating when each action was taken.
Q7.What is Data Diversity? Ans. Data diversity is an approach that can be used in association with any of the redundancy techniques, considered above. Sometimes, hardware or software may fail for certain inputs but not for other inputs that are very close to them. Instead of applying the same input data to the Redundant processor, we apply slightly different input data to there.
Q8.Explain Fault and error containment? Ans. When a Fault or error occurs in one part of the system, it can, if unchecked, spread through the system like an infection disease. A fault in one part of the system. Fault and error must therefore be prevented
pdfcrowd.com
like an infection disease. A fault in one part of the system. Fault and error must therefore be prevented from spreading through the system. This is called containment.
Q9.Define Reversal Checks? Ans. If there is a simple Relationship b/w the inputs and outputs of a system, it may then be possible to calculate the inputs given the outputs. This can then be compared within the actual inputs as a check. Reversal is a powerful method, but its applicability is limited to tasks wherdit is relatively easy to carry out the Reverse computation.
Q10.Define Software Redundancy? Ans. The system is provided with different slw various of tasks, preferably written independently by different teams at programmer. so that one version of a task fail under certain inputs, another version can be used.
Q11. Explain Fault Detection? Ans. There are two ways to determine that a processor in malfunctioning, online and offline. Online detection goes on in parallel with no ma! system operation. One way of doing this is to check for az y behaviour that is inconsistent with correct operation. The folk wing action are indicative at a faulty processor: (1) Branching to an invalid destination. (2) Fetching an opcode from a location containing data. (3) Writing into a portion of Memory to which the process has no write access. (4) Fetching an illegal opcode. (5) Inactive for more than prescribed period.
pdfcrowd.com
A monitor (called a watchdog Processor) is associated with each processor, l6oking for sign that the processor is faulty. Offline etection consist o running iagnostic test. WXien a ?rocessor is running such a test it obviously can not be executing the application software. Diagnostic tests can be scheduled just like ordinary tasks. The greater the failure rate, the greater must be the frequency with which these tests are run.
Q12. Explain Fault Types? Ans. Faults are classified according to their temposal Behaviour and output behaviour. A fault is said to be active when it is physically capable of generating errors and to be begin when it is not. Temporal Behaviour classification: There are three fault types: Permanent, intermittent and transient. A permanent fault does not die away with time, but remains until it is repaired or the affected unit is replaced. An intermittent fault cycles b/w the fault active and fault benign states. A transient fault dies away after sometime. Fault type Condition Permanent a(t) > o. b(t) a(t) = o Transient a(t)> o, b(t) o, c(t) > o, d(t) o Intermittent a(t) > o, b(t)> o, c(t) = o, d(t) > o. In fig, a(t) & b(t) are the rates at which the fault switches states, and t is the age of fault. Intermittent faults can be caused by loose wires. Transient faults can be caused by environmental effects. When the memory is rewritten, tl.e fault will go away transient failure are hard to catch, since quite often by the time the system has recognized that such a failure has occurred, it has disappeared leaving behind no permanent defect that can be located output behaviours classification.
A fault is also characterized by the nature of errors that it generates. There are two categories of output behaviour, non malicious and malicious, to understand the difference, consider a unit A which is providing output to units B1 Bq If A has a non malicious fault, any errors it generates will be interpreted
pdfcrowd.com
providing output to units B1 Bq If A has a non malicious fault, any errors it generates will be interpreted in a consistent way by all the units B1. For e.g., if A has an output line that is stuck at logic 0, this is a non-malicious fault because all the units that receive input from this line will read the line as producing a logic 0. A malicious fault is one that is assumed to behave arbitrarily.
In this context, the terms fail-safe and fail stop can be defined. A unit is said to be fail-stop if it responds to up a certain maximum number of failures by simply stopping, rather than putting out incorrect output. A system is said to be fail-safe if it failure node is biased so that the application processes does not suffer catastrophe upon failure.
Q13.Explain Redundancy in detail? Ans. Redundancy: Fault tolerance consists of using and properly managing redundancy. In other words, if the system is to be kept running despite the failure of some of its parts, it must have spore capacity to begin with. There are four types of redundancy: Hardware redundancy: The system is provided with for more hardware than it would need if all the components were perfectly reliable, typically between the and three times as much. Software redundancy: The system is provided with different software versions of tasks, preferably written independently by different teams of programmer. Time Redundancy: The task schedule has some slack in it, so that some tasks can be rerun if necessary & still meet critical deadlines. Information redundancy: The data are coded in such a way that a certain number of bit errors can bedetected andJor corrected. Hardware Redundancy: Hardware Redundancy is the use of additional hardware to compensate for
pdfcrowd.com
Hardware Redundancy: Hardware Redundancy is the use of additional hardware to compensate for failures, it can be used in two ways. The first is its for fault of detection, correction and masking. This is fault detection. The second and long term use of Hardware redundancy is to replace the malfunctioning units. It is possible for systems to be designed so that spares can be switched in to replace any faulty units. Redundancy is expensive. Duplicating or triplicating hardware is a luxury that is only justified in the most critical applications. Traditionally, such use has been largely confined to aerospace applications. In aerospace and other applications, redundancy is more often limited by how much power consumption, heat dissipation, or volume can be accommodated. Modular Redundancy: N-modular Redundancy is the scheme for forward error recovery it works by using N process instead of one and voting on their output M is usually odd. To substain upto M fail units, the NMR system requires (2M+l) units in all. The most popular is the triplex which consists of total of 3 units and can mask the effect of upto one failure.
Software Redundancy: Software faults are quite unlike hardware faults however software never wears out. So the fault one never spontaneously generated during the system operation. To provide reliability in the phase of software faults, we must use Redundancy however simply replicating the same software N times will not work such diversity can be introduced by having teams of programmers. A no. of software versions will depend on extend of common mode failures.
pdfcrowd.com
Loremate.com
Like 6,065
pdfcrowd.com
Real Time Systems

Recommend 6k
Chapter Notes!
Home
Chapter 8 : Reliability Evaluation Techniques
Q1. Define Voter Reliability? Ans. There are two typical designs for voter reliability, one in which there in exactly one voter providing output for the cluster and the second in which there are N voters, one per processor we focus on the first design and leave the second as an exercise.
Q2. What is Fault Latency? Ans. The Fault Latency time is zero. This is usually not the case. It is not until the fault is exercised that the Fault generates an errors. Example: If a wire is broken, it is not some signal is meant to propagate down the wire that the Fault manifests itself. Faults that have not yet manifested themselves are called latent faults.
Q3. Define Software Emr Model OR s/w Reliability? Ans. Software - Emr Models pedict the rate at which software faults will produce errors and are meant to determine when to stop debugging, by providing some guidance on the Reliability of the software at each stage of debugging.The usefulness at software error Models in ultra reliable computer system is extremely limited.
pdfcrowd.com
Q4. Define Jelinski-Miranda Model? Aus. This the earliest and perhaps the most widely used model. It models the error generation rate as proportional to the number of faults in the software. That is, (i) = ji where (i) is the failure rate of software with i faults and J is the unknown parameters.
Q5. Explain Goel-Okumoto Model? Ans. This model amusers that the occurrence of error is a non homogenous Poission process (NHPP) with rate (t) = abe-4t, where a and bore the unknown parameter. This captures the idea that some faults are easy to detect and others difficult. If no error has occurred for a long time, it is reasonable to assume that any faults that exist in the s/w are those that are exercised very infrequently.
Q6.Define Little wood Model? Ans. This model assumes that each fault i can generate errors according to a Poisson process with rate i Since the i can vary, the model allows us the flexibility at assigning different error generation rates to the various faults.
Q7.Explain little wood-verall model? Ans. This model assumes that the time biw failures has the density function: Where there are i faults in the s/w. the unknown parameter i, is itself not a constant, but a random variable with the gamma density.
The function (i) determines how the rate changes with the number of faults i. It is possible to show that if (i) is an increasing function of i,i , is stochastically greater than f for i >j that is Prob{f>x}>Prob{j>x}>x>o Are you a developer? Try out the HTML to PDF API pdfcrowd.com
Prob{f>x}>Prob{j>x}>x>o The values of i and are chosen by the user based on the observed data.
Q8. Explain series-Parallel systems? Ans. A set of components is connected in series, if the failure of any them will reset in system failure. A parallel connection of components requires all the components to fail before the system fails.
Q9. Define combinatorial model? Ans. The system will fail only if there are fewer than two functional processors left in the system. There is no repair and all the failure are assumed to be permanent, the failure probability can be found by counting all the various ways in which fewer than two processors are left and weighting each by its probability of occurrence.
Q10. Define Markov chain Model? Ans. Markov chain models, while more complex than combinational model toe such simple cases, are the Are you a developer? Try out the HTML to PDF API pdfcrowd.com
Markov chain models, while more complex than combinational model toe such simple cases, are the solution method of choice when the systems are moral complex. The system can be modeled as a Markov chain, where the states represent the number of functional procures.
Q11. Explain Parameter Values? Ans. The first step in developing a model is to decide what the input parameters should be: A model always be based on parameter that can either be accurately measured estimated or attitude with confidence. (I) Obtaining Device Failure Rates: There are two ways to obtain device failure rates, collecting field data and life cycle testing in the laboratory. The former is more realistic since it represents the failure rate when the device are being used in their normal operating conditions. The latter is the only choice when the devices are new and field data do not exist. (2) Measuring Error-Propagation Time: To measure now quickly an error can propagation, we use fault injection. This is best done on a prototype, special purpose hardware is used to simulate a fault on a selected line. The status of the related line is monitored using logic analyzers to determine now far and how quickly the error propagates. If the prototype is not available, a s/w simulation can be substituted. Due to variation in execution and message propagation times, the error propagation time is a random variable and must be characterized by a probability distribution function (PDF).
Q12.Explain software-Error Models in detail? Ans. Software error models predict the Rate at which siw faults will produce errors and are meant to determine when to stop debugging, by providing some guidance on the Reliability at the siw at each stage at debugging. (1) Jelimki Moranda model: (Repeated in Question 4) (2) Goel-Okunioto model (Repeated in Question 5) (3) Little wood model (Repeated in Question 6) (4) Little wood-verall model (Repeated in Question 7)
pdfcrowd.com
Q13.Explain Reliability models for Hardware Redundancy? Ans. The most difficult problem in reliability modeling it to keep the complexity at the models sufficiently small. In order to model the reliability of a system, we must express the reliability of each at its component and take into account the impact of the failure of each component of the functioning of the overall system. Components 1.Permanent faults only: (a) Series Parallel System: A set of components is connected in series if the failure of any of them will result in system failure. A parallel connection of components requires all the components to fail before the system fails. 2.Combinatorial model: The system will fail only if there are fewer than two functional processors left in the system. Since there in no repair and all the failures are a sumed to be permanent, the failure probability can be found by counting all the various ways in which fewer than two processors are left and weighting each by its probability of occurrence. 3.Markov chain model: Markov chain model while more complex than combinatorial model for such sim pie caser, are the solution method of choice when the system ar complex. 4.Voter Reliability: (Repeated Question 1) 5.Fault Latency: (Repeated Question 2)
Loremate.com
Like 6,065
pdfcrowd.com
Real Time Systems

Recommend 6k
Chapter Notes!
Home
Chapter 9 : Clock Synchronization
Q1.Define clock synchronization? Ans. Clock synchronization in a vital to the correct operation of Real time system such activities are voting ad synchronized Rollback that the clocks are synchronized fault tightly. There ensures that the functional processors remains synchronized despite a few processor or link failure.
Q2. Explain clock? Ans. Mathematically speaking, clock c is a mapping C1: real time -+ clock time That is, at real time t, c1(t) in the time told by clock c1. The inverse Function c1(T) is the Real time at which the clock c1 tells time T. where it is important to distinguish b/w real and clock times we will use the prefixes r and c Respectively.
Q3. Define synchronization? Ans. Two clocks are said to be synchronized if the times the tell are sufficiently close. More precisely, clocks C1 and C, are synchronized at c time T if for some given the skew b/w clocks c, and c3 at c time T.
pdfcrowd.com
Q4. Explain Impact of Faults? Ans. When faults occurs, the simple algorithm will not work. Let us begin by assuming that all signalpropagation times are zero. e.g. clock c2 undergoes malicious failure and delivers its ticks to the clocks c and c3 at different timer. To clock e1,c2 clock c3,c2 appears to be slower than c3. As a Result both clocks c1 and c3 will work think of themselves as in the middle, the reference clock. They will not correct themselves any way and be free to drift apart indefinitely.
Q.5.What is Loss at synchrony? Ans. Synchronization is carried out by clocks e.xchanging timing mnages and adjusting themselves appropriately. There are two ways in synchrony can be lost as a result of some clocks becoming faulty, when multiple non overlapping cliques are formed and the clocks are driven too fast or two slow.
Q6.. Define Hardware synchronization? Ans. Hardware synchronization Requiresspecial hardware, which is not required by the software synchronization however if offers much tighter synchronization.
Q.7.Define Software Synchronization? Ans When the extremely tight synchronization that is provided by phase locking is not needed, synchronization can be caused out in software. In s/w based synchronization, we have an underlying hardware clock and s/w based correction. The clock time is the such at the hlw time and the correction. Q.8.. Give the advantages at Hardware synchronization? Ans. (1) The main advantages at hardware synchronization is very small clock skews that can be attained.These skews are on the order of nanosecond. This is due to the frequency with which the Resynchronization are carried out.
pdfcrowd.com
Resynchronization are carried out. (2) Another Advantage is that hardware synchronization places no burden on the rest of the system. Q.9.Give the Disadvantages at Hardware synchronization? Ans The main disadvantage is the cost of the hardware. For application where very tight synchronization is not needed, this approach may be to expensive and software synchronization may be the preferred approach. Q10. What is fault-Tolerant synchronization in hardware? Ans. To synchronize in hardware, we can use phase-locked loops. The basic structure of phase-locked loop is shown in fig. The objective is to align, at closely at possible the output at the oscillator with an oscillatory signal input.
Q.11.Give the advantages and Disadvantages of Hardware synchronization? Ans. Repeated Question 8,9. Explain Clocks in detail? Repeated in Question 1,2,3.
Q.12.Explain Fault-Tolerant Synchronization in hardware in detail? Ans. To synchronize in hardware, we can use phase locked loops. The basic structure of phase locked loop as shown in fig.
Completely connected, Zero-Propagation-Time system: Fig:
pdfcrowd.com
Completely connected, Zero-Propagation-Time system: Fig: shows the structures of each of the clocks. Every clock is connected by a dedicated line to every other clock. We assume to being with that signal-propagation times are zero. Each clock has a reference circuit, which accepts as input the clock ticks from other clocks in the system an well as that of its own vco. It generator a Reference signal to which its vco tries to align itself. (1)
(2)Spare-Interconnection Zero-Propagation Time system: Suppose initead at a completely connected structure, we have clocks organized into multiple clusters. Each clock in a cluster is connected by a dedicated link to every other clock in that cluster. (3)Accounting for signal-Propagation Define: We have assumed that the signal propagation times are negligible. This assumption is true if the geographical extent at the system is not large. (4)Multiple fault classes: We have to sustain up to us malicious faults. (5) Advantages and Disadvantages of Hardware synchronization: Repeated Question 1
Loremate.com
Like 6,065
pdfcrowd.com

RTS Ptu Sample Paper Lords MBD

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

RTS Ptu Sample Paper Lords MBD

Caricato da

Copyright:

Formati disponibili

Real Time Systems

Press Ctrl & '+' To enlarge text and pics!

Chapter 1 : Introduction Real Time System

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

Example: On line transaction system, telephone switches as well as electronic games.

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

Real Time Systems

Press Ctrl & '+' To enlarge text and pics!

Chapter 2 : Characterizing Real Time System and Task

Q4.Define Virtual Memory?

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

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

Q8. Define Compiler?

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

Cost function and hard deadlines

open in browser PRO version

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

Real Time Systems

Press Ctrl & '+' To enlarge text and pics!

Chapter 3 : Task Assignment and Scheduling

Q4. Explain static and dynamic priority algorithm?

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

open in browser PRO version

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

open in browser PRO version

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

Real Time Systems

Press Ctrl & '+' To enlarge text and pics!

Chapter 4 : Programming Languages and Tools

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

Real Time Systems

Press Ctrl & '+' To enlarge text and pics!

Chapter 5 : Real Time Database

open in browser PRO version