You are on page 1of 34

ary Gloss

Accept operation. Operation on a mailbox that is similar to the pend operation, except that if no clataare available, the task retums immediately from the call with a condition code rather than susPending. Access time. The interval between when data are requestedfrom the memory cell and when they are actually available. Accumulator. An anonymous register used in certain computer instructions. Activity packet. A special token passed between the processors in a dataflow architecture. Each token contains an opcode, operand count, operands,and a list of for destination addresses the result of the computation. parameter. The named variable passedto a procedure or subroutine. Actual Address bus. The collection of wires neededto accessindividual memory addresses' Alpha testing. software. ALU. A type ofvalidation consisting ofinternal distribution and exerciseofthe

See arithmetic logic unit' Anatog-to-digital conversion. The processof convertingcontinuous(analog; signals into discrete (digital) ones. Anonymous variable. A hidden variable createdby the compiler to facilitate call-byvalue parameterpassing. Application programs" Programs users write to solve specific problems. Arithmetic logic unit. operations. The CPU intemal device that performs arithmetic and logical

Assemblers. Software that translatesassemblylanguage to machine code. Assembly language. The set of symbolic equivalents to the macroinstruction set. 327


I Glossary Associative memory. Memory organizedso that it can be searchedaccordingto its contents. Asynchronous event. An event that is not synchronous. Atomic instruction. An instructionthat cannotbe intenupted.

systems. in Background. Non-interruptdriven processes foreground/background BAM. See binary angularmeasurement. used to preventdeadlocksituations. Banker's algorithm. A techniquesometimes most that in hardwarecomponents Bathtub curve. A graphdescribingthe phenomenon believe errorsoccur either very early or very late in the life of the component.Some that it is applicableto software. rule, increasing that in the FIFO pagereplacement Belady's Anomaly. The observation the number of pagesin memory may not reducethe number of page faults. of Beta testing. A type of systemtestwherepreliminaryversions validatedsoftwareare under actual use. distributedto friendly customerswho test the software Binary angular measurement. An n-bit scalednumber where the least significantbit is 2"-' .180. that can take on one of two values. Binary semaphore. A semaphore Binary tree. A collectionof n nodes,one of which is a specialone calledthe root. The remaining n - 1 nodesform at most two subtrees. Black box testing. A testingmethodologywhereonly the inputs and outputsof the unit inside the unit is ignored. How the outputsare generated are considered. of by Blocked. The condition experienced tasksthat are waiting for the occurrence an event. a Broadcast communication. In statecharts, techniquethat allows for transitionsto occur in more than one orthogonalsystemsimultaneously. Buffer. A temporary data storage area used to interface between, for example, a fa^st device and a slower processservicingthat device. early in the life to Burn-in testing. Testingthat seeks flush out thosefailuresthat appear of the part and thus improve the reliability of the delivered product. The time over which data are being passedinto a buffer. Bus arbitration. The processof ensuringthat only one device at a time can place data on the bus. Bus contention. Condition in which two or more devicesattemptto gain control of the - -main memory bus simultaneously. Burst period. Bus cycle. Memory fetch. Bus grant. A signal provided by the DMA controller to a device indicating that it has exclusiverights to the bus. Bus time-out. A condition whereby a device making a DMA requestdoes not receive a bus grant before some specifiedtime. the Busy wait. In polled loop systems, processof testing the flag without success.

I Glossary


Call-by-address. See call-by-reference. Call-by-reference. The processin which the address the parameter passed the of is by calling routine to the called procedureso that it can be alteredthere. Call-by-value. Parameter passingmethodin which the value of the actualparamerer in the subroutineor function call is copied into the procedure's formal parameter. Calling trees. See structurechart. CASE. Computer-aded softwareengineering. Catastrophic error. CCR An error that rendersthe svstemuseless. See condition code register.

Cellular automata. A computationalparadigm for an efficient descriptionof SIMD massivelyparallel systems. Chain reaction. In statecharts, group of sequentialevents where the nth event is a triggeredby the (n - l)th event. 'Code Checkpoints. that outputs intermediateresults to allow an external Drocessto monitor the efficacy of the processin questronChecksum. A simple binary addition of all program code memory locationsused ro verify the contents. Circular queu€. See ring buffer. Seecomplexinstruction computer. set Class definitions. Object declarations along with the methodsassociated with thern. Clear box testing. See white box testing. Code inspection. See group walkthrough. Collision. Condition in which a device already has control of the bus and another obtainsaccess. Also, simultaneous use of a critical resource. C-ompaction. The processof compressing fragmentedmemory so that it is no lon-eer fragmented. Also called coalescing. Softwarerhat translares high-orderlanguageprogramsinto assembll,code Complex instruction set computers. Architecturescharacterized a larse. coded instruetionset with numerousaddressing modes. Composition. An operationappliedto a reliability matrix that determines marin-iuir the reliability betweenprocessors. Compute-bound. Computationsin which the number of operationsis laree in ;,r:--parisonto the number of I/O instructions. Condition code register. Intemal CPU register used to implemenr a .Lrr.,i::1.-:.;. transfer. Conditional transfer. A changeof the program counterbasedon the resuk .ri : !3>: Content.addressablememory. See associatrve memory. context. The minimum informationthat is needed order to sa'e a curienrlr .\e.-urrns in task so that it can be resumed. Context switching. The processof saving and restorine suft-rcient information for a real-time task so that it can be resumedafter beins intem-rpred. Compiler. CISC.


I Glossary Continguous firleallocation. The processof forcing all allocatedfile sectorsto follow one anotheron the disk. iontinuous random variable. A random variablewith a continuoussamplespace. to Control flow diagram. A real-timeextension dataflowdiagramsthat showsthe flow of control signalsthrough the system. Control specifications. In dataflow diagrams,a finite state automatonin diagrammatic and tabularrepresentation. cycle. the Control unit. CPU internal device that synchronizes fetch-execute are multitasking system. A scheme in which two or more processes Cooperative Calls to a central by determined a finite stateautomaton. or divided into states phases, dispatcher are made after each phase is complete. set. CPU used to extendthe macroinstruction Coprocessor. A secondspecialized multitaskingsystem. Coroutine system. See cooperative Correlated data. See time-relativedata. that can take on two or more values. Counting semaphore. A semaphore unit. CPU. Centralprocessing code. CRC. See cyclic redundancY Critical region. Code that interactswith a serially reusableresource. CU. See control unit. the precludes CPU from accessing the Cycle stealing. A situationin which DMA access bus. Cyclic redundancy code. A method for checking ROM memory that is superior to checksum.See Chapter 11. Cycling. The processwhereby all tasks are being appropriately scheduled(although no cyciomatic complexity. is actualprocessing occurring). A measureof a system reliability devised by McCabe.

Daemon. A device serverthat doesnot run explicitly but rather lies dormant waiting for some condition(s) to occur. Dangerous allocation. Any memory allocation that can preplude system determinrsm. Data bus. Bus used to carry data between the various componentsin the system. Dataflow architectures. A multiprocessing system that uses a large number of speciai processors,and computation is performed by passing activiti packs between them. Dataflow diagrams. A structured analysis tool for modeling software systems. Dead code. See unreachablecode. Deadlock. A catastrophicsituation that can arise when tasksare cornpetingfor the sarne set of two or more serially reusableresources. Deadly embrace. See deadlock. Death spiral. Stack overflow causedby repeatedspurious interrupts. Decode. The processof isolating the opcodeTieldof a macroinstructionand determin-:ne the addressin micromemory of the programming correspondingto it'

I Glossary


Defect. The preferred term for an error in requirement,design, or code. See also fault, failure. are Demand page system. Techniquewhere program segments permittedto be loaded in memory as they are requested fixed-sizechunks. noncontiguous in Density. In computermemory, the number of bits per unit area. that are De-referencing. The processin which the actual locationsof the parameters passedusing call-by-valueare determined' the Derivative of f at x. Represents slope of the function/ at point x. Deterministic system. A systemwhere for each possiblestate.and each Setof inputs, a unique set of outputsand next stateof the systemcan be determined. Digital-to-analog conversion. The processof convertingdiscrete(digital) signalsinto continuous(analog)ones. Direct memory access. A scheme in which accessto the computer's memory is affordedto other devicesin the systemwithout the intervcntionof the CPU' Direct mode instruction. Instructionin which the operandis the data containedat the field of the instruction. address specifiedin the address Discrete random variable. A random variabledrawn from a discretesamplespace. Discrete signals. Logic lines used to control devices. Dispatcher. The part of the kernel that performs the necessarybookkeeping to start 3 task. Distributed real.time systems. A collection of interconnectedself-containedprocessofs. See direct memory access. controller. Device that performsbus arbitration. DMA as block model, a statethat is best described a TCB Dormant state. ln the task-control belonging to a task that is unavailableto the operatingsystem. Double-buffering. A techniqueusing two buffers where one is tllled while the data ir the other is being used. DMA. memory. DRAM. Dynamic random access Drive line. In core memory,a wire usedto induce a magneticfield in a toroid-shrpe; magnet. The orientation of the field representseither a 1 or a 0' Dynamic memory. Memory that usesa capacitorto storelogic 1s and 0s. and thet ::-.: periodicallyto restorethe chargelost due to capacitivedischarse be refreshed Dynamic priority system. A system in which the priorities of tasks ca: ;:i::: Contrast with fixed priority system'

metrics (seeChapter 11)' One of Halstead's harClare .l';;:.:: :: ---e Software used to conffol speci.alized Embedded system. computer system. I --: '-i:l EncapSulation. A condition that ariseswhen a classof objecis;n.j ilre rrFEri'.and implementation' can be performedon are isolatedin both access Effort.

Event. Any occurrence that resultsin a changein the stateof a system.

I Glossary

Event determinism. When the next states and outputsof the systemare known for each set of inputs that trigger events. Event flag. Synchronization mechanismprovided by certain languages. Exception. Error or other specialcondition that arisesduring program execution. Exception handler. Code used to processexceptlons. Execute. Processof sequencing througli the stepsin micromemorycorresponding a to particular macroinstruction. Executing state. In the task-controlblock model, a task that is currently running. Exccutive. See kernel. Extennal fragmentation. When main memory becomescheckeredwith unused but availablepartitions,as in Figure 8.-5.

