locality of reference
21VList — En algorithmique, une VList est une structure de données persistante (conçue par Phil Bagwell en 2002), qui combine l accès rapide aux éléments (comme dans les tableaux) avec la souplesse d extension des listes simplement chaînées. Sommaire 1… …
22VList (structure de données) — VList En algorithmique, une VList est une structure de données persistante (conçue par Phil Bagwell en 2002), qui combine l accès rapide aux éléments (comme dans les tableaux) avec la souplesse d extension des listes simplement chaînées. Sommaire …
23Loop optimization — In compiler theory, loop optimization plays an important role in improving cache performance, making effective use of parallel processing capabilities, and reducing overheads associated with executing loops. Most execution time of a scientific… …
24Dynamic array — Several values are inserted at the end of a dynamic array using geometric expansion. Grey cells indicate space reserved for expansion. Most insertions are fast (constant time), while some are slow due to the need for reallocation (Θ(n) time,… …
25Block suballocation — is a feature of some computer file systems which allows large blocks or allocation units to be used while making efficient use of slack space at the end of large files, space which would otherwise be lost for other use to internal fragmentation.… …
26Иерархия памяти — Пирамида иерархии памяти. По левой грани обозначены размер и емкость, по центру  требование постоянного электропитания и длительность хранения, справа  пример памяти данного уровня, скорос …
27Cache — This article is about the computer science optimization concept. For other uses, see Cache (disambiguation). In computer engineering, a cache (  /ˈk …
28CDR coding — In computer science CDR coding is a compressed data representation for Lisp linked lists. It was developed and patented by the MIT Artificial Intelligence Laboratory, and implemented in computer hardware in a number of Lisp machines derived from… …
29Working set — Peter Denning (1968) defines “the working set of information W(t, au) of a process at time t to be the collection of information referenced by the process during the process time interval (t au, t)”. Typically the units of information in question …
30Manual memory management — In computer science, manual memory management refers to the usage of manual instructions by the programmer to identify and deallocate unused objects, or garbage. Up until the mid 1990s, the majority of programming languages used in industry… …
