locality of reference
51Scapegoat tree — In computer science, a scapegoat tree is a self balancing binary search tree, invented by Igal Galperin and Ronald L. Rivest. It provides worst case O(log n ) lookup time, and O(log n ) amortized insertion and deletion time.Unlike other self… …
52Linear probing — is a scheme in computer programming for resolving hash collisions of values of hash functions by sequentially searching the hash table for a free location. [cite book |last=Dale |first=Nell |title=C++ Plus Data Structures |year=2003… …
53Bitmap index — A bitmap index is a special kind of database index.Bitmap indexes have traditionally been considered to work well for data such as gender, which has a small number of distinct values, e.g., male and female, but many occurrences of those values.… …
54Free list — A free list is a data structure used in a scheme for dynamic memory allocation. It operates by connecting unallocated regions of memory together in a linked list, using the first word of each unallocated region as a pointer to the next. It s most …
55Loop fission — (or loop distribution) is a compiler optimization technique attempting to break a loop into multiple loops over the same index range but each taking only a part of the loop s body. The goal is to break down large loop body into smaller ones to… …
56Fragmentation (computer) — In computer storage, fragmentation is a phenomenon in which storage space is used inefficiently, reducing storage capacity. The term is also used to denote the wasted space itself.There are three different but related forms of fragmentation:… …
57Open Containers — OpenContainers (aka OC) is an open C++ containers library, similar to the C++ Standard Template Library (aka the C++ STL or STL) or Boost library.OpenContainers addresses threading issues (see below) that the STL does not. The OC also has tools… …
58Partitioned global address space — In parallel computing of computer science, the partitioned global address space (PGAS) is a parallel programming model. It assumes a global memory address space that is logically partitioned and a portion of it is local to each processor. The… …
59Lokalitätseigenschaft — In der Informatik wird mit Lokalitätseigenschaft (englisch: locality of reference) die beobachtbare Eigenschaft typischer Computerprogramme bezeichnet, in einem gewissen Zeitabschnitt nur auf einen relativ kleinen Bereich der gesamten Datenmenge… …
60Control table — This simple control table directs program flow according to the value of the single input variable. Each table entry holds a possible input value to be tested for equality (implied) and a relevant subroutine to perform in the action column. The… …