Failed system. A systemthai cannotsatisfyone or more of the requirements listedin the formal systemspecification. Failure. A fault that causes softwaresystemto fail to meet one of its requirements. the See also defect. A function describingthe probability that a systemfails at time r. Fault. The appearanceof a defect during the operation of a software system; synonymouswith error or bug. See also failure. Failure function. Fault tolerance. The ability of the systemto continue to function in the presence of hardwareor softwarefailures. Fetch. The processof retrieving a macroinstruction from main memory and placing it in the instructionregister. Fetch-execute cycle. The process continuouslyfetchingand executingmacroinstrucof tions from main memory. File fragmentation. Analogous to memory fragmentationbut occurring within files, problems. with the sameassociated Finite state automaton. A mathematical technique usedto represent systems with finite input and output spaces. Also known as a finite statemachine. Firing. In Petri netsor in certainmultiprocessor architectures, when a process block or processperformsits prescribedfunction. Firm real-time system. A systemwith hard deadlineswhere some low missing a deadlinecan be tolerated. of

Fixed priority system. A system in which the task priorities cannot be changed. Contrast with dynamic priority system. Fixed-rate system. A systemin which intemrptsoccui only at fixed rates. Flip-flop. A bistablelogic device. Flow chart. Graphical algorithm representation. Flush. In pipelined architectures, the act of emptying the pipeline when branching occurs.

I Glossary


Foreground. A collectionof interrupt driven or real-timeprocesses. Formal parameter. The dummy variable used in the description of a procedure or subroutine. FSA. Seefinite stateautomaton. FSM. See finite state automaton. Function points. A widely used metric set in nonembeddedenvironments; they form Function points measurethe the basis of many commercial software analysispackages. in betweenmodulesand subsystems programsor systems. number of interfaces Functional requirements. Those system features that can be directly tested br executing the program.

but Garbage. Memory that hasbeenallocated is no longerbeing usedby a task (that is. the task has "lost track of it"). General register. CPU intemal memory that is addressablein the address field of certainmacroinstructtons. General semaphore. See counting semaphore. polynomial in CRC. General polynomial. The modulo-2 divisor of the message Granularity. See scale factor.

inspect Group walkthrough. A kind of white box testingin which a numberof persons the code line-by-line with the unit author.

H 1 -Hamming code. A coding technique used to detect and correct errors in computer memory. Hard error. Physical damageto memory cell.

time constraints leads Hard real-time system. Systemswherefailure to meet response to system failure. Hybrid system. A system in which interrupts occur both at fixed frequencies and sporadically. Hypercube processor. A processor configuration that is similar to the linear arrar' processorexcept that each processorelement communicatesdata along a number of other higher dimensional pathways.

ICE. See in-circuit emulation.

