REAL-TIME SYSTEMS DESIGN AND ANALYSIS phần 10 potx

GLOSSARY 453 drive line In core memory, a wire used to induce a magnetic field in a toroid- shaped magnet. The orientation of the field represents either a 1 or a 0. DSI Delivered source instructions. See KLOC. dynamic memory Memory that uses a capacitor to store logic 1s and 0s, and that must be refreshed periodically to restore the charge lost due to capaci- tive discharge. dynamic priority system A system in which the priorities to tasks can change. Contrast with fixed priority system. Dynamic Systems Development Method (DSDM) A lightweight program- ming methodology conceived as a methodology for rapid application devel- opment, DSDM relies on a set of principles that include empowered teams, frequent deliverables, incremental development, and integrated testing. effort One of Halstead’s metrics (see Chapter 8). embedded software Software that is part of an embedded system. embedded system A computing machine contained in a device whose purpose is not to be a computer. For example, the computers in automobiles and house- hold appliances are embedded computers. Embedded computers use embed- ded software, which integrates an operating system with specific drivers and application software. Their design often requires special software–hardware codesign methods for speed, low power, low cost, high testability, or other special requirements. emulator (1) The firmware that simulates a given machine architecture. (2) A device, computer program, or system that accepts the same inputs and produces the same outputs as a given system. enabled state In a data flow architecture when all necessary tokens have arrived and the input lines are full. Also called the ready state. encapsulation Property of a program that describes the complete integration of data with legal process relating to the data. entity relationship diagram A diagram that describes the important entities in a system and the ways in which they are interrelated. enumeration A list of permitted values. environment A set of objects outside the system, a change in whose attributes affects, and is affected by, the behavior of the system. event Any occurrence that results in a change in the state of a system. event determinism When the next states and outputs of the system are known for each set of inputs that trigger events. event flag Synchronization mechanism provided by certain languages. exception Error or other special condition that arises during program execution. exception handler Code used to process exceptions. execute Process of sequencing through the steps in micromemory correspond- ing to a particular macroinstruction. executing state In the task-control block model, a task that is currently running. executive See kernel. 454 GLOSSARY external fragmentation When main memory becomes checkered with unused but available partitions, as in Figure 3.22. eXtreme Programming (XP) A lightweight programming methodology based on twelve practices including pair programming (all code developed jointly by two developers), test first coding, having the customer on site, and frequent refactoring. eXtreme programming is, perhaps, the most prescriptive of the lightweight methodologies. Also written “Extreme programming”. failed system A system that cannot satisfy one or more of the requirements listed in the formal system specification. failure Manifestation of an error at system level. It relates to execution of wrong actions, nonexecution of correct actions, performance degradation, and so on as. failure function A function describing the probability that a system fails at time t. fault The appearance of a defect during the operation of a software system. fault prevention Any technique or process that attempts to eliminate the pos- sibility of having a failure occur in a hardware device or software routine. fault tolerance Correct execution of a specified function in a system, provided by redundancy, despite faults. The redundancy provides the information needed to negate the effects of faults. feature-driven development A lightweight model-driven, short-iteration pro- cess built around the feature, a unit of work that has meaning for the client and developer and is small enough to be completed quickly. fetch The process of retrieving a macroinstruction from main memory and placing it in the instruction register. fetch–execute cycle The process of continuously fetching and executing macro- instructions from main memory. file fragmentation Analogous to memory fragmentation, but occurring within files, with the same associated problems. finite state automaton (FSA) See finite state machine. finite state machine (FSM) A mathematical model of a machine consisting of a set of inputs, a set of states, and a transition function that describes the next state given the current state and an input. Also known as finite state automaton and state transition diagram. firing In Petri nets or in certain multiprocessor architectures, when a process performs its prescribed function. firm real-time system A real-time system that can fail to meet one or more deadlines without system failure. fixed priority system A system in which the task priorities cannot be changed. Contrast with dynamic priority system. fixed-rate system A system in which interrupts occur only at fixed rates. flip-flop A bistable logic device. floating-point number A term describing the computer’s representation of a real number. GLOSSARY 455 flowchart A traditional graphic representation of an algorithm or a program, in using named functional blocks (rectangles), decision evaluators (diamonds), and I/O symbols (paper, disk) interconnected by directional arrows that indicate the flow of processing. Syn: flow diagram. flush In pipelined architectures, the act of emptying the pipeline when branch- ing occurs. foreground A collection of interrupt driven or real-time processes. formal parameter The dummy variable used in the description of a procedure or subroutine. forward error recovery A technique (also called roll-forward) of continuing processing by skipping faulty states (applicable to some real-time systems in which occasional missed or wrong responses are tolerable). framework A skeletal structure of a program that requires further elaboration. FSA Finite state automaton. See finite state machine. FSM See finite state machine. function points A widely used metric set in nonembedded environments; they form the basis of many commercial software analysis packages. Function points measure the number of interfaces between modules and subsystems in pro- grams or systems. function test A check for correct device operation generally by truth table verification. functional decomposition The division of processes into modules. functional requirements Those system features that can be directly tested by executing the program. garbage An object or a set of objects that can no longer be accessed, typi- cally because all pointers that direct accesses to the object or set have been eliminated. garbage collector A software run-time system component that periodically scans dynamically allocated storage and reclaims allocated storage that is no longer in use (garbage). general polynomial The modulo-2 divisor of the message polynomial in CRC. general register CPU internal memory that is addressable in the address field of certain macroinstructions. general semaphore See counting semaphore. generalization The relationship between a class and one or more variations of that class. global variable Any variables that is within the scope of all modules of the software system. group walkthrough A kind of white-box testing in which a number of persons inspect the code line-by-line with the unit author. Hamming code A coding technique used to detect and correct errors in com- puter memory. 456 GLOSSARY hard error Physical damage to memory cell. hard real-time system A real-time system in which missing even one deadline results in system failure. hazard A momentary output error that occurs in a logic circuit because of input signal propagation along different delay paths in the circuit. heterogeneous Having dissimilar components in a system; in the context of computers, having different types or classes of machines in a multiprocessor or multicomputer system. host A computer that is the one responsible for performing a certain computa- tion or function. hybrid system A system in which interrupts occur both at fixed frequencies and sporadically. hypercube processors A processor configuration that is similar to the linear array processor, except that each processor element communicates data along a number of other higher dimensional pathways. ICE See in-circuit emulator. immediate mode instruction An instruction in which the operand is an integer. implied mode instruction An instruction involving one or more specific mem- ory locations or registers that are implicitly defined in the operation performed by instruction. imprecise computation Techniques involving early termination of a computa- tion in order to meet deadlines. Sometimes called approximate reasoning. in-circuit emulator (ICE) A device that replaces the processor and provides the functions of the processor plus testing and debugging functions. incrementality A software approach in which progressively larger increments of the desired product are developed. indirect mode instruction Instruction where the operand field is a memory location containing the address of the address of the operand. induction variable A variable in a loop that is incremented or decremented by some constant. information hiding A program design principle that makes available to a func- tion only the data it needs. inheritance In object orientation, the possibility for different data types to share the same code. initialize (1) To place a hardware system in a known state, for example, at power-up. (2) To store the correct beginning data in a data item, for example, filling an array with zero values before it is used. in-line patch A patch that fits into the memory space allocated to the code to the changed. input space The set of all possible input combinations to a system. instance An occurrence of a class. instruction issue The sending of an instruction to functional units for execution. GLOSSARY 457 instruction register CPU internal register that holds the instruction pointed to by the contents of the program counter. instruction set The instruction set of a processor is the collection of all the machine language instructions available to the programmer. Also known as instruction repertoire. integration The process of uniting modules from different sources to form the overall system. internal fragmentation Condition that occurs in fixed-partition schemes when, for example, a processor requires 1 kilobyte of memory, while only the 2-kilobyte partitions are available. interoperability Software quality that refers to the ability of the software sys- tem to coexist and cooperate with other systems. interpreter A computer program that translates and immediately performs in- tended operations of the source statements of a high-level language program. interrupt An input to a processor that signals the occurrence of an asyn- chronous event. The processor’s response to an interrupt is to save the current machine state and execute a predefined subprogram. The subprogram restores the machine state on exit and the processor continues in the original program. interrupt controller A device that provides additional interrupt handling capa- bility to a CPU. interrupt handler A predefined subprogram that is executed when an interrupt occurs. The handler can perform input or output, save data, update pointers, or notify other processes of the event. The handler must return to the interrupted program with the machine state unchanged. interrupt handler location Memory location containing the starting address of an interrupt handler routine. The program counter is automatically loaded with its address when an interrupt occurs. interrupt latency The delay between when an interrupt occurs and when the CPU begins reacting to it. interrupt register Register containing a big map of all pending (latched) inter- rupts. interrupt return location Memory location where the contents of the program counter is saved when the CPU processes an interrupt. interrupt vector Register that contains the identity of the highest-priority inter- rupt request. intrinsic function A macro where the actual function calls is replaced by in-line code. Jackson Chart A form of structure chart that provides for conditional branching. Kalman filter A mathematical construct used to combine measurements of the same quantity from different sources. KDSI See KLOC kernel The smallest portion of the operating system that provides for task scheduling, dispatching, and inertia communication. 458 GLOSSARY kernel preemption A method used in real-time UNIX that provides preemption points in calls to kernel functions to allow them to be interrupts. key In a mailbox, the data that are passed as a flag used to protect a critical region. KLOC A software metric measuring thousands of lines of code (not count- ing comments and nonexecutable statements). Called the “clock” metric. Also known as thousands of delivered source instructions (KDSI) and noncom- mented source-code statements (NCSS). least recently used rule (LRU) The best nonpredictive page-replacement algorithm. legacy system Applications that are in a maintenance phase but are not ready for retirement. leveling In data flow diagrams, the process of redrawing a diagram at a finer level of detail. library A set of precompiled routines that may be linked with a program at compile time or loaded at load time or dynamically at run time. lightweight programming methodology Any programming methodology that is adaptive rather than predictive and emphasizes people rather than process. Same as agile programming. linear array processor A processor organized so that multiple instructions of the same type can be executed in parallel. link The portion of the compilation process in which separate modules are placed together and cross-module references resolved. linker A computer program that takes one or more object files, assembles them into blocks that are to fit into particular regions in memory, and resolves all external (and possibly internal) references to other segments of a program and to libraries of precompiled program units. Little’s law Rule from queuing theory stating that the average number of cus- tomers in a queuing system, N av , is equal to the average arrival rate of the customers to that system, r av , times the average time spent in that system, t av . live variable A variable that can be used subsequently in the program. livelock Another term for process starvation. load module Code that can be readily loaded into the machine. locality-of-reference The notion that if you examine a list of recently exe- cuted program instructions on a logic analyzer, you will see that most of the instructions are localized to within a small number of instructions. lock-up When a system enters a state in which it is rendered ineffective. logic analyzer A machine that can be used to send signals to, and read output signals from, individual chips, circuit boards, or systems. logical operation The machine-level instruction that performs Boolean opera- tions such as AND, OR,andCOMPLEMENT. look-up table An integer arithmetic technique that uses tables and relies on mathematical definition of the derivative to compute functions quickly. loop invariant optimization The process of placing computations outside a loop that do not need to be performed within the loop. GLOSSARY 459 loop invariant removal An optimization technique that involves removing code that does not change inside a looping sequence. loop jamming An optimization technique that involves combining two loops within the control of one loop variable. loop unrolling An optimization technique that involves expanding a loop so that loop overhead is removed. loosely coupled system A system that can run on other hardware with the rewrite of certain modes. LRU See least recently used rule. machine code The machine format of a compiled executable, in which indi- vidual instructions are represented in binary notation. machine language The set of legal instructions to a machine’s processor, expressed in binary notation. macro See macroinstruction. macroinstruction A native machine instruction. macroprogram A sequence of macroinstructions. mailbox An intertask communication device consisting of a memory location and two operations – post and pend – that can be performed on it. main memory Memory that is directly addressable by the CPU. maintainability A software quality that is a measure of how easy the system can be evolved to accommodate new features, or changed to repair errors. maintenance The changes made on a system to fix errors, to support new requirements, or to make it more efficient. major cycle The largest sequence of repeating processes in cyclic or periodic systems. MAR See memory address register. mask register A register that contains a bit map either enabling or disabling specific interrupts. master processor The on-line processor in a master/slave configuration. MDR See memory data register. Mealy finite state machine A finite state machine with outputs. memory address register (MAR) Register that holds the address of the mem- orylocationtobeactedon. memory caching A technique in which frequently used segments of main mem- ory are stored in a faster bank of memory that is local to the CPU (called a cache). memory data register (MDR) Register that holds the data to be written to or that is read from the memory location held in the MAR. memory-loading The percentage of usable memory that is being used. memory locking In a real-time system, the process of locking all or certain parts of a process into memory to reduce the overhead involved in paging, and thus make the execution times more predictable. 460 GLOSSARY memory-mapped I/O An input/output scheme where reading or writing invol- ves executing a load or store instruction on a pseudomemory address mapped to the device. Contrast with DMA and programmed I/O. memory reference instruction An instruction that communicates with virtual memory, writing to it (store) or reading from it (load). mesh processor A processor configuration that is similar to the linear array processor, except that each processor element also communicates data north and south. message exchange See mailbox. message-passing system A multiprocessor system that uses messages passed among the processors to coordinate and synchronize the activities in the processors. message polynomial Used in CRC. metadata Data that describes other data. methods In object-oriented systems, functions that can be performed on objects. microcode A collection of low-level operations that are executed as a result of a single macro instruction being executed. microcontroller A computer system that is programmable via microcode. microinstructions See microcode. microkernel A nanokernel that also provides for task scheduling. micromemory CPU internal memory that holds the binary codes corresponding to macroinstructions. microprogram Sequence of microcode stored in micromemory. MIMD See multiple instruction stream, multiple data stream. minimal representation For a positive Boolean function an equivalent repre- sentation where no product whose variable set does not contain the variable set of a distinct products can be deleted without changing the function. minor cycle A sequence of repeating processes in cyclic or periodic systems. minterm In disjunctive normal form, a logical sum of products or conjunctions of Boolean variables is taken. These products are the minterms. MISD See multiple instruction stream, single-data stream. mixed listing A printout that combines the high-order language instruction with the equivalent assembly language code. mixed system A system in which interrupts occur both at fixed frequencies and sporadically. modularity Design principle that calls for design of small, self-contained code units. Moore finite state machine See finite state machine. multiple instruction stream, single data stream (MISD) A computer that can process two or more instructions concurrently on a single datum. multiple instruction stream, multiple data stream (MIMD) A computer char- acterized by a large number of processing elements, each capable of executing numerous instructions. GLOSSARY 461 multiplexer A device used to route multiple lines onto fewer lines. multiprocessing operating system An operating system where more than one processor is available to provide for simultaneity. Contrast with multitasking operating system. multiprocessor A computer system that has more than one internal processor capable of operating collectively on a computation. Normally associated with those systems where the processors can access a common main memory. multitasking operating system An operating system that provides sufficient functionality to allow multiple programs to run on a single processor so that the illusion of simultaneity is created. Contrast with multiprocessing operat- ing system. mutex A common name for a semaphore variable. MUX See multiplexer. nanokernel Code that provides simple thread-of-execution (same as “flow- of-control”) management; essentially provides only one of the three services provided by a kernel, that is, it provides for task dispatching. NCSS Noncommented source statements. See KLOC. nested subroutine A subroutine called by another subroutine. The program- ming technique of a subroutine calling another subroutine is called nesting. nonfunctional requirements System requirements that cannot be tested easily by program execution. nonvolatile memory Memory whose contents are preserved upon removing power. non–von Neumann architecture An architecture that does not use the stored- program series fetch–execute cycle. no-op A macroinstruction that does not change the state of the computer. NP-complete problem A decision problem that is a seemingly intractable prob- lem for which the only known solutions are exponential functions of the problem size and which can be transformed to all other NP-complete problems; compare with NP-hard. NP-hard A decision problem that is similar to an NP-complete problem (except that for the NP-hard problem it cannot be shown to be transformable to all other NP-complete problems). N-version programming A technique used to reduce the likelihood of system lock-up by using redundant processors, each running software that has been coded to the same specifications by different teams. nucleus See kernel. null A special value denoting that an attribute value is unknown or not appli- cable. object An instance of a class definition. object code A file comprising an intermediate description of a program segment. object-oriented The organization of software into discrete objects that encap- sulate both data structure and behavior. 462 GLOSSARY object-oriented analysis A method of analysis that estimates requirements from the perspective of the classes and objects found in the problem domain. object-oriented design A design methodology viewing a system as a collection of objects with messages passed from object to object. object-oriented language A language that provides constructs that encourage a high degree of information hiding and data abstraction. object-oriented methodology An application development methodology that uses a top-down approach based on the decomposition of a system in a col- lection of objects communicating via messages. object-oriented programming A programming style using languages that sup- port abstract data types, inheritance, function polymorphism, and messaging. object type The type of an object determines the set of allowable operations that can be performed on the object. This information can be encoded in a “tag” associated with the object, can be found along an access path reaching to the object, or can be determined by the compiler that inserts “correct” instructions to manipulate the object in a manner consistent with its type. opcode Starting address of the microcode program stored in micromemory. open source code Source code that is made available to the user community for moderate improvement and correction. open system An extensible collection of independently written applications that cooperate to function as an integrated system. operating system A set of programs that manages the operations of a computer. It oversees the interaction between the hardware and the software and provides a set of services to system users. operation Specification of one or a set of computations on the specified source operands placing the results in the specified destination operands. organic system A system that is not embedded. orthogonal product In statecharts, a process that depicts concurrent processes that run in isolation. output dependency The situation when two sequential instructions in a pro- gram write to the same location. To obtain the desired result, the second instruction must write to the location after the first instruction. output space The set of all possible output combinations for a system. overlay Dependent code and data sections used in overlaying. overlaying A technique that allows a single program to be larger than the allowable user space. overloading Principle according to which operations bearing the same name apply to arguments of different data type. oversized patch A patch that requires more memory than is currently occupied by the code to be replaced. page Fixed-size chunk used in demand-paged systems. page fault An exception that occurs when a memory reference is made to a location within a page not loaded in main memory. [...]... [Burns90] Burns, A and Wellings, A Real-time Systems and Their Programming Languages Addison-Wesley, New York, 1990 [Buttazzo00] Buttazzo, G Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications Kluwer Academic Publishers, Norwell, MA, 2000 [Calvez93] Calvez, J P., Wyche, A., and Edmundson, C (Translators) Embedded Real-Time Systems/ a Specification and Design Methodology... Science, Engineering and Technology, CRC Press, Boca Raton, FL, 2001 [Laplante00] Laplante, P A (Editor) A Practical Approach to Real-Time Systems IEEE Press, Piscataway, NJ, 2000 [Laplante97] Laplante, P Real-Time Systems Design and Analysis: An Engineer’s Handbook, Second Edition IEEE Press, New York, 1997 [Laplante96a] Laplante, P., Stoyenko, A., and Sinha, D Image Processing Methods: Real-Time Imaging,... “Scheduling Theory and Ada 9X.” Embedded Systems Programming December 1994, December pp 32–52 [Boehm81] Boehm, B Software Engineering Economics Prentice Hall, Englewood Cliffs, NJ, 1981 Real-Time Systems Design and Analysis, By Phillip A Laplante ISBN 0-471-22855-9  2004 Institute of Electrical and Electronics Engineers 475 476 BIBLIOGRAPHY [Bollella00a] Bollella, G., and Gosling, J “The Real-Time Specification... Embedded Systems Conference, San Jose, CA, September 1999 [Stimler69] Stimler, S Real-Time Data-Processing Systems McGraw-Hill, New York, 1969 [Stoyenko96] Stoyenko, A., Marlowe, T., and Laplante, P A “A Description Language for Engineering of Complex Real-Time Systems. ” Real-Time Systems Journal, Volume 11, Number 3, November 1996, pp 223–244 [Stoyenko92] Stoyenko, A D “Evolution and State-of-the-Art of Real-Time. .. [Kopetz97] Kopetz, H Real-Time Systems Design Principles for Distributed Applications Kluwer Academic Press, Norwell, MA, 1997 [Krishna93] Krishna, C., and Singh, A “Reliability of Checkpointed Real-Time Systems Using Time Redundancy.” IEEE Transaction on Reliability, Volume 42, Number 3, September 1993, pp 427–435 [Krishna91] Krishna, C M., and Lee, Y H “Guest Editor’s Introduction: Real-Time Systems. ” IEEE... A., and Stoyenko, A (Editors), Real-Time Image Processing: Theory, Techniques, and Applications IEEE Press, New York, 1996 [Laplante95] Laplante, P A Funck-Rose, E., and Garcia-Watson, M “An Historical Overview of Early Real-Time System Developments in the U.S.” Real-Time Systems Journal, Volume 8, Number 3/4, January 1995, pp 199–214 [Laplante93] Laplante, P A “Fault-Tolerant Control of Real-Time Systems. .. J., and Laplante, P A “A Real-Time Systems Context for the Framework for Information Systems Architecture.” IBM Systems Journal, Volume 34, Number 1, January 1995 pp 20–38 [Selby87] Selby, R W., Basili, V R., and Baker, F T “Cleanroom Software Development: An Empirical Evaluation.” IEEE Transactions on Software Engineering, Volume SE-13, Number 9, September 1987, pp 102 7 103 7 [Selic98] Selic, B., and. .. Stankovic, J A., Spuri, M., DiNatale, M., and Buttazzo, G “Implications of Classical Scheduling Results for Real-Time Systems. ” IEEE Computer, Volume28, Number 6, June 1995, pp 16–25 [Stankovic93] Stankovic, J A., and Ramamritham, K Advances in Real-Time Systems, IEEE Computer Society Press, Los Alamitos, CA, 1993 [Stankovic88] Stankovic, J., and Ramamritham, K Hard Real-Time systems – A Tutorial Computer Science... Steele, R., and Backes, P “Ada and Real-Time Robotics: Lessons Learned.” IEEE Computer, Volume 27, Number 4, April 1994, pp 49–54 [Steininger91] Steininger, A., and H Schweinzer “Can the Advantages of RISC be Utlized in Real-Time Systems? ” Proceedings of the Euromicro ’91 Workshop on Real-Time Systems, Paris, September 1991, pp 30–35 [Stewart99] Stewart, D B “Twenty-Five Most Common Mistakes with Real-Time. .. J., Harper, R., and Alger, L “A Design Approach for Ultrareliable Real-Time Systems. ” IEEE Computer, Volume 24, Number 5, May 1991, pp 12–22 480 BIBLIOGRAPHY [Laplante04] Laplante, Phillip A., “Criteria and an Objective Approach to Selecting Real-Time Operating Systems Based on Published Information,” to appear, Journal of Computers and Applications, 2004 [Laplante03a] Laplante, P A., and Neill, C J . three essential phases in any systems engineering life cycle: formulation of requirements and specifications, design and develop- ment of the system or product, and deployment of the system. Each. measuring thousands of lines of code (not count- ing comments and nonexecutable statements). Called the “clock” metric. Also known as thousands of delivered source instructions (KDSI) and noncom- mented. signals to, and read output signals from, individual chips, circuit boards, or systems. logical operation The machine-level instruction that performs Boolean opera- tions such as AND, OR,andCOMPLEMENT. look-up