A Dictionary of
`
`Computing
`
`
`
`FOURTH EDITION
`
`
`
`Oxford New York
`
`OXFORD UNIVERSITY PRESS
`
`1997
`
`Netflix, Inc. - Ex. 1048, Page 000001
`IPR2021-01319 (Netflix, Inc. v. CA, Inc.)
`
`Netflix, Inc. - Ex. 1048, Page 000001
`IPR2021-01319 (Netflix, Inc. v. CA, Inc.)
`
`Exhibit 41
`
`Exhibit 1048
`
`

`

`issued by the CopyrightLicensing Agency. Enquiries concerning
`reproduction outside these terms and in other countries shouldbe
`sent to the Rights Department,Oxford University Press,
`.- atthe address above
`
`This bookis sold subject to the condition thatit shall not, by way
`oftrade or otherwise, be lent, re-sold, hired out or otherwise circulated
`without the publisher's prior consentin anyform ofbinding or cover
`other than that in which it is published and withouta similar condition
`including this condition being imposed on the subsequent purchaser
`
`~
`
`British Library Cataloguing in Publication Data
`Data available
`
`Library of Congress Cataloging in Publication Data
`Data available
`
`ISBN 0-19-280046-9
`
`13579108642
`
`Printed in Great Britain by
`Biddles Lid
`Guildford and King’s Lynn
`
`Netflix, Inc. - Ex. 1048, Page 000002
`IPR2021-01319 (Netflix, Inc. v. CA, Inc.)
`
`Netflix, Inc. - Ex. 1048, Page 000002
`IPR2021-01319 (Netflix, Inc. v. CA, Inc.)
`
`

`