Immediate mode instruction. An instructionin which the operandis an intege: Implied mode instruction. An instruction involving one or more specitk nnern\a{ locations or registers that are implicitly defined in the operation pert-urrri trt instruction. Incidence matrix. A realiability matrix in which the enries are eitlrer I or 0.


I Glossary In-circuit emulation. A devicethat usesspecialhardwarein conjunctionwith software to emulatethe targetCPU for debuggingpurposes. Indirect mode instruction. Instructionwhere the operandfield is a memory location containing the addressof the addressof the operand. Induction variable. A variablein a loop that is incremented decremented some or by constant. Information hiding. The processof isolating highly changeable sectionsof code. Inheritance. In object-oriented programming, inheritance allows the programmer to define new objects in terms of other objects that inherit their characteristics. In-line patch. A patch that fits into the memory spaceallocatedto the code to be changed. Input space. The set of all possibleinput combinationsto a system. Instruction register. CPU intemal register that holds the instruction pointed to by the contents of the program counter. Integration. The processof uniting modules from different sourcesto form the overall system. Internal fragmentation. Condition that occurs in fixed-partition schemeswhen, for example, a processrequires I kilobyte of memory, while the only 2-kilobyte partitions are available. Interrupt. A hardware signal that initiates an event. Interrupt handler. Specialcode usedto respondto intemrpts.Also called an interrupt service routine. Interrupt-handler location. Memory location containing the starting address of an interrupt-handlerroutine. The program counter is automatically loaded with its address when an interrupt occurs. Interrupt latency. The delay between when an intemrpt occurs and when the CPU begins reacting to it. Interrupt register. Register containing a bit map of all pending (latched) interrupts. Interrupt return location. Memory location where the contentsof the program counter is saved when an intemrpt is processedby the CPU. Register that contains the identity of the highest-priority intemrpt A macro where the actual function call is replaced by in-line

Interrupt vector. request. Intrinsic function. code.

Jackson Chart. A form of structure chart that provides for conditional branchins.

Kalrnan filter. A mathematical construct used to combine measurements the same of quantity from different sources. Kernel. The smallestportion of the operating system that provides for task scheduling, dispatching, and intertask communication.

I Glossary


polnts that providespreemptlon Kernel preemption. A methodusedin real-timeUNIX to be intemrpted' in cails to kemel functionsto allow them usedto protect a critical region' Key. In a mailbox, the data that are passedas a flag

Leaf. Any node in a tree with no subtrees' algorithm' pagereplacement Least recently used rule. The best nonpredictive a diagramat a finer level of Leveling. [n dataflow diagrams.the processof redrawing detail. of so organized that multiple instructions the same Linear array processor. A processor type can be executedin Parallel' Linker.Softwarethatpreparesrelocatableobjectcodeforexecutton' in numberof customers average Little,s law. Rule trom queuingtheory statingthat the

aqueuingSystem,N"',isequaltotheaverageanivalrateofthecustomerstoth ta"' system,ru,, times the averagetime spentin that system' in the program' Live variable. A variablethat can be used subsequently Livelock. Another term for process starvatron' the machine' Load module. Code that can be readily loaded into if you examine a list of recently executed Locality-of-ret'erence. The notion that you will seethat most of the instructions are progiu* instructions on a logic analyzer, instructtons' iocalized to within a small number of ineffective' Lock-up. When a systementersin which it is rendered

Look-uptable.Anintegerarithmetictechniquethatusestablesandrelieson functions quickly' mathematicaldefinition of the derivative to compute outsidea loop that computations Loop invariant optimization. The processof placing do not need to be performed within the loop' Looselycoupledsystem.Asystemthatcanrunonotherhardwarewiththerewri certainmodul:s LRU. See leastrecentyusedrule'


computer operations'Also called Machine code. Binary instructions that affect specific machine language. Macrocode. See macroinstruction' Binary program code stored in the main memory of the computer' Macroinstruction. Also called macrocode. 'i of a memory locatlon in'J ArMailbox, An intertask communication device consi,sting it' operations-post and pend-that can be performed on by the CPU' Main memory. Memory that is directly addressable in of repeatingprocesses c1'ciicor pencrltc i\ ilsl'l'ls Major cycle. The largestsequence MAR. See memory addressregister' enabling or di'abling sFecric Mask register. A register that contains a bit map either intemrPts.


I Glossary configuration' in Master processor. The on-line processor a master/slave MDR. SeememorYdata register. of the memory Memory address register (or MAR). Registerthat holds the address location to be acted on. written to or that Memory data register (or MDR). Registerthat holds the data to be location held in the MAR' is read fiom the memory of Memory-loading. The percentage usablememory that is being used' parts of a Memory locking. In a real-timesystem,the processof locking all or certain involved in paging, and thus make the processlnro memory to reducefhe <lverhead executiontimes more predictable. configurationthat is similar to the linear array processor Mesh processor. A processor data north and south' elementalso communicates that eachprocessor "^a"pt Messageexchange' See mailbox. Messagepolynomial. Used in CRC (seeChapter 11)' functionsthat can be performedon objects. systems, Methods. In object-oriented MFT. Multiprogrammingwith a fixed number of tasks' particular macroof Microcode. A sequence binary instructionscorrespondingto a instruction.Also called microinstructions' via Microcontroller. A computersystemthat is programmable microcode. Microinstructions. See microcode. Micro-kerne|.Anano-kemelthatalsoprovidesfortaskscheduling. to corresponding Micromemory. cPU intemal memory that holds the binary codes macroinstructions. of Microprogram. Sequence microcodestoredin micromemory' in of Minor cycle. A sequence repeatingprocesses cyclic or periodic systems' combinesthe high-orderlanguageinstructionwith the Mixed listing. A printout that equivalentassemblylanguagecode' frequencies and Mixed system. A system in which interrupts occur both at fixed sporadically" with highMultimedia computing. Computing that involves computer systems CD-ROM drives, mice, high-performancesound cards, and resolution graphics, multitasking operating systemsthat support these devices' Multip|exer.Adeviceusedtoroutemultiplelinesontofewerlines. than one Multiprocessing operating system. An operating system in which more to provide for simultaneity; contrastwith multitasking operating processoris available sysrcm. functionMultitasking operating system. An operating systemthat provides sufficient single processor so that the illusion of ality to aiow multiple programs to run on a simultaneity is created; contrast with multiprocessing operating system. Mutex. A common name for a semaphorevariable' MUX. MVT. See multiPlexer' Muftiprogramming with a variable number of tasks'

I Glossary


Nano-kernel. Code that provides simple thread-of-execution(same as "flow-ofcontrol") management;essentiallyprovides only one of the three servicesprovided by a kernel-that is, it providesfor task dispatching. Nonfunctional requirements. System requirementsthat cannot be tested easily by program executron. upon removing povl'er. Nonvolatile menory. Memory whose contentsare preserved that doesnot use the storedprogram, Non-von Neumann architecture. An architecture cycle. serial fetch-execute No-op. A macroinstruction that does not changethe state of the computer. problem for NP-complete problem, A decisionproblem that is a seeminglyintractable which the only known solutions are exponentialfunctions of the problem size; compare with NP-hard. NP-hard. A decision problem that is similar to an NP-completeproblem (exceptthat for the NP-hard problem not even an exponential time solution can be found). nth Order reliability matrix. The composition of a reliability matrix with itself (n - l) trmes. N-version programming. A techniqueusedto reducethe likelihood of systemlock-up each running software that has been coded to the same by using redundantprocessors, by different teams. specifications Nucleus. See kernel.

Object code. A specific collection of machine instructions. Object-oriented language. A languagethat provides constructsthat encouragea high degree of information hiding and data abstraction. Opcode. Starting addressof the microcode program stored in micromemory. programs. Operating system. A unique collection of systems system. A system that is not embedded. Organic Orthogonal process. In statecharts,the combined functionalit.v of t set of orrhogonal processes. processes r'Jn that that depictsconcrurent a Orthogonal product. In statecharts. process in isolation. Ostrich algorithm. A techniquethat advisesthat the problem of deadlockbe ignored. This solution is viable only in noncritical s\stems. Output space. The set of all possibleoutput combilations ior a s)'stem' Overlay. Dependentcode and data sections used in overlaf i,ng. Overlaying. A technique that allows a srngle program to be larger than the allowable user space. Oversized patch. A patch that requires more memor)- than is curendy occupied by the code to be replaced.




Page. Fixed-sizechunk used in demand-paged systems. Page fault. An exceptionthat occurs when a memory referenceis made to a location within a page not loaded in marn memory. Page-frame. Seepage. Page stealing. When a page is to be loaded into main memory, and no free pagesare found, then a page frame must be written out or swappedto disk to make room. Page table. A collectionof pointersto pagesusedto allow noncontiguous allocationof page frames in demandpaging. Parnas partitioning. See information hiding. Partial order relation. In processscheduling,an indicator that any processcan call itself (reflexivity); if processA calls process B, then the reverse is not possible (antisymmetry), A and if process calls processB and processB calls processC, then processA can call processC (transitivity). Patching. The processof correctingerrors in the code directly on the targetmachine. PC. PDL. See program counter. See program design language.

Peepholeoptimization. An optimizationtechniquewhere a small window of assembly langageor machinecode is comparedagainstknown pattemsthat yield optimization opportunltles. Pend operation. Operationof removing datafrom a mailbox. If data are not available, itself until the data becomeavailable. the processperforming the pend suspects Petri net. A mathematical/pictorial systemdescriptiontechnique. Phase-driven code. See state-driven code. Ping-pongbuffering. Seedouble-buffering. Pipeline. An intertaskcommunicationmechanismprovided in UNIX. Pipelining. A techniqueused to speedprocessor executionthat relies on the fact that fetching the instruction is only one part of the fetch-execute cycle, and that it can overlap with different parts of the fetch-execute cycle for other instructions. Polled loop system. A real-timesystemin which a single and repetitivetest instruction is used to test a flag that indicates that some event has occurred. Polymorphism. In object-oriented programming, polymorphism allows the prograrnmerto createa single function that operateson different objects dependingon the type of object involved. Post operation. Operationthat placesdata in a mailbox. Power bus. The collectionof wires usedto distributeDowerto the variouscomponents of the computersystem. a Pragma. In certainprogramminglanguages, pseudo-opthat allows assemblycode to be placed in-line with the high-order language code. Preempt. task. A condition that occurs when a higher-priority task interrupts a lower-priority

Preemptive priority system. A systemthat usespreemptionschemes insteadof roundscheduling. robin or first-come/first-serve





Primary memory. See main memory. to Priority ceiling protocol. A method used in interruptdriven systems avoid priority inversion;dictatesthat a task blocking a higher priority task inheritsthe higherpriority for the duration of that task. Priority inversion. A condition that occurs becausea noncritical task with a high execution rate will have a higher priority than a critical task with a low execution rate. used to calculatethe overall systemreliability. Processblocks. Subsysterrs systemsuch as a in Processingelements. The individual processors a multiprocessing systolic or wavefiont architecture. Program counter. The CPU internal register that holds the address of the next instructionto be executed. Program design language. A type of abstracthigh-order languageused in sYstem specification. Propagation delay. The contributionto interruptlatencydue to limitation in switching of speeds digital devicesand in the transit time of electronsacrosswires. Prototype. A mock-up of a softwaresystemoften used during the designphase. Pseudocode. A type of program design language.

such asC. Raise. Mechanismused to initiate a softwareinterrupt in certain languages RAM scrubbing. A technique used in memory configurations that include error the which reduces chanceof multiple bit detectionand correctionchips.The technique, memory effors are corrected in because someconfigurations errorsoccuring,is needed memory datathen needto be written on the bus and not in mernoryitself. The corrected back to rnemory. Random variable. A function mapping elements of the sample space into a real number. Rate-monotonic system. A fixed-rate,preemptive,prioritized real-time systemshere the priorities are assignedso that the higher the executionfrequency,the higher the priority. Reactive system. A systemthat has some ongoing interactionwith its enrironment. Read/write line. Logic line that is set to logic 0 during memory-u'rite and to logr. I during memory read. Ready state. In the task-controlblock model, the stateof those thsksthat are r:::i, but not running. Real-time system. A system that must satisf;- explicit tbcundea' :eirrcrit ll=.1 or constraints it will fail. Recovery block. Sectionof code that che.-\ lf the lire:r:. beginningof a recoren bir-t-k. processing can resumeat the ihat can Recursion. A methoduherebya procedure be self-relerentiiri. ls. l[ !-allin\\-hi(call) itself.


I Glossary Reduced instruction set cornputer. Architecture usually characterized by a small instruction set with limited addressing modes and hard-wired (as opposed to microcoded)instructlons. Reduction in strength. Optimization techniquethat usesthe fastestmacroinstruction possibleto accomplisha given calculation. Re-entrant procedure. A procedurethat can be usedby severalconcurrentlyrunning tasksin a multitaskingsystem. Register direct mode instruction. Instruction in which the operand field is a reglster. Register indirect mode instruction. Instructionin which the operandaddress kept in is a registernamed in the operandfield of the instruction. Regressiontesting. A test methodologyused to validate updatedsoftu,areagainstan old set of test casesthat have alreadybeen passed. Reliability matrix. In a multiprocessing system,a matrix that denotesthe reliability of the connections betweenprocessors. Responsetime. The time between the presentation a set of inputs to a software of systemand the appearance all the associated of outputs. ReversePolish notation. The result of building a binary parsetree with operands the at leavesand operations the roots, and then traversingit in post-orderfashion. at Ring buffer. A first-in/first-outlist in which simultaneous input and output to the list is achievedby keepinghead and tail pointers.Data are loaded at the tail and read from the head. RISC. See reducedinstructionset computer. Root. In overlaying memory management,the portion of memory containing the overlay managerand code common to all overlay segments, such as math libraries. Round-robin system. A systemin which several processes executed are sequentially to completion,often in conjunctionwith a cyclic executive. Round-robin system with time-slicing. A system in which each executabletask is assigned fixed time quantumcalled a time slice in which to execute. clock is used a A to initate an interrupt at a rate correspondingto the time slice.

Sample space. The set of outcomesto some experiment. Sampling rate. The rate at which an analog signal is converted to digital form. Scale factor. A technique used to simulate floating point operations by assigning an implicit noninteger value to the least significant bit of an integer. sccs. Source code control system for managementof system code; typical for UNIX operatingsystems. Schedualability formance. analysis. The compile time prediction of execution time per-

Scheduler. The part of the kernel that determineswhich task will run. Scratch pad memory. CPU intemal memory used for intermediate results.

311 I Glossary Screen signature. The CRC of a screenmemory'

Secondarymemory.Memorythatischaracterizedbylong-termstoragedevicesSucha tapes,disks, and cards'

S e l f - m o d i f y i n g c o d e ' C o d e t h a t c a n a c t u a l l y c h a n g e i t s e lmay r e x a m p lonlyyone i n g f ; f o differ by e ' b t a k of certain initructions advantageof tn" tu",iiat the opcodes type used for protectrng critical regions' Semaphore. A special variable on a semaphor' two operations that can be performed Semaphore primitives' The namelY,wait and signal' coupled system' Semidetachedsystem' See loosely bit.

S e n s e l i n e . l n c o r e m e m o r y a w i r e t h a t i s u s e d t o . . r e isd ' ' tise m egeneratedin e n d sense t h a h m o r y . D e p the i n g o n in the core, a pulse or not orientation of the magnetrcfield at a time and that can only be usedby one task resource Serialty reusable resource. A that must be used to comPletion' line.

Server.Aprocessusedtomanagemultiplerequeststoaseriallyreusableresource SEU. Seesingleevent upset' such as C' mechanismprovided by certainlanguages' Signal. Exception-handling

Signaloperation.op",uti-ononasemaphorethatessentiallyreleasesthereso semaPhore' ProtectedbY the

Single.eventupset.Alterationofmemorycontentsduetochargedparticlesprese event' Jpu"", ot in the presenceof a nuclear S|aveprocessor.Theoff-line,processorinamaster/slaveconfiguration. of the contents of memory' Soft eiror. Repairable alteration

Softreal-timesystem.Asysteminwhichperformancersdegradedbynotdestroye failure to meet responsetime constrarnts' Software. A collection of macroinstructlons'

Softwarereliability.Theprobabilitythatasoftwaresystemwillnotfailbeforesom time t. software' involving redundant hardware or Spatiat fault tolerance' Methods

S p e c u l a t i v e e x e c u t i o n . I n m u l t i p r o c e s s i n g s y s t e m s , aini tthe tnexttprocessbirrrr' e n i code s u a i o n h a t i n v o l r ' e s :> optimislcailv and predictivelyexecuting processor longasthereisnodepend"ncyinthatprocessblockoncodethatcouidberu:il-:. other Processors' the wait semaphoreoperatlon' Spin lock. Another name for with all interruptsocculrlng sporadicarir' Sporadic system. A system by an interrupt that occursapen'rir'i'i Sporadic task. A task driven

Spuriousinterrupts.Extraneousandunwantedintemlptsih":,:,:'.']::..].. loading. memory' SRAM. Static random-access structure' Stack. A first-inAast-out data

Stackmachines.ComputerarchitectureinuhichLtelnst.';---::i3r=;en:ir3.J stack' and an accurtuial"t intemal memory store called a


I Glossary Starvation. A condition that occurs when a task is not being serviced frequently enough. State-driven code. Programcode basedon a finite stateautomaton. Static memory. Memory that does not rely on capacitivechargeto storebinary data. Statistically based testing. Techniquethat usesan underlyingprobability distribution random test cases. function for each systeminput to generate that containsthe value of the Status register. A registerinvolved in interuptprocessing lowest interrupt that will presentlybe honored. to Stresstesting. A type of testingwherein the systemis subjected a large disturbance of interupts), foilowed by smallerdisturbances in the inputs(for example,a largeburst spreadout over a longer period of time. Structure chart. Graphicaldesign tool usedto partition systemfunctionality. Suspendedstate. In the task-controlblock model, those tasks that are waiting on a particularresource,and thus are not ready.Also called the blocked state. Swapping. The simplest schemethat allows the operating system to aliocate main simultaneously. memory to two processes physical phenomenonthat an eiectricai signal cannot instanfaSwitch bounce. The neouslychangefrom its logical false condition. Synchronous data. See time-relativedata. Synchronous event. Event that occursat predictabletimes in the flow-of-control. Syndrome bits. The extra bits neededto implementa Hamming code. System. An entity that when presentedwith a set of inputs produces outputs. of System programs. Softwareused to managethe resources the computer. System unification. A process consisting of linking together the testing software modulesin an orderly fashron. Systotic processors. Multiprocessingarchitecturethat consistsof a large number of in connected an array topology. uniform processors

Task-control block. A collection of data associatedwith a task including processcode (or a pointer to it), and other infonnation. TCB. See task control block. Telepresence. A form of virtual reality in which a human operatorcan remotely control robots or other devicesas if the operatorwere physically present. time for eachset of Temporal determinism. A conditionthat occurswhen the response outputsis known in a deterministicsystem. that allow for toleratingmisseddeadlines. Temporal fault tolerance. Techniques that can atomically test and then set a Test-and-setinstruction. A macroinstruction to panicular memory address some value. Test probe. A checkpointused only during testing' Test suite. A collection of test cases.



343 Very high paging activity.


Throughput. A measureof the number of macroinstructions secondthat can be per processed basedon some predetermined instructionmix. Time-loading. The percentageof "useful" processingthe computer is doing. Also known as the utilization factor. Time overloaded. A systemthat is l00oloor more time-loaded. Time-relative data. A iollection of data that must be time correlated, Time-slice. A fixed time quantum used to limit execution time in round-robin systems. Transceivers. A transmitheceive hybrid device. Tiansputer. A fully self-sufficient, multiple instruction set, von Neumann processor, designedto be connected other transputers. to Trap. Internal interrupt causedby the execution of a certain instruction. A high-impedancestate that, in effect, disconnectsa device from the bus. Tri-state.

Unit. A softwaremodule. Unreachable code. Code that can never be reachedin the normal flow-of-control. User space. Memory not required by the operating system. Utilization facator. See time-loadine.

Vector processor. See linear iuray processor. Version control software. A systemthat managesthe accessto the various components of the system from the software library. Volatile memory. Memory in which the contents will be lost if power is removed. von Neumann bottleneck. A situation in which the serial fetch and execution of instructions limits overall execution speed.

Wait and hold condition. The situation in which a task acquires a resourceand then does not relinquish it until it can acquire another resource. Wait operation. Operation on a semaphore that essentiallylocks the resourceprotected by the semaphore,or prevents the requestingtask from proceeding if the resourceis already locked. Wait state. Clock cycle used to synchronizemacroinsEuctionexecution with the access time of memory. Watchdog timer. issued. A device that must be reset periodically or a discrete signal is

I Glossary Wavefront processor. A multiprocessing architecture that consists of an array of identical processors, each with its own local memory and connected in a nearestneighbor topology. White box testing. Logic-driven testing-designedto exercise all paths in the module.


[1] Adrion, W. Richards, Martha A. Branstad, and John C. Cherniavsky ACM Computing Validation,verification,and testingof computersoftware. :159-192. Survey(June 1982) Aho, Alfred V., Ravi Sethi,and JeffreyD. Ullman. Compilers:Principles, [2] i986. Techniques and Tools.New York: Addison-Wesley, Aho, Alfred V., and JeffreyD. Ullman. The Theoryof Parsing,Translation [3] Cliffs, N.J.:Prentice-Hall, 1972. and Compiling,Vol.I: Parsing.Englewood Allard, JamesR., and Lowell B. Hawkinson.Real-time programmingin [4] of common LISP. Communications the ACM 35, 9 (Sept. 1991): 64-69. [5] Allworth, S. T., and R. N. Zobel. Introduction to Real-Time Software 1987. Design. Znd ed. New York: Springer-Verlag, [6] American National Standards Institute. American National Standard ProgrammingLanguageFORTRAN.ANSI X3.9-1978. New York:AmenInstitute, 1978. can National Standards American National Standards Institute. American National StandarC [7] ReferenceManual for the Ada ProgrammingLanguage.ANSIiIr4il-Std Institute. 198-r. 1815A-1983. New York: American National Standards [8] Andrews, Warren. RISC-based boards make headway in real-time Design (Oct. 1991):69-80. Computer applications. Physics Vol. III. London: George.\llen & Isaac. (Jnderstanding [9] Asimov, Unwin Ltd.,1966. [10] Baker, T. P. A. stack-basedresource allocation policy lbr real-rirne I rl-g 5-rnrpo-siirr':. processes. Proceedingsof the Ilth Real-TimeS-r'slenrs BuenaVista,Fla. (Dec. 1990):191-200. [11] Bartee;Thomas C- ComputerArchitectureand Loeic Desisn. \er* \brk: McGraw-Hill, 199i.




Louis E. Rosier.Preemptively [12] Baruah,Sanjoy K., Aloysius K. Mok, and of Proceedings hard real-timesporadictasks on one pfocessor. scheduling symposium.Lake Buena Vista, Fla' (Dec. systems the llth R.eal-Time 1990):182-190, hottest game in town' [3] Bemhard, Robert. Super-minicomputers-The & Systems Sofrware4(1985): 44-58' Applications. New York: John [14] Blackman, M., The Design af Reat-Time Wiley & Sons,1975. Ada 9x, Embedded systems [15] Bodilsen, Svend. Scheduling theory and Programming(Dec. 1994):32-52' EnglewoodCliff's' N'J': [16] Boehm, Barry. SoftwareEngineeringEconomics. 1981. Prentice-Hall, ACM SIGSOFT. development. [17] Boehm, Baffy. A spiral model of software (Aug' 1986) SoftwareEngineeringNotes ll,4 ESTEREL Language. [1g] Boussinot, Fr6d6ric, and Robert DeSimmi..The 1293-1344."., of Proceedings the IEEE,79,9 (Sept' 1991): Month. New York: Addison[19] Brooks, Frederick P. The Mythicat Man Wesley,1982. PaoloNesi.Tools for specifying [20] Bucci, Giacomo,Maurizio campanai,and Journal, (Jan' 1995)' Real-TimeSystems real-tirnesystems. and Their Program[21] Burns, Alan, and Andy wellings. Real-timesystems 1990' New York: Addison-Wesley, ming Languages. to Serial Communications' [22] Campbell, Joe. C Programmer's Guide Indianapolis:Howard Sams& Co., 1988' Controlling the software life l23l Cave, William C., and Alan B. Salisbury. cycle-The project management task. IEEE Transactions on sOftware Engineering(JulY 1978): 326-334' IntegratedElectronic Circuits' [24] Chirlian, Paul M. Analysisand Design of Znd,ed.New York: HarPer& Row, 1987' McMillen. A language [25] Clark, Edmund M. Jr., David E. Long, and Kenneth for computational specification and verification of finite state hardware of Proceedings the IEEE,79,9 (Sept. 1991): 1283-1292. conrrollers. New York: Addison-wesley, 126l cox, Brad. obiect-oriented Paradigms. 1988. An Evolutionary Approach' I27l Cox, Brad. object-oriented Programming: 1991. New York: Addison-WesleY, New York: [28] Daigle, John N, Queuing Theory for Telecommunications. t992. Addison-WesleY, Ted F. Jr. I-eibfried, Swami Natarajan, David Pruett, Lui [29] Davari; sadegh, Sha and Wei Zhao. Real-time issuesin the design of the data management SystemfortheSpacestationFreedom.Proceedingsofthe

I BibliograPhY


IEEE CS Applications Workshop' Jrtly 1993' New York' First Reat-Time 161-165. Press: New York: Dover Davis, Martin' Computability and Unsotvability'

PublishingCo.,19'73' Englewood Specificatiorn' and System Analysis [31] DeMarco,Tom' Structured 1978' Cliffs, N.J.: Prentice-HalUYourdon,

[32]DeMillo,RichardA.,RichardJ.Lipton,andAlanPerlis.Socialprocesse andproofsoftheoremsandprograrns.CommunicationsoftheACM22, (hday 1979)' [33]Desmonde,WH.Real-timeDataProcessingSystems:Introduilo 1964' Concepls'EnglewoodCliffs, N'J': Prentice-Hall'

[34]Dijkstra,E.W'CooperatingSequentialprocesses.TechrcicalReportE l2S.Eindhoven,Netherlands:TechnologicalUniversity,1965.

[35]Dijkstra,E.W.Gotostatementconsideredharmful.Communicationso ACM ll,3 (Mar. 1958)'

[36]Dijkstra,E.W..solutionofaprobleminconcurrentprogrammingcontro (Mar' 1968)' Communicatioi\ o7 the ACIvI 11, 3 R' S' Genolini' S' Crespi-Reghizzi' Bayan' C' [37] DiMaio, A., C. Cardigno, Goldsack' DRAGOON: An AdaDestombes,C. V. Atiinson, and S' J' basedobject-orientedlanguageforconcurrent,real-time,distribute Design- with Ada' Proc' Ada-Europe International systems. Systems Conference,Madrid'AdaCompanionSeries'Cambridge:Cambrid UniversitYPress,June 1989'

t38]DOD-STD.2I6TA.MilitarystandarddefenseSystemsoftwaredevelo D'C': U'S' Departmentof Defense' 1988' ment. Washington, [39]Dorf,RichardC.,TheElectricalEngineeringHandbook,Piscataway, Press,1993' CRC PressAEEE

[40]Dougherty,E.R.,andC'R'Giardina'MathematicalMethodsforArtific IntelligenceandAutonomousSystems'EnglewoodCliffsN.J.:Frent Hall, 1988' Bjame Stroustrup'The AnnotatedC++ Re'feren't [41] Etlis, MargaretA', and 1990' Manual. New York: Addison-Wesley'

[42]Fagan,M.E.DesignandcodeinspectionstoreduceerrorsrnPro Journal t5' 3 (1976):lll' ' IBM Systems development jrd e'j' \e* \c:L' Y' Total Quatitl' Control' [43] Feigenbaum,Armand McGraw'Hill, 1983'

[44]Ferrintino,A'B.,andH.D'' IEEE COMPS'-\C'19;l' softwareengineering' c|f verificadon: The r.en. idea. CommunlCClitclu.l: [45] Fetzer, JamesH. Frogram theACM 31,9 (Sept'i988t: 1O+8-1062'




J. Ada++ :A classand [46] Forestier, P.,C. Forarino,and P. Franci-Zannettacci. inheritance for extension Ada. Proc.Ada-Europe InternationalCorference, Madrid. Ada CompanionSeries.Cambridge:CambridgeUniversity Press, June1989. A. New York: [47] Freedman, L., and R. A. Lees.Real-TimeComputerSystems. Crane,Russak& Co., 1911. [48] Furht, Borko, Dan Grostick, David Gluch, Guy Rabbat,John Parker,and Meg McRoberts.Real-time Unix Systems Design and Application Guide. Boston:Kluwer AcademicPublishers, 1991. [49] Garrett, Patrick H. Advanced instrumentationand computer I/O design: real-time systemcomputer interfaceengineering,Piscataway, N.J.: IEEE Press,1994. [50] Garver, Roger. How to implement ISO 9000. Z & D (Sept. 1994): 36-42: [51] Ghezzi, Carlo, JazayeriMehdi, and Dino Mandrioli. FundamentalsoJ' Engineering. EnglewoodCliffs, N.J.: Prentice-Hall, Software 1991. A [52] Giardina,CharlesR. Parallel Digital Signal Processing: Unified Signal Algebra Approach.Wayne,N.J.: RegencyPublishing, 1991. [53] Giardina,CharlesR. Parallel MultidimensionalDigital Signal Processing. Wayne,NJ: Regency Publishing, 1991. J. [54] Goodenough, B., and L. Sha.The priority ceiling protocol:A methodfor minimizing the blocking of high-priority Ada tasks. Technical Report CMUISEI-88-SR-4.Camegie-Mellon University: Software Engineering Institute,1988. [55] Gopinath,Prabha,Thomas Bihri, and Rajiv Gupta. Complier supportfor object-oriented real-time software.IEEE Software(Sept. 1993):42-49. A. of of Communications the [56] Habermann, N. Prevention systemdeadlocks.

ACM r2,7 (July1969): 17I-176. predictable [57] Halang,W. A., and A. Stoyenko.Constructing systems. Boston: KluwerAcademic, 1991.
M. of Science. Amsterdam: North-Holland, [58] Halstead. H. Elements Sofnuare 1977. [59] Harbison, Samuel P., and Guy. L. Steele, Jr. C: A ReferenceManual. EnglewoodCliffs, N.J.: PrenticeHall, 1991. of [60] Harel, David. On visual formalisms.Communications the ACM 3L, 5 (May 1988): 514-530. and [61] Harel, D., H. Lachover,A. Naamad,A.. Pnueli,M. Politi, R. Sherman, A. Trauring.STIfIEMATE:A working environment the development for of complex reactive systems. IEEE Transactionson SofnvareEngineering 16. 4 (Apr. 1990): 403-414.



for 162l Hatley, D., and I. Pribhai. Strategies Real-TimeSystemSpecification. New York: Dorset House, 1987. [63] Hayes, John P. Computer'Architectureand Organization.2nd ed. New York: McGraw-Hill, 1988,pp. 210-ZII. 164l Henize, John. Understanding real-time UNIX. Concurrent Computer Corporation,One TechnologyWay, Westford,Mass. 01886' [65] Hetzel, Bill. The Complete Guide to Sofnvare Testing. Znd ed. Wellesley, Mass.: QED Information Sciences,1988. [66] Hill, Frederick J., and Gerald R. Peterson.Digital Systems:Hardware Organizationand Design.3rd ed. New York: John Wiley & Sons, 1987. [67] Horowitz, Ellis. Fundamentals of Programming Languages. 2nd ed. Rockville, M.: ComputerSciencePress,1984. [68] Howden, William E. Life cycle software validation. Software Life Cycle Management. Maidenhead, England: Infotech, 1980, pp. 101116. t69l IEEE/ANSI Std. 830-1984. IEEE Guide to Sofnuare Requirements Specification. New York: IEEE, 1984. UOI IEEE Software Magazine, Special Issue on Real-Time Realities (Sept. UII I72l [73] 1992). IEEE Transactionson Software Engineering, Special Issue on Analysis of SE Real-TimeSystems. 18 (Sept. 1992). Practicefor SoftwareDesign Description. IEEE Std. 1016.Recommended New York: IEEE, 1987. Ingalls, Dan. Objectoriented programming. Video tape, Apple Computer, Inc. 1989. Part of the University Video Communications collection, Disiinguished Lecture Series,Volume II. PerformanceAnalysis' New York: Jain,Raj. The Art of Computer Systems John Wiley & Sons,Inc. 1991. Joel, A. E. Communication switching systemsas real-time computers. Proceedingsof the Eastern Joint Computer Conference-l957. Joerg, Werner B. A subclass of Petri nets as a design abstraction for parallel architeclures.ACM Computer Architecture Nala's 18. -l tDec. 1990):67-:75. Jones,Gregory W. Sofware Engineering. New York: John \\-ile1' & Sons. 1990. lar Jovanovic,Vladan, StevanMrdalj. A structuredspecificarion1gL-hnique of the .4'CI1.36. ll '\or-. X99-i': Communications systems. hypermedia 18-20. Kemighan, Brian W Why Pascalis not m1' favorire language-Compwing Science Technical Report it'o. IAO. Murray Hill. NJ.: Bell L-aborarories (July 18, 1981).

f74f [75] [76]

[77] [78]





[80] Kemighan, Brian W., and Dennis M. Ritchie. The C Programming 1990. Cliffs, N.J.: Prentice-Hall, Language.2nded. Englewood [81] Kfoury, A. J., Robert N. ]vloll, and Michael A. Arbib. A Programming Approach to Computablli4,. New York: Springer-Verlag,1982. [82] Kleinrock, Leonard. Queuing Systems,Vol. I: Theory. New York: John Wiley & Sons;1975. [83] Knuth, Donald E. The Art of ComputerProgramming,Vol. 3: Searching 1973. and Sorting. New York: Addison-Wesley, [84] Koffman, Elliot. Turbo Pascal. 2nd ed. New York: Addison-Wesley, 1987. [85] Krishna, C. M., and Y. H. Lee. Guest editor's introduction: Real-time systerns. Computer(May 1991):10-i1. Computer(Jan. 1982):3746. [86] Kung, H. T. Why systolic architectures? [87] Kung, Sun-Yuan, K. S. Arun, Ron J. Gal-ezer, D.V. Bhaskar Rao. /EEE Wavefront array processor:Language,architecture,and'applications. C-31,11: (Nov. 1982):1054-1066. Transactions Computers on [88] Lamb, D. SoftwareEngineering:Planningfor Change,EnglewoodCliffs, 1988. N.J.: Prentice-Hall, The Byzantinegenerals'problem. [89] Lamport, L., R. Shostak,and M. Pease. 4, ACM Transactionson ProgrammingLanguagesand Systems 3 (July 1982):382-401. [90] Laplante, Phillip A. Fault-tolerant control of real-time systems in the presence single event upsets.Control EngineeringPractice 1, 5 (Oct. of 1993):9-16. [9i] Laplante, Phillip A. The Heisenberguncertainty principle and the Halting problem.ACM SIGACTNewsletter22,3 (Summer 1991). l92l Laplante, Phillip A. The Heisenberg uncertainty principle and its applicationto softwareengineering.ACM SIGSOFT SoftwareEngineering Notes 15,5 (Oct. 1990). ACM [93] Laplante, Phillip A. A novel single instruction computer architecture. ComputerArchitectureNews 18,4 (Dec. 1990). [94] Laplante, Phillip A. A single instruction computer architecture and its application in image processing.Proceedingsof the SPIE Conferenceon Boston (Nov. 1991). Image Processing. [95] r.aplante, Phillip A. Software considerations for single event upsets. Proceedingsof the 12th Biennial Guidance TestSymposium.ALamogordo, N.M. (Oct. 1985). [96] Laplante, Phillip A. Some thoughts on cleamoom software de,velopment and its impact on system test. Proceedings of the Third AT&T Software Holmdel, N.J. (Dec. 1988). Qualily Symposium.



[97] Laplante, Phillip A., Ajmal H. Arastu, and Michael E. Mclane. The of softwarelife cycle and its relationto systemtesl.Proceedings the Third Holmdel, N.J. (Dec. 1988). AT&T SoJ'tware Quality Symposiunt. An Laplante, Phillip A., Eileen Funck-Rose,and Maria Gracia-Watson' [98] developmentsin the US. historical overview of early real-time system lournal (Jan. 1995). Real-TimeSystems [99] Laplante,Phillip A., and D. Sinha.Positionallogic and its applicationto of Proceedings the International Conference Young database systems. for Beijing (July 1991). Scientists. Computer .SL Parallel Processingin Industrial Real-TimeApplica[100] Lawson, Harold tions Englewood Cliffs, N.J.: Prentice-Hall, 1992. [101] Lehoczky, John, Liu Sha, and Ye Ding. The rate monotonic scheduling casebehavior.Proceedings and algorithm: Exact characterization average the l)th Real-TimeSystemsSymposium.Santa Monica, Calif' (Dec. of 1 1989): 66-171. Nancy G., and JaniceL. Stolzy.Safety analysisusing Petri nets. [102] I-eveson, Engineering 13,3 (Mar. 1987):386-397. on IEEE Transactions Softwore Design. New and Ashok K. Agrawala.Real-timeSystem [103] Levi, Shem-Tov, York: McGraw-Hill, 1990. [104] Liu, C. L., and J. W. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment.Journal of the ACM 20, I (1973): 46-67. A [105] Locke, C. D., and J. B. Goodenough. practicalapplicationof the ceiling protocol in a real-time system. Technical Report CMUISEI-88-SR-3. Camegie-MellonUniversity: SoftwareEngineeringInstitute, i 988. N'J.: [106] Lyu, Michael R., ed. SoftwareReliability Engineering,Piscataway, 1996. IEEE Press, [107] MacWilliams, F. J., and N. J. A. Sloane.The Theory of Error-Correcting . Codes.Amsterdam:North-Holland, 1977 Architecture.EnglewoodCliffs, N.J.: [108] Mano, M. Morris. ComputerSystem Prentice-Hall, 1982. [109] tvlano,M. Morris. Digital Logic and ComputerDesign.EnglewoodCliffs. 1979. N.J.: Prentice-Hall, John.RISC Chips.BYTE (Nov. 1984):191'206. [1i0] Markov, Ensie+oci C..::s. S1's/enrs. Real-Time Computer [111] N{artin,J.Programming 1965. N.J.: Prentice-Hall, -'4 IEEE Transd.Iit,';-r -i-.i".;-. [112] McCabe,T. J. A complexitymeasure. (Dec. 1976): 308-320. Engineering2,4 Lc::tt',,\'f.'r-r r{ P. [113] Melliar-Smith, M. Intervallogic to real-timesvstem]. Voos and J. Hartmarus.eds. -\es \brli: SpnngerComputerScience.G. Verlag,1988,pp. 224-242.




for [114] Mellor, StephenJ., and Paul T. Ward. StructuredDevelopment RealTime Systems.Vols. I, II, ilI. Englewood Cliffs, N.J.: Prentice-HalV Yourdon,1986. for designproblemsof distributedsystems the hard [115] Mok, A. Fundamental real-time envitonment. Ph.D. thesis, MIT Laboratory for Computer May 1983. Science, facilities in Ada 95. Dr. Dobb's Journal, [116] Moore, David L. Object-oriented (Oct. 1995):28-35. Principles and Problems.New [117] Moshos, GeorgeJ. Data Communications York: West PublishingCo., 1989. t1181 MTOS-UX/Ada product profile. Jericho, N.Y.: Industrial Programming Inc., 1989. of and management software reliability. [1i9] Musa, J. D. The measurement IEEE 68, 9 (Sept. 1980). of Proceedings the Myers, Glenford J. Reliable SofnvareThrough CompositeDesign. New [120] York: Van NostrandReinhold, 1975. [121] Mynatt, Barbee Teasley. Sofnuare Engineering with Student Proiect Guidance.EnglewoodCliffs, N.J.: Prentice-Hall,1990' Englewood Cliffs, N.J.: U22l On, Kenneth. Sftuctured SystemDevelopmenr. Yourdon Press,1977. [123] Papoulous,Anathasios.Probability, Random Variables and Stochastic New York: McGraw-Hill, 1965. Processes. D. L. A rational design process: How and why to fake it. U24l Pamas, Proceedings of TAPSOFT Joint Conference on Theory and Practice of Berlin (Mar. 1985)' Developmenr. Sofnuare Paul C. Clements. On the criteria to be used in [125] Pamas, D. L., and of systemsinto modules.Communications the ACM 15,12 decomposing (Dec. 1972): 1053-1058. [126] Patterson,JamesG. ISO 9000 Worldwide Quality Standard. Menlo Park, Calif.: Crisp Publications,1995. Metrics. [127] Paulish,Daniel J., and Karl H. Mtiller. Best Practicesof Software N.J.: IEEE Press,1992' Piscataway, Paulish,Daniel J., and Karl H. Mijller. SoftwareMetrics: A Practitioner's [12&] Guide to Improved Product Development' First published by-Chapm4n & Hall Limited,1992. ExclusiveNorth Americandistributionrights assigned N.J. to IEEE Press,PiscatawaY, L., and Abraham Silberschatz. Operating Systems [129] Peterson, James 1985' New York: Addison-Wesley, Concepts. N.J.: IEEF. Pham, Hoang. SofnuareReliability and Testing,Piscataway, [130] Press,1995. Proceedings of the IEEE, Special Issue on Real-Time Systems (Jan. [t31] 1994).





[132] Redmond,K. c., and r. S. smith. project whirrwind-The History of a Pioneer ComputerBedford, Mass.: Digital press, 19g0. and RichardC. Waters. [133] Rich, Charles, Autornaticprograrlming: Myths and Prospects. IEEE Computer(A\g.1988): 40-51. [134] Ripps, David L.,An ImplementationGuide to Rear-Timeprogramming. EnglewoodCliffs, N.J.: Yourdon press, 1990. [135] Ross, D. Structured analysis (sA): A language for communicating ideas.IEEE Transactionson softuare Engineering sE-3,1 (Jan. lg71). [136] Rothstein,Michael F. Guide to the Design of Real-Timesys/ezs. New York: Wiley Interscience, 1970. [137] schoch, D. J., and P. A. Laplante.A rear-time systemscontext for the framework for information systemsarchitecture.IBM Systems Journal34, | (1994):20-38. [ 138] schwartz,Mischa. I nformationTransmis sion, M odulationandNaise. New York: McGraw-Hill, 1980. [139] Selby, R. w., v. R. Basili, and F. Terry Baker. cleanroom software development: An empirical evaluation. IEEE Transactions on software Engineering SE-13,9 (1987):t\Zj-t037. [140] sha, L., and J. B. Goodenough.Real-time schedulingrheory and Ada. Teb hnical Report c M Lr sEI -88-TR-3 . camegie-Mellon university: SoftI 3 ware Engineering Institute, 1988. [141] sha, L., and J. B. Goodenough.Real-time schedulingtheory and Ada. Te hnical Report c M u IsEI -89-TR- 4. carnegie-MellonUniversity: Softc I ware EngineeringInstitute, 1989. [142] shaw, A. c. communicating real-time state machines.IEEE Transactions on SoftwareEngineering 18,9 (1992): 805-816. [143] shaw, Alan c. The Lagical Design of operating systems.Englewood Cliffs, N.J.: Prentice-Hall. I974. [144] shen, ehia, Krithi Ramamritham, and John A. Stankovic. Resource reclaiming in real-time. Proceedings of the llth Real-Time systems Symposium, Lake BuenaVista, Fla. (Dec. 1990):41-50. [145] shiva, Sajjan G. computer Design & Architecture. 2nd ed. New york: HarperCollins,1991. [146] silberschatz,Abraham, James I,. peterson, and p. Glavin. operating Systems Concepts.3rded. New York: Addison-Wesley, 1994. [147] slepian, D., H. o. Pollack, and H. T. Landow. prolate spheroidal wave functions, Fourier analysis,and uncertainty principle I and tr. Bell s1'stem TechnicalJournal 40, 1 (Jan. 1961): 43-84. [148] Som, s., R. R. Mielke; and J. w Stoughton.strategiesfor predictability in real-time data-flow architectures. proceedings of the IIth Real-Time SystemsSymposium,Lake Buena Vista, Fla. (Dec. 1990): 226-235.




York: Addison[149] Sommerville, Ian. SofWare Engineering. 4th ed. New Wesley,1992. be aware. [150] Speny, Tyler. Real-tirhe operating systems: let the buyer Product News, (summer 1995): Embeclded systems Programming

Manual. series in computer [i51] Spivey, J., The Z Notation: A Reference Science.EnglewoodCliffs, N.J.: Prentice-Hall,1989. Systems-A [152] Stankovic, J., and Krithi Ramamritham.Hard Real-Time (IEEE), 1988' D.C': ComputerSciencePress Tutorial. Washington, C.Bttazzo. [153] Stankovic,JohnA., Maro Spuri, Marco Di Natale and Giorgio systems.IEEE Implications of classicalschedulingresults for real-time 6 Computer,2, (June1995):16-25. of Can the advantages RISC be utilized A., [154] Steininger, and H. Schweinzer. '91 Workshop Realon of Proceedings the Euronticro in real-timesystems? (1991):30-35. Paris TimeSystem.s. systems.New York: McGrawSaul. Real-TimeData-Processing [155] Stimler, Hill, 1969. languages, of [156] Stoyenko, A. D. Evolution and state-of-the-art real-time 18 (Apr'. 1992):6l-84' and Software Journal of Systems and E. Kligerman. Real-Time Euclid: A languagefor [157] Stoyenko,A. D., reliable real-time systems.IEEE Transactionson sofnvare Engineering SE-12(Sept.1986):940-949. N.J.: IEEE [158] Tripp, Leonard L. IEEE Standardscollection, Piscataway, Press,1994. Borland Interll59l Turbo C User's Guide Version2.0. Scotts Valley, Calif.: national,1988. for [160] Walpole,RonaldE., and RaymondH. Myers. Probability and Statistics Engineers and scientists. 2nd ed. New York: Macmillan Publishing, t978. [161] [162] of Warnier,J. D. Logical Construction Programs.New York: Van Nostrand Reinhold, 1974. Washabaugh,Douglas M., and Dennis Kafura. Incremental garbage collection of concurrentobjects for real-time applicationS. Proceedingsof the llth Real-Time systemssymposium.Lake Buena vista, Fla. (Dec. 1 9 9 0 )2 1 - 3 0 . : Wheeden,Richard L., and Antoni Zygmund. Measureand Integral. New York: Marcel Dekker, 1977. Wirth, Niklaus. Programmingin Modula-2.2nd ed. New York: SpringerVerlag,1983. Wulf, W., and Mary Shaw.Global variablesconsideredharmful. SIGPLAN Natices L 2 {J973); 28-34'

[163] [i64] [165]

Binary ree, definition, 28 Bit failures, 277 Black box testing,264-5 Blocked tasks, 181 BRANCH instructions, 38 Broadcastcommunication,133' 135 Buffer size calculation, 245-8 maximum, 248 M[\4/1 queue' 251 variable, 246-8 Buffering data,170-2 Buffering sYstem' 245 B u g s ,2 5 5 - 6 Built-in-softwaretest (BIST), 271 Built-in{est software(BITS)' 271' 2'16 Burn-in testing,267 Burst petiod, 245,248 Bursting of events, 146 Bursts of data,245-6 Bus,2 arbitration, 50 contention, 50 cycles,21-2 grant signal' 50 interface unit (BIU), 318 time-out signal, 51 transfer mechanisms, 2-3 Byzantine Generals' Problem' 286 Calling trees, 113-i4 CASE (comPuter-aidedsoftware engineering),110 Central processing unit (CPU), 2,

-3 0-address architecture, 25 I 3 1-3 1-addressarchitecture, 2-addressarchitecture, 33-5 3-addressarchitecture, 35 machine, instruction set' 26 O-address l-address machine, instruction set, 32 2-addressmachine' instruction set' 34 3-addressmachine, instruction set' 36 0-addressmachine, Programmlng'

oPeration, 4-7 structure,4 tesrifig, 27 l-2 throughput, 13 Chain reaction, i35 CheckPoints, 269-70 Checksum, 272 CICS (Customer Information 148 Control SYStem), queue (ring buffer), 171 Circular CISC (comPlex instruction sdt comPuters) architecture' 4 1-3 Class definitions' 70 Cleanroom testing, 268 cMS-2, l7 Code generation, 83-4 Code insPections,266 COHESION environment, 95 Collision,50' 175 COM variables, 63 COMMON variables, 63 Compaction' 200 Compare instructions,35-8 Compiler optimization techmques' 224-i2 combination effects' 233-4 common subexPresston elimination, 225 constant folding, 226 constant ProPagation' 229 crossjumP eliminadon' Ii:-l dead-storeeliminanon' ll9 dead-vanable ellmlnarex'- l-tr' fl ow-of-codlFoi r'OtrruDi:-ir- -li intrinsic runcc:'is- lit lmP Lr':uc-.-r :--::-rroYItF: .rtr: L\:r-.$l: -;:::f-::g.:":6 -:--:r-;g"ft-f'Ii^'tl]i i-{--

Absract data tYPing' 68-71 Accumulator, 22 Activity Packets,292 Ada, 17,60, 61, 63, 65, 66, 11' 80-1, 150, 182,324 Ada-95, 8r-2, 324' 325 Ada++, 70 Address bus, 2 Addressingmodes,21-5 ALGOL-60, 63, 66 ALGOL-W 63 Alpha testing, 267 Analog+o-digital (A/D) circuitry, 53 ANSI-C, 78, 181 Aiplication Programs, 7 Adthmetic logic unit (ALU)' 4 Arithmetic oPerations,27 Assemblers, 8 21,82-3' lI2' AssemblYlanguages, 324 Asynchronous events, 12 Automatic teller machine, 118-20

C language,l'1, 60, 61, 65, 66"13' 75-8,83, 324,326 disadvantages,78 excePtion handling, 77-8 special variable tYPes,75-6 C++ language,70,78, 324' 326 Caches,227 Call-by-address,61-2 Call-bY-name, 63 Call-bY-reference,6 1-2 Call-bY-value' 61-2 Call-bY-value-result-63

Background, 156 Background Processing, 157-8 Banker's algorithm, 185-6 B A S I C , 1 7 , 6 0 , 6 3 , 6 5 , ' 1 3 , ' 7 4 '1 9 7 Bathtub curve, 257 Beta testing, 267 BinarY angular measurement (BAM), t?1-?



Compiler optimization techniques \cont.) reduction in strength, 225 removal of dead or unreachable code,22'7-8 short-circuiting Boolean code, 230 speculative execulion, 234 use of arithmetic identities, 225 use of registers and caches,22'7 Compilers,8, 83-4 315-16 Complex systems, multimedia, 323 Computer architecturc, 2 Computer architectules, systems, multiprocessing Data flow architectures,292-4 Data flow diagrams, 120-4,133, 286,294 conventions,121 DeMarco's rules for, i21 for navigation system, 122 for nuclear plant, 123 Hatley and Pribhai's extensions,
1 a A

Index DRAGOON,70 65 Dynamicallocation, systems, 154 Dynamic-priority

Electropically erasable programmable read-only memory (EEPROM),47-8 Embedded data processor (EDP), 318 Embedded distribution systems, 283 Embedded systems, 10 Enable priority interrupt (EPI), 38-9 Enumerated types, 69 Erlang's loss formula, 253-4 ESTEREL, 60 Euclid, 326 Even parity checker, ll7 Event determinism, 12 Event flags, 181-3 Event signals,181-3 Events, 12, 144 bursting of, 146 Exception handling, 68 C language, 77-8 Executive, 143 Exponential distribution, 242, 243 Extemal fragmentation memory, 199

Computer hardware, 19-58 history, 17 prototypes/simulators,307 Computer hardware/software integration,301-13 Condition code registers (CCRs), 37 Conditional branching, 114 Conditional transfer, 37 Context, 150 Context-saving rule, 151 Context swirching, 150-l Contiguous file allocation, 204 Continuousprobability distribution. 242 Continuous random variable, 242 Continuous real-valued function, 222-3 Control flow diagram, 124 Control specifications, 124 contrbl unit (cU), 4 Cooperative multitasking systems, 148-50 Coprocessors,40-l Core memory, 44 Coroutines,148-50, 157 responsetime, 208 Counting semaphores,178-9 Critical regions, 175 Cross jump elimination, 231-2 CSML,60 Customers, 248 Cycle stealing, 46 Cyclic executive system, 149 Cycl ic redundancycode (CRC), 272-4 Cycling, 307 eychmatic c-or[plexiry, 260

Data flow processors,system specification, 293-4 Data Item Descriptions (DIDs), 99-100 Data strobe (DST), 2-3 Data transfer timing diagram, 3 Databases applications, 3 17-19 construction,3l7-18 design,317 Deadlock, 183-5 avoidance, 185-6 conditions necessaryfor, 183-4 detection of, 185-7 recovery 186-7 Death spiral, 277 DEBUG, 228 Debuggers, 307 Defects,255-6 Dernand paging, 201-3 DeMarco's rules for data flow diagrams,121 Descrete random variable, 243-4 Design, 109-40 Detailed design document, 9l Determinism,l2-13 Digital-to-analog (D/A) circuitry, 53 Direct memory access(DMA), 50-1,218,27',7 acknowledge signal (DMACK),

Failed system, definition, 9 Failure function, 257 Failures, 255-6 FALSE state, 3 Fault tolerance, 269 Faults, 255-6 Fetch-execute cycle, 5 Fiber Distributed Data Interface

controller, 50-l memory, 235 request signal (DMARQ,

50 transfer timing diagram, 51 Direct mode instructions, 22 Disable priority interrupt (DPI), 38-9 Discrete random variable, 241 Discrite signal, 3 Dispatcher, 142,149 Distributed systems, 283-91 reliability in, 286-91 DOD-STD-2I674 (ME-STD-

(FDDr), 318
204 File fragmentation, (FSA), 117, Finite stateautomata t33-4,146-:7 (FSMs),117 Finitq statemachines (FIFO),202 First-in/first-out 153-4 systems, Fixed-priority 150 Fixed-rate systems, Flash memory,48 Flip-flop, zt4-5 39, Floatingpoint instructions, 214, 215 Flow-of-control optimization,228 Flowcharts,ll2-13, ll4 156 Foreground,

Daemons, 175 Data bus, 2

Double buffering, 170 Double indirect mode addressing, 24-5


Input/output (I/O) inteirupt driven, 48, 52 memory-mapped, 49-50, 235 m e t h o d s ,, 3 , 4 8 - 5 2 2 perfcrrmance, 239 programmed, 48-9 Input space,8 Inputs, 8 Instructioncounting.213-16 Instructionexecutiontime s i m u l a t o r s2 1 7 - l l i , Instructionregister,4 Integration,30l Internal fragmentation memory, 199 Interpolation,geometric interprctation, 222-3 Interpreter, 74 Irrterrupt, definition, 6 Interrupt controllers,54-5 Interrupt disabling,211 Interrupt driven I/O, 48, 52 Interrupt driven systems,150-6 Interrupt handlers,6, 182, 191, 195 Interrupt handling,5J, 311 timing sequence, 55 Intenupt latency, 21O-12 low priority interrupts high priority,212 Interrupt register 6 Interrupt retum location, 6 Interrupt systems,144-6 response1ime, 209 Intenupt vector, 6 Intertaskcommunication,169-88 Intrinsic functions, 226 ISO Standard9000, 103-4

Foreground,ibackground systems, l 56-60 initialization, 158 major drawback, 160 real-timeoperation,158-9 response times, 160 Formal program proving, 266-1 FORTRAN, 16, 1'7 60, 61, 63_6, . t 3 - 5 . 1 1 2 ,1 9 7 ,2 1 1 ,3 2 4 Freedomspacestation,318 Function points, 263 Fusible-linkROMs, 46 Fusible links, 46-7

Languagefeatures,59-85 comparison of, 74 see also specific languap,esand specific language features Least recently used (LRU) method 202 L e v e l i n g ,l 2 l Linkers, 8 Little's law, 253 Livelock,183 LOAD instruction,25, 28, 63 Load module, 302 Local area networks (LANs), 43, 315 Locality-of-reference method, 203*4 Locksup,271 Logic analyzer, 213, 304-5 Longmp,77 Look-up tables,222-4 Loop induction elimination, 227 Loop invariant optimization, 226 Loop jamming, 231 Loop unrolling, 230-l Loosely coupled system, 10 LSB (least significantbir,220

Garbagecollection,204 Gaussian(or normal) distribtion, 242 Gaussianprobability function, 243 Generalregisters, 4 Generator poly nomial, 272 Global variables,63-4 reuse,238 GOTO statemenr, 112, 113 Granularity, 220-1 Graphicaltechniques, design precautions, l38 Group walkthrou ghs, 266

Halstead'smetrics, 261-3 Hamming code error detection and cotection,274 Hard, enor,2'72 Harells statecharts, 136-7 Heisenberg uncertainty pnnciple, 307,310-12 Hybrid systems,150, 156

McCabe's metric, 260 Machine language,20, 83 Macrocode, 5 Macroinstruction execution times, 211 Macroinstructions, 5 Mailboxes, 173-5 and semaphores,177 implementation,173-4 queues,174-5 Major cycles, 155-6 Mask registeq 6 Mathematicalspecification,11l-12 Matrix multiplication, 65 Maximum stack size, 193 Mealy FSA, 117-18 Memory, 2, 43-8 analysisof requirementsi3-1-dangerousallocation- i !-r DMA,235 'ii i--: .l d y n a m i ca l l o c a l r . - r . extemal frasm3n-'rror-- ^, fragmei--:::::. l-'i l|]le;nal lnlSneri::]:.. -+. icckine. l0-r manasement schernes-l-1nonvolatile.43

Jacksonchart, 113 Java language, 326 JOVIAL, 17 Jump instructions,35-8 conditional and unconditional, 37-8 "Jump-to-self instruction, 150 Jump unconditional absolute (JUA),

IEEE 830-1993, 104 rEEE 1003 1-1990, 164-5 IEEE standards,106 If-then structure, 147 Image processin 319-24 g, Immediate mode instructions, 22 Implied mode instructions, 22 Incidence matrix,287 In-circuit emulation (ICE), 305-6 In-circuit emulator block diagram, 308 Indexed loop construct, 132-3 Indirect memory instructions, 23 Induction v ariable, 22'7 Inertial measurementunit (IMU), 10 Information hiding, 7l Inheritance, 70


Kalman filter, 269 Kemels build or buy?, 164 definitions, 142-3 design strategies, 141-67 hierarchy. 143 role of. 142

Memory (cont ) primary or main, 3 program arca,236 RAM area, 236 secondary,3 stack area, 236 static schemes,205 rcsiLn|,272 volatile, 43 Memory addressregister (MAR), 4 Memory data register (MDR), 4 Memory-loading,201, 312 rcducing,237-8 variable selection-23r Memory-loading f actot, 236-:7 Memory management, 189-205 Memory managementmodel, 196 Memory map,234-5 Memory-mapped l/o, 49 -50, 235 Messageexchanges, 173 Message polynomia| 2'12 Methods, 70 MFT (multiprogramming with a fixed number of tasks), 198-200 Microcode, 5 Microcontroller, 20 Microinstructions, 5 Micro-kemal, 143 Micromemory,4 Microprogram, 5 Mil-Std-15538 bus standard, 52-3 Mil-Std-2167A (DOD-STD-21674'), 99-100 MIMD archiiecture, 283 Minor cycles, 155-6 MISD architecture, 282 Mismatched COMMON overlays, 64 Missed intemrpts, 276-7 Mixed listing, 214 MMll queae,249-52 buffer size calculation, 251 real-time systems, 252 Modeling techniques, advantages and disadvantages,138 M o d u l a - 2 ,l ' 7 , 6 3 , 6 5 , 6 6 , 7 1 , 79-80, 150,183 Modularity, 7l-3 MODULE,71,79 Moore finite state automaton, 117 MSB (most significant bit),22A-1 MULT1,65 MULr2, 65 Multi Bus tr, 318 Multimedia architecture, 323 Multimedia systems,321-4 Multimeters, 304 Multiple stack anangements, 193 Multiplexer, 52 Multiplexer/demul tiplexer (MDM) units,318 Multiprocessingsystems, 124, 2, 129, r7 5, 260, 281-99, 3t5 classification of computer architectures,282-3 Multiprogramming, 129 Multitasking systems,79, 124, 146, 169, r',]5.260 Mutex, 177 MUX transceivers,52-3 MVT (multiprogramming with a variable number of tasks), 200-1


