UNIT-I: INTRODUCTION (4C—50C) Definition, Typical Real Time Applications: Digital Control, High Level Controls, Signal Processing etc., Release Times, Deadlines, and Timing Constraints, Hard Real Time Systems and Soft Real Time Systems, Reference Models for Real Time Systems: Processors and Resources, Temporal Parameters of Real Time Workload, Periodic Task Model, Precedence Constraints and Data Dependency. UNIT-II; REAL TIME SCHEDULING (51 C—89 C) Common Approaches to Real Time Scheduling: Clock Driven Approach, Weighted Round Robin Approach, Priority Driven Approach, Dynamic Versus Static Systems, Optimality of Effective- Deadline-First (EDF) and Least-Slack-Time-First (LST) Algorithms, Rate Monotonic Algorithm, Offline Versus Online Scheduling, Scheduling Aperiodic and Sporadic jobs in Priority Driven and Clock Driven Systems. UNIT-III : RESOURCES SHARING (90 C—136 C) Effect of Resource Contention and Resource Access Control (RAC), Non-preemptive Critical Sections, Basic Priority-Inheritance and Priority-Ceiling Protocols, Stack Based Priority-Ceiling Protocol, Use of Priority-Ceiling Protocol in Dynamic Priority Systems, Preemption Ceiling Protocol, Access Control in Multiple-Unit Resources, Controlling Concurrent Accesses to Data Objects. UNIT-IV: REAL TIME COMMUNICATION (137 C—174.C) Basic Concepts in Real time Communication, Soft and Hard RT Communication systems, Model of Real Time Communication, Priority-Based Service and Weighted Round-Robin Service Disciplines for Switched Networks, Medium Access Control Protocols for Broadcast Networks, Internet and Resource Reservation Protocols. UNIT-V : REAL TIME OPERATING SYSTEM & DATABASE (175 C—214 C) Features of RTOS, Time Services, UNIX as RTOS, POSIX Issties, Characteristic of Temporal data, Temporal Consistency, Concurrency Control, Overview of Commercial Real Time databases. ‘VERY SHORT ANSWER TYPE QUESTIONS (215 C—233 C) SOLVED PAPERS (2012-13 TO 2016-17) (234 C—248 C)unt Introduction a Part-1... (BC - 31¢) f Introduction : Definition Typical Real Time Applications b Digital Control b High Level Controls c Signal Processing etc | Release Times ¢ Deadlines and Timing Constraints A. Concept Outline : Part-I... B. Long and Medium Answer Type Questions . Part-2 so... Reference Models for Real Time Systems : Processors and Resources bee Real Time System and Soft Real Time Systems le . 820 . 82C A. Concept Outline : Part-2 B. Long and Medium Answer Type Questions Part-3. Periodic Task Model Precedence Constraints and Data Dependency Temporal Parameters of Real Time Workload A. Concept Outline : Part-3.... B, Long and Medium Answer Type Questions 4(CS/T-8) CReal Time System —————————————— 5 (CS/IT-8) C PAR Introduction : Definition, Typical Real Time Applications : Digital Control, High Level Controls, Signal Processing etc., Release Times, Deadlines, and Timing Constraints. GONCEPT QUTLINE : PART-1 * Asystemis called real time system, when we need quantitative expression of time (i.e., real time) to describe the behaviour of the system. + Applications of real time systems : Real time systems found applications in wide ranging areas such as : 1. Industrial applications 2. Defense applications 3. Medical applications 4. Automotive and transportation applications 5. Internet and multimedia applications * Release time : The release time of a jobis the instant of time at which the job becomes available for execution. * Deadline : The deadline of a job is the instant of time by which its execution is required to be completed. Questions-Answers Long Answer Type and Medium Answer Type Questions | J Que 1.1. | What are real time systems ? OR What are the characteristics of ‘Real Time System’ ? Explain its multimedia applications. UPTU 2012-13, ‘ks 05 Answer L Areal time | system is one that must process information and produce a ious within a specified time else risk severe consequences, including lure. Thatis, in a system with areal time constraint it is not good to have the correct action or the correct answer after a certain deadline,6(CSIT-8) C Introduction 3. Real time system can also be defined as any information processing activity or system which has to respond to externally generated input stimuli within a finite and specified period. 4 For example, ABS, aircraft control, ticket reservation system, over temperature monitor in nuclear power station, mobile phone, over temperature controller, Doppler blood flow monitor, ECG/arrhythmia monitor. Characteristics of real time system = 1. Time constraints : a. Every real time task is associated with some time constraints. One very common form of time constraint is deadlines associated with tasks. b. A task deadline specifies the time before which the task must complete and produce the result. Other types of timing constraints are delay and duration. 2. New correctness criterion : a. Inrealtime system, correctness implies not only logical correctness of the result but the time at which the results are produced is also important. b. A logically correct result produced after the deadline would be considered an incorrect result. 3 Embedded: A vast majority of real time system are embedded innature. ‘An embedded computer system is physically’ ‘embedded in its environment and often controls it. 4. Safety criticality : a In many real time systems, safety and reliability are intricately bonded together making them safety critical. A safe system is one that does not cause any damage even when it fails. pb. Areliable system is one that can operate for long durations of time without exhibiting any failures. . Asafety critical system is required to be highly reliable since any failure of the system can cause extensive damages. 5. Concurrency : a Areal timesystem usually needs to respond to several independent events within very short and strict time bounds. b. Forexample, achemical plant automation system, which monitors the progress of a chemical reaction and controls the rate of reaction by changing the different parameters of reaction such as pressure, temperature and chemical concentration. 6 Distributed and feedback structure: a. Inreal time systems, the different components of the system are naturally distributed across widely spread geographic locations. Pa aTEP WYN STN Real Time System 9 b. 7 (CSAT-8) C In these systems, the different events of interest are done at the geographically separate locations. Therefore, these events may often have to be handled locally and responses produced to them to prevent overloading of the underlying communication network. Task criticality : a. Task criticality is a measure of the cost of failure of a task. Task criticality is determined by examining how critical are the results produced by the task to the proper functioning of the system. Areal time system may have task of very different criticalities, It is therefore, natural to expect that the criticalities of the different tasks must be taken into consideration while designing for fault tolerance. Custom hardware : a. A real time system is implemented on custom hardware that is specifically designed and developed for the particular purpose For example, cell phones use processors which are tiny, supporting only those processing capabilities that are really necessary for cell phone operation and specifically designed to be power efficient to conserve battery life. The capabilities of the processor used in a cell phone are substantially different from that of a general purpose processor Reactive : A reactive system is one in which an ongoing interaction between the computer and environment is maintained. 10. Stability: a Under overload conditions, real time systems need to continue to meet the deadline of the most critical tasks, though the deadline of non critical tasks may not be met. This is in contrast to the requirement of fairness for traditional system even under overload conditions. 11. Exception handling: a Many real time systems work round-the-clock and often operate without human operators. For example, consider a smal] automated chemical plant that is set ‘up to work nonstop. When there are no human operators, taking corrective actions on a failure becomes difficult. Even ifno corrective action can be immediately taken, it is desirable that a failure does not result in catastrophic situations. Multimedia applications : 1. One of the most frequently encountered real time applications : multimedia.Introducty R(CSIT-8) C Uction, sn may process, st0res transmit, and display 4, Y any 2 Arwultimedia application MAY PT mages. RFADIC, tnd teyt™ number of video streams, 40 se ofdata frames which encodes a Video, 4, 3. Avideo stream is a sequen ‘Lor music. audio stream encodes @ voice. Sun - 4, Without compression, the storaee spore si Cartan bandwiay required by a video are enormous Therefore, weaved TM, a8 Well ag. the associated audio stream. 16 invariably comp aS Soon as it ig captured 5. MPEG Compression! Decom) a. Avideo compression standard is MPEG-2, The standard makes ye, of three techniques. b. They are motion compensation for reducing temporal redundancy evcte cosine transform for reducing spatial redundancy, ang entropy encoding for reducing the number of bits required to encod all the information. pression = 6. Decompression : a During decompression, the decoder first produces a close ¢ original matrix (i.e., an 8 x 8 pixel block) by approximation of the performing an inverse transform oneach stored transform matrix b. It then reconstructs the images in all the frames from the major blocks in J-frames and difference blocks in P-and B-frames. Que i2. | Explain various issues related to real time system, OR . Explain architecture and operating system issues in context of real time system. Answer Areal time system must be much more reliable than its individual hardware and software components. It must be capable of working in harsh environments, rich in electromagnetic noise and elementary particle radiation and in the face of rapidly changing computing loads. Issues in real time systems are Architecture issues : L. Processor architecture : For reason of economy, generally off-the- shelf processors are preferred. Real time system designer design their own processor. We need to estimate execution time of task and it is important to know how long a particular architecture of processor takes to execute this task. 2. Network architecture : To make system reliable which provide sufficient processing capacity, most real time systems are multiple processor machine which are connected in a network,9 (CSAT-8) C ion : In order to facilitate the stem, the clocks Real Time System 3. Architecture for clock synchronizati i interaction between the multiple units of a real time sy: of these units must be tightly synchronized 4. Fault tolerance and reliability evaluation : There catastrophe when real time system fails, such systems must therefore be highly fault tolerant. Operating system issues : 1. Task assignment and scheduling : The scheduling of tasks ensures that real time deadlines are met which is the most important aspect of a real time operating system. 2, Communication protocols : It is important to have interprocessor communication among the tasks so that the controller can do the specific action at right time. There should be a communication protocol so that there is less delay in performing task and the system is controllable. 3. Failure management and recovery : When a processor or software module fails, the system must limit such failure and recover from it. can be a major 4. Clock synchronization algorithm : Hardware synchronization architecture are built out of phase locked clocks. There are also software implementations of fault tolerant clock synchronization. In this, we have a hardware clock and a software based correction. The clock time is the sum of the hardware time and the correction. A new correction is calculated at regular resynchronization intervals. Other issue: 1, Programming languages : a, Real time engineers need much greater control over timing and need to interface to special purpose device. b. In real time system there are additional requirements in the programming language. c. They require that deadlines must be met and they must specify absolute time intervals and enforce timing constraints 2. Databases : a. There are many real time database applications, such as the stock market, airline reservations and artificial intelligence. b. So, these databases should be updated at right time whenever there is any change in the data. 3. Performance measures : a Commonly used performance measures such as conventional reliability and throughput are useless for real time system. b. Performance measures like performability and hard deadlines are used in real time sysie.n c. Performability is de‘iacd as the probability that the system will allow each accompusiament level to be metIntrod _ neti 10 (CSAT-8) ¢ OdUetion ues involved in real tt me Ques. ] State and explain thevtes ; TSA [UPTU 2018-14, Marks 95) a rks 08) computing. real time computing + must be m) re components: Answer Iss Areal t mpute! uch more reliable than its individua, real time compute hardware and softwa —— it must be capable of working in hare environments, rich j Tr ecemagenetc noise and elementary Particle radiation, and in the face of rapidly changing computation loads. - The field of real time computing 18 especially rich in research Problems because all problems in computer architecture, fault tolerant computing. ang operating evstems are also problems in real time computing, with the added complexity that real time constraints must be met. 4. Forexample, take task scheduling. 5. The purpose of task scheduling ina general purpose system is fairness by which we mean that the computer's resources must be shared out equitably among the users. This end is usually achieved by using round-robin scheduling. Each process is associated witha time-slice. The computer executes a process until one of the following happens ; it is done, it has to stop for something like a disk access or interrupt, or its allotted time-slice has expired. 9 The computer then switches context to another process. ‘There may be variations on this basic theme. For example, the time- slice could be varied according to how much execution time has already been spent on that task ll. Round-robin scheduling ensures that one user does not get a disproportionate share of the computer's services. Such an approach does not work in a real time application. Que 1.4. | Explain the issues involved in designing caches for real time systems. UPTU 2013-14, Marks 05 Answer 1. Caches are common place in computers, they reduce the effective memory-access time and increase the average throughput. There are two ways to allocate cache space. 10. 2. One is to allow the process currently executing the right to use the entire cache areaene 1a CSAIT-8) C Real Time System a (CSIT-#) C .s time) low and is the 3. This keeps the miss rate (effective memory-acces approach adopted by general purpose systems Bexecutes [A resumes execution [Benin [rene ot] i — tz ——> A preempted by B A resumes A completes Fig. 14.4. 4. However, from a real time engineer's standpoint, this approach has the unpleasant side effect of working task runtime less predictable. Example: ‘Suppose process A takes, seconds to execute when it is not interrupted by any other process. b. _ IfAis preempted by another process B and then takes up from where it left off when B gets done. c. It is not necessary that ¢, , +t,» =¢, because when B was executing it might have displaced some of A’s lines from the cache to make room for its own working set. d When A resumes and accesses on these displaced lines, a cache miss results and access time is greater than it would have been if B had not come along and disrupted things. As a result, t, , +t, , is very likely to be greater than t,. e. The execution time of A will depend on the number of times A is preempted and on what happens to the cache upon each preemption. f. Itisimportant that the task execution time be predictable to allow the designer to figure out if r!l critical tasks will meet their deadlines. g. Ifthe effect of the cachc is to make task runtimes very unpredictable, it may actually do more harm than good from the designer's point of view h. Areal time system is typically designed for a specific application. i. Since the consequences of failure are more severe in real time systems than in their general purpose counter-parts, such systems need to be specified more carefully and their performance measures that are capable of expressing timing requirements. i. We require, among other things, means to predict the execution times of programs, to model the reliability of software and hardware, to assign tasks to processors and schedule them so that deadlines are met and to develop mechanisms by which the system can quickly recover from the failure of an individual component. Quel Explain structure of real time system. OR Describe the architecture of real time system. aIntrod 12(C8IT-8) C potion OR typical real time system with block Explain various components of a UPTU 2014-15, Marks 05 diagram ‘Answer | Structure of a real time system : Fig. 1.5.1 shows a achematic block diagram of real time syste some process m in control of 1. Controlled process : a The state of the controlled process and of the operating environment (for example, pressure, temperature, speed, and altitude) is acquired by sensors, which provide inputs to the controller, the real time computer. 2 Sensor: A sensor converts some physical characte into electrical signals. b The data rate from each sensor depel a istics of its environment nds on how quickly the measured parameters can change, itis usually less than 1 kilobyte/ second (kb/s 3 dob list: © Thereis a fixed set of application tasks or jobs, the “job list” is shown in Fig. 1.5.1. b. The software for these tasks is preloaded into the computer. Ifthe computer hasa shared main memory, then the entire software is loaded into that. @ If, on the other hand, it consists of a set of private memories belonging to individual processors, so as to which memories each job should be loaded into. Environment —o Controlled process Sensors ‘Trigger generator | Display |+»| Operator Fig, 1.5.1. A schematic block diagram of a real time system.Real Time System 13 (CSAT-8) C 4. Trigger generator : a © 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 the jobs are periodic (i.e., they execute regularly) 5. Execution: ‘The schedule for these jobs can be obtained offline and loaded as a lookup table to be used by the scheduler. b. Jobs can also be initiated depending on the state of the controlled process or on the operating environment. c. For example, when the pressure of a boiler is greater than the preset threshold in a chemical plant or the altitude is less than the threshold in an aircraft, it may be necessary to run some task every xms. d. Finally, jobs can be initiated on command from the operator input panel. 6. Actuator: a. An actuator is any device that takes its inputs from the output interface of a computer and converts these electrical signals into some physical actions on its environment. b. The output of the computer is fed to the actuators. c. Fault tolerant techniques ensure that, despite a small number of erroneous outputs from the computer, the actuators are set correctly. d. The actuators typically have a mechanical or a hydraulic component, and so their time constants are quite high. e. Asa result, the data rates to the actuators are quite low: one 4 command per 25 ms, on average, is not uncommon. 7. Display: a. The output of the computer is fed to the displays. Que 1.6. | What is an embedded real time system ? Enumerate its types. OR Write the features and characteristics of embedded systems. Also, mention its applications. Answer 1. An embedded system can be defined as one which has computer hardware with software embedded in it as one of its most important component.14 (CSIT-8) C 2. on Introduction mbination of computer hardware and or programmable i.e., specifically lication device: An embedded system is a C0l software, either fixed in capability designed for a particular kind of app! Embedded systems are programmable which are provided with a programming interface Typically an embedded system consists of a microcomputer with coftware in ROM/FLASH memory, which starts running a dedicated application as soon as power is turned ON and does not stop unti) power is turned OFF. A general purpose definition of embedded systems is that they are devices used to control, monitor or assist the operation of equipment machinery or plant. Embedded reflects the fact that they are an integral part of the system that includes hardware and mechanical parts. Characteristics of embedded system : ae wp Dedicated functions or tasks. Real time response to task. Generally not reprogrammable by the end user. Complex algorithms. Complex Graphic User Interface (GUI). Features of embedded system : a b. c ad It consists of hardware and embedded software which is capable of performing any specific task. It may or may not contain an operating system for functioning. The software is pre-programmed and it is non-alterable by the end user. For certain category of systems like mission critical system, response time requirement is highly critical. Classification of embedded system : iL 2 Small scale embedded system : a. These systems are designed with asingle 8 or 16 bit microcontroller. b, They have little hardware and software complexities. c. The main tools are : editor, assembler, Integrated Development Environment (IDE). d. ‘C’language is used for programming. The software has to fit within the available memory. Medium scale embedded system : a. These systems are designed with a single or a few 16 or 32 bit microcontrollers. e, b. They have both software and hardware complexities.8) C Real Time System 15 (CSIT: The main tools are : RTOS, simulator, debugger and an Integrated Development Environment (IDE). dC, C++, Visual C++ or Java language can be used for programming. 3. Sophisticated embedded system : a. These systems may need scalable processors or configurable processors and programmable logic arrays. b, They have enormous hardware and software complexities ¢. They are constrained by the processing speeds available in their hardware, d. Certain functions used to obtain additional speed are : encryption and decryption algorithm, discrete cosine transformation algorithm, TCP/IP protocol stacking and network driver functions e. Tools for these systems are not readily available at reasonable cost. Que 1.7. | Elaborate the misconception that real time computing is fast computing. Time 1, A real time system is one which must produce a response within a specified time. 2. Ifthe process is not done before or within the deadline then the result is not considered to be useful, 3. So for these types of systems to be successful we should have a prior knowledge of the parameters of a particular process. 4. For example, if we have fixed release times and known resource request times then the system can compute accurately the occurrence times of future events, 5. The tasks with fixed release times and known request times are said to be predictable. 6. All'the tasks are triggered by clock interrupts which occur at predicted known time instants, 7. Predictability is often achieved by either static or dynamic scheduling of real time tasks to meet their deadlines. 8. Static scheduling makes scheduling decisions at compile time and is off: line 9. Dynamic scheduling is online and uses schedulability test to determine whether a set of tasks can meet their deadlines. 10. Hence, if we have the predicted parameters of the particular task in real time system then the task can be completed in the specified time accurately with minimum response time.Introduction 16 (CS/IT-8) C Que LB, | What are the traditional performance measures used UPTU 201 Mar! for real time systems ? OR Discuss that traditional performance measu) real time systems. Answer 1. Reliability, availability, and throu are the traditional performance measure. general-purpose systems : res are not suitable for ighput, together with related measures, These measures are widely used for a. Reliability is the probability that the system will not undergo failure over any part of a prescribed interval. b. Availability is the fraction of time for which the system is up, c. Throughput is the average number of instructions per unit time that the system can process. 3. These measures require us to define what is meant by the system being up or down. 4. For simple systems, this is obvious. 5. When the system is gracefully degradable, however, we have to define a set of failed system states. 6. The system will be up whenever it is outside this set of failure states, The set of failure states depends on the application, since different applications require different capabilities on the part of the computer. 8 The probability of the system being outside the failure states throughout some interval of time is the capacity reliability over that period. Drawback of traditional performance measures ¢ 1. The drawback of these measuresis that they donot provide a mechanism to study the interplay among the hardware, the system software, and the applications software. 2 Reliability typically focuses on either the hardware or the software, independently of each other. 3. Availability is practically useless as a measure of the ability to meet execution deadlines; the long-term fraction of time for which the system is up tells us nothing about the length of the individual down times. 4. Throughput is an average measure; it conveys the raw computing capacity of the computer, but tells us nothing about the response time of the various control jobs. re _ ‘These traditional measures work well so long as the set of failed states can be unambiguously defined in terms of just the hardware. aeae SAIT-8) C Real Time System Ie 6. For complex systems, this set depends not only on the state ws ihe hardware but also on the current allocation of tasks to the processors, and the way in which these are scheduled. ‘There is no clean way to incorporate these effects in traditional measures. 8. For these reasons, traditional reliability, availability, and throughput are not suitable performance measures for real time computers. Que 1.9. | What system considerations are required in designing real time systems ? UPTU 2014-15, Marks 05 Answer Following are the various system considerations required in designing real time systems : 1. Memory requirements : a. During initial prototyping. we should plan on more memory on the target than during the final stages. b. This is because we will often be running debugging versions of software, which may be larger. c. Also, we will want to include diagnostics and utility programs, which again will consume more memory than expected 4. Once our prototype system is up and running, we can then start thinking about how much memory we “really” need. 2. Peripherals: a. This includes such items as disk controllers, network cards, PC-Card controllers, flash memory chips and graphics controllers. b. Graphics controllers are one of the particularly delicate areas in the design of an embedded system, often because a chip may be very new when it is selected and we may not yet have a driver for it. 3. Debugging: a. In many cases, especially in cost-sensitive designs, we would not want to provide any additional functionality beyond that absolutely required for the project at hand. b. But since the project is usually a brand new design, we will need to ensure that the hardware actually works per se and then actually works with the software c, Werecommend that we install some form of easy-to-get-at hardware debugging port, so that the software can output diagnosties as it is booting. This debug port can be left off for final assembly or a slightly modified “final” version of the board can be created.Int Toduction 18 (CST-8) C nterms of software development time genera}), many times over. v d The cost savings i are modifications pay for the hardwi 4 Processor speed: *, ime operating system, this fact alone a. Although Neutrino isa real time OP system, does not necessarily mean that any: given application willrun qUickly. b. Graphical user interface applications can consume a reasonable amount of CPU and are particularly sensitive to the end-usey'. perception of speed, , : There are other design considerations & Other design considerations desi that relate to both the hardware and software deve! lopment process, They are a Hard real time system design : Provision of asynchronous 10s. ii. Provision of locks or spin locks. iii, Predictions of interrupt latencies latencies of the tasks. iv. Predictability is achieved always take the same P! varying rates of occurrent b. Soft real time system design : One in which deadlines are mostly met. ii Soft real time means that only the precedence and sequence for the task operations are defined, interrupt latencies and context switching latencies are small but there can be few deviations between expected latencies of the tasks and observed time constraints and afew deadline misses are accepted. iii, The preemption period for the soft real time task in worst case may be about a few ms. iv. Mobile phone, digital cameras and orchestra playing robots are examples of soft real time systems. Que 1.10. | Explain about feasibility, optimality and performance measures of schedules. nd context switching by writing all functions which execute redefined time intervals in case of ces of the events. OR Define and explain performability. UPTU 2013-14, Marks 05 Answer 1 Avalid sch i j ithin i Avaliés edule is a feasible schedule if every job completes within its 2. Asset of jobs is schedulable accordi i x ing to a scheduling algorithm if wher using the algorithm the schedules always produces afeasible schedule.Real Time System 3. 10. i. 12. 13. 19 (CS/T-8) C The criterion to measure the performance of scheduling cleo’ for hard real time applications is their ability to find feasible schedules of the given application system whenever such schedules exist. Hence, a hard real time scheduling algorithm is optimal if the algorithm always produces a feasible schedule if the given set of jobs has feasible schedules. Conversely if an optimal algorithm fails to find a feasible schedule, then the given set of jobs cannot feasibly be scheduled by any algorithm. Other commonly used performance measures are the maximum and average tardiness, lateness and response time and the miss, loss and invalid rates. The right choice of performance measure depends on the objective of scheduling. For example, when a set of jobs is not schedulable by any algorithm, then a schedule can be produced according to which the number of jobs failing to complete in time is the smallest. Hence, an algorithm performs better if it can produce a schedule with a smaller number of late jobs than others. Alternatively, it is not considered that how many jobs are late but their tardiness is kept small. In this case, the algorithms that give small, maximum or average tardiness is used. The lateness of'a job is the difference between its completion time and its deadline. Unlike the tardiness of a job which never has negative values, the lateness of ajob which completes early is negative, while the lateness of a job which completes late is positive. Sometimes, jitters in the completion times are kept small; it is done by using scheduling algorithms that try to minimize the average absolute lateness of job. Performability : 1. 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 which are different levels of performance as seen by the user. Each such level of performance is associated with the execution of a certain set of control tasks. To accomplish each control task requires the real time computer to run a set of control algorithms. The performability of the real time computer is defined as the probability that the computer system will allow each accomplishment level to be met.20 (CSTT8) C ; hierarchical view of performabitity : by the requirements of the one above it ana the one bel than the one above it. 5. Fig. 1.10.1 shows four views ofa a Each view is driven receives input from b. Bach view is more detailed low it View 0 4 User's view of controlled-process accomplishment levels rious controlled-process Accomplishment of va Sede ating environment View 1 gb tasks asa function of the oper Capacity of the real time C ol algorithms for vanio —~ 2d proce lanka 4 contro us cont p aéles re, operating system, Hardware structu ftware applications $0 1. Hierarchical view of performance. the state variables of the controlleg 1 to distinguish one grade of View 3 Fig. 1. c._ View 0 specifies in terms o what enables the use process jus another. performance from d. View lis more detailed in specifying the controlled-process tasks that must be run to meet each such grade of performance, ang view 2 is even more detailed in specifying which algorithms myst be run to meet the controlled-process tasks in view 1. e. Finally, view 3 considers the system, and the applications so the requirements of view 2 6. Performability takes the operat ing environment into account in views land 2. 7. The controls that must be applied in order to achieve certain user“ fonctions of the operating environment. 8, However, performability’s advantage lies not inthis, but in its ability to express performance in the only measure that. truly matters—the user’ perception of it. Que 1.11. | Explain about typical real time applications. Answer 1. These systems may include digital control, command and control, signal processing and telecommunication systems, 2. These systems are used to control the engines and brakes of car and regulate traffic lights to schedule and monitor the take-off and landing of plane, to monitor and regulate the blood pressure and heart beats. hardware structure, the operating fiware attributes needed to meet and the algorithms that must be run defined grades of performance are 3. Following are the typical real time applications :Real Time System 21 (CSAT-8) C i, Digital control : a. Many real time systems are embedded in sensors and actuators and function as digital controllers. >) Controlled S process | Sensors ] [ Joblist [creck ] Trigger generation Actuators Execution Display > Operator Fig. 1.11.1. A digital controller. b. The term plant in the block diagram referred to a controlled system, for example, engine or brake. © The state of the plant is monitored by sensors and can be changed by actuators. d. The computing system estimates from the sensor readings, the current state of the plant and computes a contro! output ased on the difference between the current state and the desired state. This computation is called the control-law computation. e. Thus, the generated. Output activates the actuators which bring the plant closer to the desired state. ii, High level controls : a. Incomplex monitor and control system, controllers are typically organized hierarchically. Digital controllers at the lowest level directly control the physical plant, b. Each output of higher level controller is a reference input of one or more lower level controllers. For example, a Patient care system may consist of microprocessor based controllers that monitor and control the Patient's blood pressure, respiration and glucose. These may be high level controller which interacts with the operator, e. According to the command, high level controller do the computation and its output can be transmitted which is reference input for lower level controllers. iii, Signal processing : 4. Most signal processing applications have real time requirements.Introduction 22 (CSIT-8) C - — b. So, for real time systems the response time must be under a fow milliseconds to ® few seconds. For example, in digital filtering, voice compression etc. Que 1.12. | Explain various application areas where real time UPTU 2014-15, Marks 05 systems are useful. Answer 1. Industrial applications : Industrial applications constitute a major usage area of real time systems. ‘A few examples of ‘industrial applications al automation ofreal time systems are : process control systems, industri: systems, SCADA applications, test and me robotic equipment, 2 Medical: A few examples of medic: are ; robots, MRI scanners, radiation therapy equipment, wronitors, and Computerized Axial Tomography (CAT). & Peripheral equipment : A few examples of peripheral equipment that contain embedded real time systems are laser printers, digital copiers, fax machines, digital cameras, and scanners. 4. Automotive and transportation : A few examples of automotive and transportation applications of real time systems are : automotive engine control systems, road traffic signal control, air-traffic control, high-speed train control, car navigation systems, and MPFI engine control systems. 5. Telecommunication application: systems in telecommunication applications are : cellular systems, conferencing, and cable modems. 6 Aerospace : A few important uses applications are : avionics, flight sim systems, satellite tracking systems a 7. Consumer electronies ; Consumer electronics area is replete with numerous applications of real time systems. A few sample applications of real time systems in consumer electronics are * set-top boxes, audio equipment, internet telephony, microwave ovens, intelligent washing machines, home security ems, air conditioning and refrigeration, toys and cell phones. & Defence applications : Typical defence applications ofreal time systems include : missile guidance systems, anti-missile systems, satellite-based surveillance systems. 9 Miscellaneous applications : Real time systems have found numerous other applications in our everyday life, An example of such an application is a railway reservation system. asurement equipment, and al applications of real time systems bedside few example uses of real time video of real time systems in aerospace ulation, airline cabin management nd computer on-board an aircraftReal Time System 23 (CS/IT-8) c Que 1.13. | Explain the air traffic control system. Answer 1, The controller at the highest level of a control hierarchy is a command and control system. 2. Anair traffic control (ATC) system is an excellent example. 3. Fig. 1.13.1 shows a possible architecture. ~~ —~ sensors digital signal Processors database of track records and tracks communication network [P| [surveillance processor display processors communication network, displays Fig. 1.13.1. An architecture of air traffic control system. 4 The ATC system monitors the aircraft in its coverage area and the environment (for example, weather condition) and generates and Presents the information needed by the operators (i.e., the air traffic controllers), 5. Outputs from the ATC system include the assigned arrival times to metering fixes for individual aircraft. These outputs are reference inputs to on-board flight management systems.24 (CSIIT-8) C Introduction 6. Thus, the ATC system indirectly controls the embedded com Jow levels of the control hierarchy 7. Inaddition, the ATC system provides voice and teleme board avionics, Ponents in, try links to on. 8. Thus, it supports the communication amo: (ie., the pilots and air traffic controllers), 9. The ATC system gathers information on the ‘one or more active radars. ng the operators at both levels state” of each aircraft via 10. Such a radar interrogates each aircraft periodically, 11, When interrogated, an aircraft responds by sending to the ATC system its “state variables”: identifier, position, altitude, heading, and so on. ‘The ATC system processes messages from aircraft and stores the state information thus obtained ina database. 13. This information is picked up and processed by display processors Que 1.14, | Write short note on : a. Release time b, Deadline ‘Answer | a. Release time: 1. The release time of a 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 - 3. For example, a system which monitors and controls several furnaces, samples and reads each temperature sensor every 100 msec and places the sampled readings in memory, after its initialization and execution (say at time 0), 4. Italso computes the control law of each furnace every 100 msec in order to process the temperature readings and determine flow rates of fuel, air and coolant. 5. Suppose that the system begins the first control law computation at time 20 msec. 6. The control law is computed periodically in terms of release times of the control law computation jobs ! Jo, Jy.-1Jy-- 7. The release time of the job J), in this job stream is 20+ k x 100 msec for k =0,1,.. 8. Jobs will have no release time if all the johs are released when the system begins execution.25 (CSAT-8) C Real Timo System —— b. Deadline: 1 7. Qu ‘The deadline of a job is the instant of time by which its execution Is required to be completed. ‘Suppose that in the previous example, each control law computation job must complete by the release time of the subsequent job. Then their deadlines are 120 msec, 220 msec and so on respectively If the control law computation jobs must complete sooner, their deadlines may be 70 msec, 170 msec and so on. A job has no deadline if its deadline is at infinity. Response time is the length of time from the release time of the job time of a job is called relative deadline. Hence, the relative deadline of every control law computation job mentioned above is 100 or 50 msec. The deadline of a job, sometimes called its absolute deadlines is equal to its release time plus its relative deadlines. What do you mean by timing constraints ? What are durational timing constraints ? What are minimum and maximum timing constraints and how are they different from durational constraints ? UPTU 2013-14, Marks 05 What is the difference between a performance constraint and a behavioural constraint in a real time system ? Explain with the help of one example of eac),, UPTU 2014-15, Marks 05 OR ‘Answer | 1. The correctness of real time tasks depend both on the logical correctness of the result as well as on the satisfaction of the corresponding timing constraints that apply to certain events ina system 2. These events may be generated by the tasks themselves or the environment of the system. For example, activation of a motor is an event. 3. Events are classified into two types: i Stimulus events : a These are generated by t These events can be produc b. Forexample, a user pressing a button on a telephone generates @ stimulus event to act on the telephone system. These can also be produced synchronously. vironment and act on the system asynchronouslyIntroduction 26 (CS/IT-8) C TE uti / ing of the temperature of the reactor cc. For example, periodic sens! in a nuclear plant. Response events : a. onse events-acton the environment pacha by he system in response to somes b. For example, consider 4 chemical plant where the temperature exceeds 100°C, the system responds by switching off the heater. c. Here, the event of temperature exce and switching off of the heater is the response. + neither be periodic or aperiodic be classified into performance and and are usually mulus events, eding is the stimulus d. Response events cai 4. Timing constraints can broadly behavioural constraints. forms 5. Performance constraints ensure that the computer system perfor satisfactorily whereas behavioural constraints ensure that the environment of a system behaved. 6 These constraints can further be classified into following three types a. Delay constraints : i. It captures the minimum time: (delay) that must elapse between the occurrence of two arbitrary events e, and e,. ii ARere, occurs, ife, occurs earlier than the minimum delay, then there is a delay violation. iii It can be expressed as: (e,) - He.) 2d, where te.) and f(e,) are the time stamps on the events e, and e, respectively and d is the minimum delay specified from e,. b, Deadline constraints : i. It captures the permissible maximum separation between any two arbitrary events e, and e,. ii, The second event must follow the first event within the permissible maximum separation time. iii, It can be expressed as: tle,) -(e,) Sd where f(e,) and f(e,) are the time stamps on the occurrence of events e, and e, respectively and d is the deadline c. Duration constraints : i. A duration constraint on an event specifies the time period over which the event acts.Real Time System _ 27 (CSAT-8) C Difference between performance and behaviourial constraints : ‘S.No Performance constraint It ensures that the computer} system performs satisfactorily. Performance constraints are the constraints that are imposed on the response of the system Deadline constraint is further divided in performance constraint as : a. Stimulus-Response (SR): The deadline is defined on the " response event, measured from the occurrence of the corresponding stimulus event. Constraint is imposed on response event. For example, once the receiver of the handset is lifted, the dial tone must be produced by the system within 2 sec, otherwise a beeping sound is produced until the handset is replaced. Response-Response (RR): Constraint is defined on two response events. In this case, once the first response event occurs, the second response. event must occur before a certain deadline. The constraint has been defined on a response event hence, Behaviourial constraint It ensures that the environment tof asystem is wellbehaved, Behaviourial constraints are the constraints that are imposed on the stimuli generated by the environment. Deadline constraint is further divided in behaviourial constraint as: a. Response-Stimulus (RS) + Here the deadline is on the production of response counted from the corresponding stimulus. The constraint is imposed on the: stimulus event. For example, once the dial tone appears, first digit must be dialled within 30 sec, otherwise the system| enters an idle state and an idle tone is produced. b. Stimulus-Stimulus (SS) : The deadline is defined between two stimuli. The constraint is imposed on the second event which is! stimulus hence, it is a behaviourial constraint. For example, once a user completes dialling a digit, he must: dial the next digit within the next 5 sec, Otherwise, an idle tone is} it is a performance constraint. For example, once) the ring tone is given to the callee, the corresponding ring back tone must be given to| the caller within 2 sec, otherwise the call is terminated. produced.28 (CSIT-8) C . - Int Toductign, ~ ——— Performance Behaviourial constraints constraints Jf - Delay Deadline Duration Delay Deadline Duration x \ « \ RR SR SR RR RS SS SS RS Fig. 1.15.1. Duration constraint is further divided into two types : 1, Maximum durational constraint : a. In this type of constraint, the requirement is that once the event starts, the event must end before a certain maximum duration elapses b. Tt uses the maximum duration which defines the maximum time for a particular event and that event should complete before this ume. 2 Minimum durational constraint : a In this type of constraint, the requirement is that once the event starts, the event must not end before a certain minimum duration. b. Ituses the minimum duration that defines the smallest time which should be completed for a particular event. Que 1.16. | Discuss under what circumstances it is necessary to meet time constraints of time critical jobs for benefit of system. OR List the possible task timing constraints. OR Explain hard and soft timing constraints. Answer 1. The constraint which is imposed on the timing behaviour of a job is called timing constraint. 2. Atiming constraint of a job can be specified in terms of its release time and relative or absolute deadlines. 3. Some complex timing constraints cannot be specified conveniently in terms of release times and deadlines. i, Hard timing constraints : a. ASiming constraint or deadline is hard if the failure to meet is considered to be fatal fault29 (CS/T-8) C Real Time System oS c esult produced b. Ahard deadline is imposed on ajob because produce fae cena oP atrain may cause a collision le, a late command to st 2 ‘ - ‘3 bomb dropped too late may ht a civilian population instead o the intended military target Soft timing constraints : ae a. Itistimingconstraint in which there is no severe loss whet wv b. These ove not expressed as absolute values. Instead, a are expressed in terms of the average response times requir In this the deadline overruns are tolerable but not desired d_ Forexample, in web browsing after clicking the URL, corresponding web page is fetched and displayed within a couple of seconds on an average. e. However, when it takes several minutes to display a requested page, we still do not consider the system to have failed, but merely express that the performance of the system has degraded. Que 1.17. | What do you understand by temporal constraints ? List the possible task timing constraints. UPTU 2014-15, Marks 05 Answer 1, Temporal constraints may or may not be met, however a specific class of applications, called in safety critical real time applications, requires the temporal constraint must to be always met. Such safety-critical real time applications are systems whose failure or malfunction may lead to human losses. Since temporal behaviour is critical, such applications have to be certified to always meet the temporal constraints before they can start operating. 3. Temporal constraints exist in the forms of soft temporal constraints, hard temporal constraints, and firm temporal constraints. 4. Soft temporal constraints are found in soft real time ems. A soft real time system is one in which the response time (ie., a temporal constrain) is specified as an average value and the system does a best effort approach to meet these requirements. A soft temporal constraint specifies an average bound between two events, and a single violation of this constraint does not significantly matter, whereas many violations and high value deviations do. 6 Anexample system with soft constraints is an airline reservation system. Itis irrelevant if the reservation sometimes takes a little more time to book a reservation, as long as the booking operation's execution time is bounded reasonably. 7. Hard temporal constraints are found in mission-critical real time systems. Ahard real time system is a system where the response time is specified as an absolute value that is typically dictated by the environment. onIntroduction 30 (CS/T-8) c - upper bound between s. Ahard tem} val constraint specific s two rena single violation of such @ constraint does matter as hard s are often safety-critical applications. tronic braking system mentioned real time application’ 9. f such as} stem is the ele e 8 Ane be meet the constraint just once, this he constraint could .g system does not 0 here meeting t san absolute above; if the brakin| might have been the critical instant W’ have saved lives. 10. Firm temporal constraints are found in firm re’ constraint has a soft and hard part consisting ofan average bound (soft) and an absolute bound (hard), respectively. . 11, An example is the mentioned patient's ventilation system. Specifying the bound between two ventilation cycles, this timing constraint has a soft constraint and a hard constraint. The soft constraint is fourteen ventilations per minute, and the hard constraint is twelve ventilations. 12. Temporal constraints can be absolute or relative. Absolute temporal constraints are measured with respect toa global clock, usually our wall val time systems. Each clock. 13. Relative temporal constraints are measures with respect to the gecurrence times of specific events on the local clock. Types of task timing constraints : 1. Different timing constraints associated with a real time system can broadly be classified into performance and behavioural. ts ensure that the environment of a system is 2. Behavioural constraint well behaved, whereas performance constraints ensure that the computer system performs satisfactorily. 3. Each of the performance and behavioural constraints can further be classified into the following three types : i Delay constraint ii Deadline constraint Duration constraint Delay: 1. Adelay constraint captures the minimum time (delay) that must elapse between the occurrence of two arbitrary events e, ande,. Aftere, occurs, ife, occurs earlier than the minimum delay, then a delay violation is said to occur. 2 Adelay constraint on the event e, can follows ° be expressed more formally as te, He) 2d t=0 tle) leg) 17,1, Delay constraint between two events e, and e>.5. Itis easy to see that e, Deadline: 1. A deadline constraint 2. In other words, the seco: 3. Consider that tle,) and te, 5. Adeadline constraint Real Time System 31 (CS/IT-8) C 3. Where tle,) and “(e,) are the time stamps on the events ¢, and ¢,, respectively, and d is the minimum delay specified frome, 4. Adelay constraint on the events e, with respect to the event e, is shown in Fig. 1.17.1. In Fig. 1.1 7.1, A denotes the actual separation in time between the occurrence of the two events e, and e, and dis the required minimum separation between the two events (delay). Must occur after at least d time units have elapsed since the occurrence ofe,, otherwise we shall have a delay violation. captures the permissible maximum separation between any two arbitrary events e, and e,. ie nd event (i.e., e,) must follow the first event ¢,) within the permissible maximum separation time. ) are the time stamps on the occurrence of the events e,,ande,, respectively, and d is the deadline as chown is Fig 1.17.2. and e,, and d is the deadline. implies that e, Must occur within d time units of e,'s occurrence. 6. We can alternativel 7. The deadline and delay ly state that te.) and te.) must satisfy the constraint : te,)-te,) | Time > 3. | The cost function in/ The cost may be| The costis associated | hard real time system | interpreted as loss of to overrunning, but | is associated with the | revenue in firm real| this cost may be system. time system. | abstract in case of | soft real time system 4. | Overrun in Ifit doesnot complete, Deadline overruns | Tesponse time within its deadline, are tolerable, but leads to potential loss | the system does not not desired oflife or big financial | fail, Late results are damage. merely discarded. 5. | Time bound usually Associated _ time! Time bounds range from several | bound typically range | associated are microseconds toa few | from a few expressed as milliseconds. milliseconds to absolute values. several hundreds of milliseconds, 6 cae For example : | For example : Video conferencing | Web browsingIntroductio, reduction 34 (CSTT-8) C ee fer Q. 1.15, Page 26C, Unit-1. Timing constraints : Que 1.19. | Write the difference between real time system and othe, UPTU 2012-13, systems. Answer lL. Differences between real time sys systems: tems and time sharing Real time systems | Time sharing systems This system works for the same 1 | Real time systems works or less time on each process. __under fixed time constraints. 2 | This eystem uses priority | This system uses FCFS (First scheduling. Come First Served) but do not | complete a process at once, but a portion of it. Users ean share resources. Resources remain dedicated | for auser for a fixed amount of time and can be reassigned to another user after that | time. 4 | Example: Real time systems | Example : Time sharing systems | are required in airlines ticket | are required in online file systems. | | booking systems. 2 Difference between distributed systems and real time system : a Adistributed OS provides the essential services and functionality required of an OS, adding attributes and particular configurations to allow it to support additional requirements such as increased scale and availability. b. Toauser, adistributed OS works in a manner similar to a single- node, monolithic operating system. That is, although it consists of multiple nodes, it appears to users and applications as @ single- node. c. Separating minimal system-level functionality from additional user- level modular services provides a "separation of mechanism and policy." 4. Mechanism and policy can be simply interpreted as “how something is done” versus "why something is done," respectively. This separation increases flexibility and scalability. e. Areal time operating system (RTOS) is an operating system (OS) intended to serve real time application process data as it comes in, typically without buffering delays. Processing time requirements35 (CSAT-8) C Real Time System i is or (including any OS delay) are measured in tenths of seconds shorter. sone fA key characteristic of an RTOS is the level of its a zney concerning the amount of time it takes to accept and complete application's task; the variability is jitter: 3. Real time OS differ from general-purpose OS: a. Setting priorities: i. When programming an application, most operating systems (of any type) allow the programmer to specify a priority for the overall application and even for different tasks within the application (threads) ii, These priorities serve as a signal to the OS, dictating which operations the designer feels are most important. iii, The goal is that if two or more tasks are ready to run at the same time, the OS will run the task with the higher priority. iv. In practice, general-purpose operating systems do not always follow these programmed priorities strictly. v. Because general-purpose operating systems are optimized to run a variety of applications and processes simultaneously, they typically work to make sure that all tasks receive at least some processing time. vi. As a result, low-priority tasks may in some cases have their priority boosted above other higher priority tasks. vii, This ensures some amount of run time for each task, but means that the designer's wishes are not always followed. vii. In contrast, real time operating systems follow the Programmer's priorities much more strictly. ix. On most real time operating systems, if a high priority task is using 100% of the processor, no other lower priority tasks will run until the high priority task finishes. x. Therefore, real time system designers must program their applications carefully with priorities in mind. xi. Ina typical real time application, a designer will place time- critical code (example, event response or control code) in one section with a very high priority. xii. Other less-important code such as logging to disk or network communication may be combined in a section with a lower Priority. b. Interrupt latency : i. Interrupt latency is measured as the amount of time between when a device generates an interrupt and when that device is serviced.Introduction 36 (CSIT-8) C ii. While general-purpose operating systems may take a variable amount of time to respond to a given interrupt, real time operating systems must guarantee that all interrupts will be in maximum amount of time. serviced within a certail iii In other words, the interrupt latency of real time operating systems must be bounded c. Performance: at real time operating systems i. One common misconceptionis t! have better performance than other general-purpose operating systems. ii, While real time operating systems performance in some cases duc to less mu applications and services, thisis not arule. ¢ will depend on CPU speed, may provide better Ititasking between iii, Actual application performanc memory architecture, program characteristics, and more. iv. Though real time operating systems may or may not increase the speed of execution, they can provide much more precise and predictable timing characteristics than general-purpose operating systems. Que 1.20. | Explain reference model of real time systems. Answer 1. Agood model abstracts the irrelevant details of real time application like system resources (for example, whether the processor is by Intel or Motorola or whether the transmission medium is cable or fiber). 2, A good model allows us to focus on the timing properties and resource requirements of system components and the way the operating system allocates the available system resources among them. 3. By focusing the relevant characteristics of the system, we can get better timing behaviour of each component and the overall system. 4. One of the model of real time systems 1s reference model. According to this model, each eystem is characterized by three elements : a. Aworkload model that describes the applications supported by the system. b. Aresource model that describes the system resi the applications ©. Algorithms that define how the application system uses the resources at all times ources available to 5, This model has a set of features in terms of which we can describe the lications and the properties of relevant characteristics of real time app! the underlying platform.37 (CST-8) C Real Time System a emulate the 6. Through this model, we can analyze, simulate and even system based on its description. Elements of the reference model : a. Processors and resources b. Temporal parameters of real time workload c. Periodic task model d. Precedence constraint and data dependency Que 1.21. | Explain the term processors and resources in context of real time systems. Answer All the system resources are divided into two major types : processors and resources. 1. Processors : a. Processors are often called servers and active resources. b. Computers, transmission links, disks and database server are examples of processors. ¢. They carry out machine instructions, move data from one place to another, retrieve files, process queries and so on. d. Every job must have one or more Processors in order to execute and make progress toward completion. ‘Types of processors : a, Two processors are of the same type if they are functionally identical and can be used interchangeably. Hence, two transmission links with the same transmission rate between a pair of sender and receiver are processors of the same type. b. Processors that are functionally different, or for some other reason cannot be used interchangeably, are of different types. CPUs, transmission links and disks are of different types because they are functionally different. To denote processor(s), letter P is used. For ™ Processors in the system, we use Py, P),...., Pry 2 Resources: a. These are called passi urces. For example, resources are memory, sequence numbers, mut. \d database locks. b. Ajob may need some resources in addition to the processor in order to make progress. One of the attributes of a processor is its speed d. For example, we usually model transactions that query and update "_ adatabase as jobs; these jobs execute on a database server88 (CSIT-8) C a Introduction , rt 8 ‘king mechanism to ensure data tabase server uses & oc! . ee then a transaction also needs the lockson the data objects it reads or writes in order to p! The locks on the data objects are resources note resources. roceed, Letter R is used to de es are reusable if they are not i Ifthe system contains p resources means that there are p types of serially reusable resources, each resource may have one or more 7 tually exclusive manner. units and each unit is used in a mu J. Aresource is plentiful if'no job is ever prevented from execution by the lack of this resource k. Aresource that can be shared by a! not be explicitly modeled and hence never appears ras onsumed during us The resource B Use. n infinite number of jobs need in this model, PART-3 Temporal Parameters of Real Time Workload, Periodic Task Model, Precedence Constraints and Data Dependency. CONCEPT OUTLINE: PART-3 + Temporal parameters of real time workload : The workload on processors consists of jobs, each of which is a unit of work to be allocated processor time and other resources. * Execution time : Another temporal parameter of a job,J,, is its execution time i.e., the amount of time required to complete the execution of J, when it executes alone and has all the resources. * The jobs are said to have precedence constraints if they are constrained to execute in some order. * If the jobs can execute in any order, they are said to be independent. Questions-Answers Long Answer Type and Medium Answer Type Questions Que 1.22. ] What is the use of temporal parameters of real time workload in reference model ? OR What are the parameters of real time workload ? Explain in brief. UPTU 2012-13,Real Time System 39 (CS/IT-8) C ae) Use of temporal parameters of real time workload : 1 10. ll. i tof ‘The workload on processors consists of jobs, each of which is a unit work to be allocated processor time and other resources. - Aset of related jobs that execute to support a function of the system is called a task. Many parameters of hard real time jobs and tasks are known at all times otherwise, it would not be possible to ensure that the system meet its hard real time requirements. The number of tasks (or jobs) in the system is one such parameter. The number of tasks may change when the system operation mode changes and the number of tasks in the new mode is also known. Moreover, these numbers are known a priori before the system begins execution. For example, in flight control system, during cruise mode, the system has 12 tasks. Ifthe system triply replicates all control law computations during landing, the number of tasks increases to 24 when it operates in the landing mode. Each job Jj, is characterized by its temporal parameters, functional parameters, resource parameters and interconnection parameters. Its temporal parameters tell us its timing constraints and behaviour. Release time, absolute deadline and relative deadline of a job J, are temporal parameters. Parameters of real time workload : A Execution time: 1. It is the amount of time required to complete the execution of J, when it executes alone and has all the resources it requires. 2. Hence, the value of this parameter depends mainly on the complexity of the job and the speed of the processor used to execute the job, not on how the job is scheduled 3. Execution time is represented by e,. ‘The actual amount of time required by a job to complete its execution may vary for many reasons. 5. Forexample, a computation may contain conditional branches and these conditional branches may take different amounts of time to complete. 6. Ifthe underlying system has performance enhancing features (for example, cache memory and Pipeline), the amount of time a computation takes to complete may vary each time it executes even when it has no conditional branches.wocsaTyC 10. 0 1. 4 16. 16. i" B, Fixed, jittered and sporadic release time L 2 al execution time of computation jo ig For these reasons, the actua unknown uni it completes J is in the range le] wherg The execution time ¢, of the job ‘ ration time and the maximum, fe -and e,* are the minimum exec ‘execution time of J, respectively. ‘The maximum execution time ofeach jobis adequate to determing whether each ob can always complete by its deadline or not For this reason, in most deterministic models used to charactering hardreal time applications the term execution time eof each ob specifically means its maximum exeeution time ( ‘There are two good reasons for the common use of the determinate approach, Many hard real time systems are safety-critical, These systems are typically designed and implemented in such away thatthe variationg injob execution times are kept as small as possible. ‘The need to have relatively deterministic exeeution times places ‘many restrictions on implementation choices ‘By working with these restrictions and making the execution times ‘of jobs almost deterministic, the designer can model more accurately ‘the application system deterministicaly. ‘The other reason forthe common use ofthe deterministic approach is that hard realtime portion ofthe system is often small ‘The timing requirements of the rest ofthe system are soft. ‘An option isto design the hard real time subsystem based on its ‘worst case processor time and resource requirements even though, their actual requirement may be much smaller Then we can use the methods and tools supported by the deterministic models to ensure that the hard timing constraints will surely be met at all times In many aystems, we do not know exactly when each job will be released In other words, we do not know the actual release time r, of each jobJonly that ris ina range Ir, "J, can be as early as the earliest release time r; ands late asthe latest release time Indeed, some midels assume that only the range of, is known and, call this range the jitter in, oF release-thme jitter. Sometimes the jitter is negligibly small as compared with the values of other temporal parameters. Almost every real time system is required to respond to external ‘events which oceur at random instants of time. | Real Time System - 8 41 (C88) C Whon auch an event occurs, the system executes 4 set of obe in response, The release times of these jobs are not known until th triggering in them occurs ‘These joba are called sporadic jobs or aperiodic johs bes ‘are released at random time instants. cause they aes] Discus the factors that are tobe analyzed for extimatings execution time for real time system. “Answer Refer Q, 1.22, Page 38C, Unit-1 Quo 124, | How do pipelining and interrupts affect execution time UPTU 2015-14, Marks 05 estimation ? ‘Answer Analysis of source code : 1. Let us begin by considering a very si imple stretch of code, 2 This isstraight-line code. 3. Once control is transferred to the first of these statements, execution will continue sequentially until the last statement has been completed. 4, Straight-line code is thus a stretch of code with exactly one entry point and exactly one exit point, Let us consider how to make a timing estimate for this stretch of code ‘The total execution time is given by, 3 Dod 24.) where 7,,,{Li is time needed to execute Li 1. The time needed to execute L1 will depend on the code that the compiler generates for it. For example, L1 could be translated into the following sequence Lt Ll Li Li Li Lh 1Get the address of ¢ 2Loade 3Get the address of b 4 Load b 5 Multiply 6 Store into a