Memory Management Glossary
A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
All
absolute address, activation frame, activation record, activation stack, active, address, address space, address space layout randomization, address translation cache, address-ordered first fit, aging space, algebraic data type, alignment, alive, allocate, allocation frame, allocation mechanism, allocation pattern, allocation point, allocation point protocol, allocation policy, allocation strategy, allocator, ambiguous reference, ambiguous root, arena, arena class, ASLR, assertion, asynchronous garbage collector, ATC, atomic object, automatic memory management, automatic storage duration,
backing store, barrier (1), barrier (2), barrier hit, base pointer, best fit, BIBOP, big bag of pages, binary buddies, bit array, bit table, bit vector, bitmap, bitmap marking, bitmapped fit, bitmask, bitset, black, blacklisting, black-listing, block, bounds error, boxed, break-table, brk, broken heart, bucket, buddy system, buffer, bus error, byte (1), byte (2), byte (3), byte (4),
C89, C90, C99, cache (1), cache (2), cache memory, cache policy, caching (3), cactus stack, card, card marking, cell, Cheney collector, Cheney scan, clamped state, client arena, client object, client pointer, client program, closure, coalesce, cold end, collect, collection, collection cycle, collector (1), collector (2), color, colour, commit limit, committed (1), committed (2), compactifying, compaction, composite object, comprehensive, concurrent garbage collection, condemned set, connected, cons (1), cons (2), conservative garbage collection, constant root, constructor (1), constructor (2), continuation, control stack, cool, copying garbage collection, core, creation space, critical path, crossing map, cyclic data structure,
dangling pointer, data stack, dead, deallocate, debugging pool, deferred coalescing, deferred reference counting, dependent object, derived pointer, destructor (1), destructor (2), DGC, direct method, dirty bit, distributed garbage collection, double buddies, double free, doubleword, doubly weak hash table, DRAM, dynamic allocation, dynamic extent, dynamic memory, dynamic RAM,
ecru, edge, entry table (1), entry table (2), exact garbage collection, exact reference, exact root, exact segregated fit, execution stack, exit table, extent, external fragmentation,
fencepost, fence post, fencepost error, fence post error, Fibonacci buddies, FIFO-ordered first fit, file mapping, finalization, finalized block, first fit, fix, flip, floating garbage, foreign code, format, format method, formatted object, forward method, forwarding marker, forwarding object, forwarding pointer, fragmentation, frame, free (1), free (2), free (3), free (4), free block, free block chain, free list, free store, freestore, from space, fromspace, function pointer, function record,
garbage, garbage collection, garbage collector, GB, GC, General Protection Fault, generation, generation chain, generation scavenging, generational garbage collection, generational hypothesis, gigabyte, good fit, GPF, grain, graph, gray, grey, gray list, grey list,
handle, header, heap, heap allocation, hit, hit rate, hot, hot end, huge page,
immediate data, immune set, immutable, immutable object, in-band header, in parameter, in/out parameter, incremental garbage collection, incremental update, indefinite extent, indexed fit, indirect method, infant mortality, inline allocation (1), inline allocation (2), inter-generational pointer, interior pointer, internal fragmentation, invalid page fault, inverted page table, inverted page-table, is-forwarded method,
kB, keyword argument, kilobyte,
large object area, large page, leaf object, leak, life, lifetime, LIFO-ordered first fit, limited-field reference count, linear addressing, live, load, locality of reference, location, location dependency, lock free, logical address, longword,
machine word, main memory, malloc, manual memory management, mapped, mapping, mark-compact, mark-sweep, mark-and-sweep, marking, MB, megabyte, memoization, memory (1), memory (2), memory (3), memory (4), memory bandwidth, memory cache, memory hierarchy, memory leak, memory location, memory management, Memory Management Unit, memory manager, memory mapping, memory protection, message, message queue, message type, misaligned, miss, miss rate, mmap, MMU, mostly-copying garbage collection, mostly-exact garbage collection, mostly-precise garbage collection, moving garbage collector, moving memory manager, mutable, mutator,
nailing, natural alignment, nepotism, next fit, new space, newspace, node, non-moving garbage collector, non-moving memory manager, nursery generation, nursery space,
object, object format, object pointer, off-white, old space, oldspace, one-bit reference count, opaque type, out parameter, out-of-band header, overcommit, overwriting error,
padding, padding method, padding object, page, page fault, page marking, page protection, page table, paged in, paged out, paging, palimpsest, parallel garbage collection, parked state, perfect fit, phantom reachable, phantomly reachable, phantom reference, physical address, physical address space, physical memory (1), physical memory (2), physical storage, pig in the python, pig in the snake, pinning, placement policy, platform, plinth, pointer, pool, pool class, postmortem state, precise garbage collection, precise reference, precise root, premature free, premature promotion, premature tenuring, primary storage, promotion, protectable root, protected, protection, protection exception, protection fault, protection violation,
RAM, random access memory, ramp allocation, rank, rash, raw, reachable, read barrier, read fault, read-only memory, real memory (1), real memory (2), reclaim, recycle, reference, reference counting, reference object, region inference, register, register set partitioning, relocation, remembered set, remote reference, replicating garbage collector, reserved, resident, resident set, result code, resurrection, ROM, root, root description, root mode, root set,
sbrk, scalar data type, scan, scan method, scan state, scavenging garbage collection, SDRAM, segmentation violation, segmented addressing, segregated allocation cache, segregated fit, segregated free list, segregated free-list, semi-conservative garbage collection, semi-space, semi-space collector, sequential fit, sequential store buffer, shared memory, simple object, simple segregated storage, size, size class, skip method, smart pointer, snap-out, snapshot at the beginning, soft reference, softly reachable, space leak, spare commit limit, spare committed memory, spaghetti stack, splat, split, SRAM, SSB, stack, stack allocation, stack frame, stack record, static allocation, static memory (1), static memory (2), static object, static RAM, static storage duration, stepper function, sticky reference count, stop-and-copy collection, storage, storage hierarchy, storage level, storage management, store (1), store (2), stretchy vector, strict segregated fit, strong reference, strong root, strong tri-color invariant, strong tri-colour invariant, strong tricolor invariant, strong tricolour invariant, strongly reachable, suballocator, subgraph, superpage, sure reference, swap space, swapped in, swapped out, swapping, sweeping, synchronous garbage collector,
tabling, tag, tagged architecture, tagged reference, TB (1), TB (2), telemetry filter, telemetry label, telemetry stream, tenuring, terabyte, termination, thrash, thread, threatened set, TLB, to space, tospace, trace, tracing garbage collection, translation buffer, translation lookaside buffer, transparent alias, transparent type, transport, transport snap-out, treadmill, tri-color invariant, tri-colour invariant, tricolor invariant, tricolour invariant, tri-color marking, tri-colour marking, tricolor marking, tricolour marking, two-space collector, two space collector, type-accurate garbage collection, type punning,
unaligned, unboxed, unclamped state, undead, unmapped, unprotected, unreachable, unsure reference, unwrapped, use after free,
value object, variety, vector data type, virtual address, virtual address space, virtual memory, virtual memory arena, visitor function, VM (1), VM (2),
weak-key hash table, weak-value hash table, weak hash table, weak reference (1), weak reference (2), weak root, weak tri-color invariant, weak tri-colour invariant, weak tricolor invariant, weak tricolour invariant, weakly reachable, weighted buddies, weighted reference counting, white, word, working set, worst fit, wrapped, wrapper, write barrier, write fault,