Package,7 l-2 P a g ef a u l t , 2 0 1 Page frames, 201 Page stealing,201 Page table, 201 Parallel subsystems,equivalent reliability, 258 Parameterpassing, 60-73 Pamas partitioninE, 92-4, ll0, 265 Partial transition table, 120 P a s c a l ,1 7 , 6 0 , 6 I , 6 5 , 6 6 , ' 1 3 , 78-9, 83 Patching,308, 309-10 PEARL,326 Peephole optimization, 225 Petri nets, 124-9 examples,129 firing, 125 flowchart analogs,127 systolic array, 296-7 Phase-driven code, 146-8, l5'7, 208 Ping-pong buffering, 170 Pipelining, 39-40 Poissonprocess,244, 252 Polled loop systems, 144 response time, 146,208 with inrerrupts, 144-6 Polymorphism, 70 POP instruction, 27 POSIX standard,164-5, 318 Power bus, 2 keemption, 212 Preemptive priority systems, 153-5 Priority ceiling protocol (PCP), 155 Priority inversion, 155 Probability density function, 242 Probability distribution function, 241-3,248 Probe effect, 311 Process, 142 Processblocks, 258 hocessing elements, 294 Program counter (PC), 4 Program design languages (PDLs), I l5-16 Programmable logic arrays (PLAs), 46 hogrammable read-only memories (PROMs),46-7 Programmed I/O,48-9 Programming languages,324-6 Project Whirlwind, 316-17 Propagation delays, 211 Pseudocode,115-16 PUSH instruction, 28 -PUSH operation, 27