`ating the theorems that must be proven in
`order to demonstrate that *preconditions
`and *postconditions are consistent with the
`semantics of the statements to which they
`relate. The theorem proveris then responsi-
`ble for proving these verification conditions.
`Different mechanical verifiers vary con-
`siderably in their capabilities. A relatively
`simple verifier might require that assertions
`giving all relevant information are attached
`between every pair of successive statements
`(simple or compound), and would present
`any nontrivial verification conditions to the
`user for manualproof; this approachis some-
`Himes called an assertion checker. A more
`sie mechanical verifier requires
`Verification toeaps Bee Par fa
`me cliar ae only the inputassertion
`ot bes inte and is able to generate
`Further,
`the aoe ASEETHONSas necessary.
`Proving. conan orem Prover is capable of
`pethaps me ex verification conditions,
`lemma to
`nting only the occasional
`€ user for confirmation
`Mechatronics AN engineering discipline that
`attempts to j
`8
`P
`ntegrate technologies from
`
`service, operating at 2.048 and 8.192 Mbps.
`International Megastream is offered at
`speeds between 1.536 and 2.048 Mbps. See
`also Kilostream.
`
`member (element) of a *set S. An object x
`that is in S, usually denoted by x € S. One of
`the basic actions that can be. performed on
`sets is asking whetherornot an objectis in a
`set. See also operationson sets.
`memberdisk A disk that is under the control
`of array management software (see disk
`array). Disk drives may be array membersfor
`part of the time and beused as conventional
`disk drives otherwise. See also RAID.
`memory A device or medium that can retain
`information for subsequentretrieval. The
`term is synonymous with storage and store,
`althoughit is most frequently used for refer-
`ringto the internal storage ofa computer that
`can be directly addressed by operating
`instructions. See main memory, cache, semi-
`conductor memory, memory hierarchy,
`memory management.
`memory card An *add-in card containing
`memorychipseither directly mounted onthe
`Netflix, Inc. - Ex. 1048, Page 000003
`IPR2021-01319 (Netflix, Inc. v. CA, Inc.)
`
`Netflix, Inc. - Ex. 1048, Page 000003
`IPR2021-01319 (Netflix, Inc. v. CA, Inc.)
`
`

`

`man,jerryFeityry there are significant dif-
`
`300
`memoryfill An aid to
`Program debugging i
`which every location
`in the Memoryjs filed
`with a predetermined character before
`pb:
`overwritten by the incoming Program, i
`memory guard A form of hardwa
`‘
`nter.
`lock used in some systems to con :
`trolaccess to
`memory that
`is currently jn
`volved in
`peripheral transfer. At the tim
`€ of initiating
`the transfer the channel sets
`an indication
`that the buffer area is associ
`ated With the
`transfer;
`this indication is cleared
`channel on completion of the tiainteehe
`attempt to access the buffer area (other flan
`by the channel) will Suspend the Satie
`attempting to access the buffer until
`th
`transfer has been completed,
`°
`
`+ I
`
`ferencesin the timeto read or write the con-
`tents ofa particular *location in memory, the
`amount ofinformation thatis read or written
`onagiven occasion,the total volumeofinfor-
`mation that can be stored, and the unit costs
`of storing a given amountofinformation. To
`optimize its use and to achieve greater effi-
`ciency and economy, memory is organizedin
`a hierarchy with the highest performance and
`in general the most expensive devices at the
`top, and with progressively lower perfor-
`mance andless costly devices in succeeding
`layers. The contents of a typical memory
`hierarchy, and the way in which data moves
`between adjacent layers, might be organized
`as follows.
`1. Register — A single word held in each
`*register of the *processor; typically a word
`contains 4 bytes. This is sometimes not
`thoughtofas part ofthe hierarchy.
`2. Cache — Groups of words within the
`*cache; typically a single group in the cache
`will hold 64 words (say 256 bytes), and there
`will be, say, 1024 such groups, giving a total
`cache of 256 Kbytes. Single words pass
`between the cache and registers within the
`processor. All transfers into and out of the
`cache are controlled entirely by hardware.
`-
`3. Main memory — Words within the ma
`(*random-access) memory. Ona very hig
`s of words corre-
`performancesystem, groups
`he are
`sponding to a group within the ca¢
`
`Netflix, Inc. - Ex. 1048, Page 000004
`ace
`IPR2021-01319 (Netflix, Inc. v. CA, Inc.)
` —a—
`
`MEMORY COMPACTION
`
`card or arranged in *SIMMS that plug into
`sockets on the card.
`
`memory compaction (block compaction)
`Any of several methods used to relocate
`information blocks in main memoryin order
`to maximize the available free space in the
`memory. See also storage allocation.
`memory cycle 1. The complete sequence of
`events for a unit of memoryto go from a qui-
`escent state through a read and/or write
`phase and backto a quiescentstate.
`is
`2. The minimum length of time that
`required between successive accesses(read or
`write) toa memory. See also cycle.
`memory data register (MDR) A ‘register
`used for holding information (either pro-
`gram words or data words) that is in the
`processofbeing transferred from the memo-
`ry to the central processor, or vice versa.
`memory dumpA representation, which can
`be read by a person, of the contents at some
`time of some part of the main memory of a
`computersystem.A variety of representation
`formats might be employed; but typically
`these would all be relatively low-level — e.g.
`purely numeric or assembler-code format. A
`memory dumpis normally taken for *post-
`mortem purposes.
`memory element A device that stores one
`item of information:if it has g stable statesit
`is said to be *q-ary, and if g = 2 it is said to be
`binary. It is usually implemented electroni-
`cally, sometimes with the assistance of the
`magnetic, optical, or acoustic properties of a
`storage medium.In practice, most memory
`elementsare binary, In fast computercircuit-
`ry, the *flip-flop is the most commontype of
`memory element.
`Memory elements are employed specifi-
`cally in computer memories and generally in
`*sequential circuits. A memory element is
`any smallest part of such a system that pos-
`sesses more than onestable state. For exam-
`ple, a binary *shift register contains four
`flip-flops and has 16 states, but each of its
`four memory elements has only two states; a
`similar ternary shift register would have 81
`states, but wouldstill consist of four memory
`elements, each havingthreestates,
`
`Netflix, Inc. - Ex. 1048, Page 000004
`IPR2021-01319 (Netflix, Inc. v. CA, Inc.)
`
`