Computer data storageComputer data storage or digital data storage is the retention of digital data via technology consisting of computer components and recording media. Digital data storage is a core function and fundamental component of computers. Generally, the faster and volatile storage components are referred to as "memory", while slower persistent components are referred to as "storage".
Branch (computer science)A branch, jump or transfer is an instruction in a computer program that can cause a computer to begin executing a different instruction sequence and thus deviate from its default behavior of executing instructions in order. Branch (or branching, branched) may also refer to the act of switching execution to a different instruction sequence as a result of executing a branch instruction.
Computer memoryComputer memory stores information, such as data and programs, for immediate use in the computer; instructions fetched by the computer, and data fetched and stored by those instructions, are located in computer memory. The terms memory, main memory, and primary storage are also used for computer memory. Computer memory is often referred to as RAM, meaning random-access memory, although some older forms of computer memory, such as drum memory, are not random-access.
CPU cacheA CPU cache is a hardware cache used by the central processing unit (CPU) of a computer to reduce the average cost (time or energy) to access data from the main memory. A cache is a smaller, faster memory, located closer to a processor core, which stores copies of the data from frequently used main memory locations, avoiding the need to always refer to main memory which may be tens to hundreds of times slower to access.
Random-access memoryRandom-access memory (RAM; ) is a form of electronic computer memory that can be read and changed in any order, typically used to store working data and machine code.
Branch predictorIn computer architecture, a branch predictor is a digital circuit that tries to guess which way a branch (e.g., an if–then–else structure) will go before this is known definitively. The purpose of the branch predictor is to improve the flow in the instruction pipeline. Branch predictors play a critical role in achieving high performance in many modern pipelinedmicroprocessor architectures. Two-way branching is usually implemented with a conditional jump instruction.
Base addressIn computing, a base address is a memory address serving as a reference point ("base") for other addresses. For example, the address of the beginning of a data structure could be used as the base address for references to elements of that structure. Related addresses can be accessed using an addressing scheme. Under the relative addressing scheme, to obtain an absolute address, the relevant base address is taken and an offset (aka displacement) is added to it.Array (data structure)In computer science, an array is a data structure consisting of a collection of elements (values or variables), of the same memory size, each identified by at least one array index or key, the collection of which may be a tuple, known as an index tuple. In general, an array is a mutable and linear collection of elements with the same data type.
Computer scienceStudy of computationFundamental areas of computer scienceProgramming language theoryComputer architectureArtificial intelligenceComputational complexity theoryComputer science is the study of computation, information, and automation, together with their associated phenomena.
Disjoint setsIn set theory in mathematics and formal logic, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the empty set. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets, while {1, 2, 3} and {3, 4, 5} are not disjoint. A collection of two or more sets is called disjoint if any two distinct sets of the collection are disjoint.Cache control instructionIn computing, a cache control instruction is a hint embedded in the instruction stream of a processor intended to improve the performance of hardware caches, using foreknowledge of the memory access pattern supplied by the programmer or compiler. They may reduce cache pollution, reduce bandwidth requirement, and bypass latencies, by providing better control over the working set. Most cache control instructions do not affect the semantics of a program, although some can.PredictabilityPredictability is the degree to which a correct prediction or forecast of a system's state can be made, either qualitatively or quantitatively.*As an Amazon Associate I earn from qualifying purchases.