Nano-kemel, 143 Natural languages, 110-11 Nearest neighbor topolo1y, 294 Network interface unit (NIU), 318 No-op (no-operation), 5 Non-von Nuemann multiprocessing architectures, 21, 291-8 NP-completeproblems,218-19 NP-hard problem, 219 N-version programming, 271

Object-oriented programming, 70 Occam, 60 Occam-2,325 Odd parity checker, 118 Opcode (operation code), 5 Operating system, 8, 143 Operational concept document, 89 Optimization basic theory,223-32 peephole,225 techryqaes,224-32 Orbital replaceable units (ORU), 318 Qrganic distributed processing system,283 Organic systems, l0 Orthogonalstates,284 Orthogonality, 134 OS/2 PresentationManager, 148 Oscilloscope, 304 Ostrich algorithm, 186 Output space, 8 0utputs, 8 Overlaying, 198


second-order,289 third-order, 290 Resource allocation, 185 Resourcesharing, 175 Resourcetable, 174 Response time,9,207 calculation,208-10 coroutines,208 interrupt systems, 209 modelling, 252 phase-driven code, 208 polled loops, 208 reducing,219-34 Restoreroutine, 191-2 Retum from interrupt (RI), 38 RETURN instruction, 38 Retum location,38 Reverse Polish notation, 28 Ring buffers, 171-2 RISC (reduced instruction set computer) architectures,4 1-3, 282,315 Round-robin systems, 152 Run-time ring buffer, 193 Run-time stack, 190 Single-event upset (SEU), 158 protection mechanisms, 277-8 Single-processing system,2 Slowest cycle computation, 220 Smalltalk, 70 Soft enor, 272 Software concepts, 7-8 d e s i g n ,i 1 0 Heisenberg uncertainty principle, 311 history, 17 reliability, 256-63 definition, 256 simulators, 306 testing,311-12 watchdog timers, 56, I57,276, 2',77 Software Design Descriptions (SDDs), 104 Software life cycle, 87-107 concept phase, 89 designphase,91-4 functional requirements, 90 maintenancephase, 96 nonfunctional requirements,90-l nontemporal transitions, 96-8 Pamas partitioning, 92-4 phases,activities and byproducts, 88-96 programming phase, 94-5 requirements phase, 89-91 rules for requirements and design documents, 91 standards, 99-107 test phase,95-6 version control software, 94 Spacestation,Freedom,318 SPARC (Special Application of RISC) series,42 Spatial fault tolerance, 269 Specification, 109-40 mathematical,111-12 Speculative execution, 234 Spin lock, 177 Spiral software model, 98

Queues,mailboxes,i74-5 Queuing models, 241-54 Queuing system, components, 249 Queuing theory,248-52 buffer calculations, 25 1 service and production rates, 250-7

Raise operation,181 Random-accessmemory (RAM), 43 corraplion,2T2 dynamic (DRAM),43 scrubbing,157-8, 274-5 static (SRAM), 43 testing,274-6 Randomvariable, 241 Rate-monotonic analysis (RMA), 155 Rate-monotonic systems, 154 Reactive systems, 10 Read-only mernory (ROM), 43 conuption,272 testing,272-4 Read/write line, 3 Real-time computing, 16 Real-time languages.See Language features and under specific languages Real-time systems, 1 applications,3l5-26 basic cpncepts,1-18 definition, 9 design issues,14 examples,14-16 full-featured, 160-3 history, 16-17 Mlivl/l queue, 252 significant development events, 16 use of term, 10-11 Recovery blocks, 270 Recursion, 64-5 Re-entrant procedures, 65 Register direct mode instnrctions,

SABRE, 16 Sample space, 241 Sampling rate, 53 Save routine, 191-2 Scale factor, 220 Scaled arithmetic, 220-l Schedualability analysis, 84 Scheduler, 142 Scheduling, NP-complete, 2 18-l 9 Scratch pad memory, 4 Screen signature, 274 Second-orderreliability matrix, 289 Self-modifying code, 238 Semaphores, 175-80 and mailboxes, 177 counting, 178-9 primitives, 176 problems with, 179 Semiconductor memory. 44-6 Semidetachedsystem, 10 Senseline, 44 Serially reusable resources, 175 Series subsystems,equivalent reliability, 259 Servers172,248 , Setjmp, 77 Signal library function call. 182 Signal operation. 176 SIMD architectures,282

Register indirect instructions, 24 Registers, 227 Regression testing, 267 Reliability, 256-63 characterizations,256 in distributed systems, 286-91 Reliability functions, 256-8 Reliability manix;.287-9 hiiher-order, 290-1 maximum,29l

sPool-, 175
Sporadicsystems.150 Sporadic tasks, 150 Spurious interrups. 276-l Stack, 38 architecture. 15 area.136 managemen.- 190-molel. i51 operations. 21 overflos.277

Standards,software develoPment' Task-controlblock (TCB), 161-3 model, 161, 190, l96J state transitions, 162 task management, 163 task states,161 Task resource request table, 173-4 Task synchronization, 169-88 Temporal determinism, 13 Temporal fault tolerance, 269 Test-and-setinstruction, 180 Test instructions, 37 Tesr log, 303 Test probe, 269-?0 Test tools, 303-7 Testing, 263-9 black box, 264-5 cleanroom, 268 TRUE state, 2 Type definition, 69 Typing, 66-8


Starvation,154, 183 State counters, 149 State-driven code, 146-9 133-8, 284 Statecharts, depth, 134 orthogonality, 134 Statistiqally based testing, 267-8 Status register, 6

Ultraviolet read-onlY memory

(uvRoM),47 UNIT,73
Universal asynchronousrelaY terminal (UART), 52

25, sToRE, 63
Stress, tesring, 269 Strong typing,66 Structurechans, 113-14 Analysis, 110, 120 Structured SUBROUTINE, 65, 73 Subroutine instructions, 35-8 Subsystems,reliabilities, 259 Swapping, 198 Switch bounce, 1zl4 Synchronous events, 12 Syndrome,274 System, definition, 8 Systembus, 2 System concePts,8-9 System integration backoff method, 308-9 establishing a baseline, 307-8 goals, 302-3 methodology, 307-10 System-level testing, 267 Systernperformanceanalysis,207-23 System programs, 7 System reliability, 258-63 284-6 System specification, data flow processors,293-4 for wavefront Processors,298 System test suite, 267 System unifrcation, 302 System validation, 303 Systolic anay for convolution, 295 in nearest neighbor toPologY' 295 peti net,296-:1 ots, 294-7 Systolic process . Systolic systems, specification, 297

3r8,324 uNrx, 143,
User space,198 Utilization factor, definition, 13

goal of,263 memory,272 planning, 263-9 RAM, 274-6 ROM,272-4 software,311-12 statistically based, 267-8 stress,269 systemJevel, 267 unit level, 264-:7 white box, 265-6 Thrashing, 201 Threat-managementsystems, 154 Time-loading, 2O7 312 , and its measuremettt,212-18 deterministic Performance,218 instruction counting, 2 13-1 6 instruction execution time simulators,217-18 logic analYzer,2l3 pictorial representation,2 16-17 definition, 13 reducing,219-34 Time-overloaded sYstem, 13, 250 Time-relative buffering, 170-1 Time slice, 152 Timing code, 305 Timing instructions, 304-5 Transceiver,52 Transitibn Table, 118 Transputen, 298 Traps,7, 182 Tri-state condition, 50

Version control software, 94 Virtual reality (VR) systems, 320-l VLSL292,295 Von Neumann bottleneck, 39 Von Neumann computer architectures,20, j9, 282

Wait and hold condition, 185 Wait operation, 176 Wamier-Orr notation, 129-33 examples,tr31-2 Watchdog timer (WDT), 56, 157, 276,2"t7 Waterfall, 88 Wavefront processors,297-8 system specification for, 298 Weak typing, 66-8 Weibull distribu tion, 243 Weibull probabilitY densitY funcrtion, 243 -. Whirlwinil computer, 316-17 White box, testing, 265-6 Wide area networks (WANs), 315 Working sets, 203-4 World Wide Web, 113, 133

fable-driven code, 148 Task, 142

Z notation,110