Concepts
5,907Terms and methods explained by more than one lecturer. Each opens at the minute it is taught.
Systems & CS
41- Moore's lawThe observation that the number of transistors that can fit on a chip doubles approximately every two years.
- ModuleA WebAssembly package containing procedural game or server logic that can be dynamically updated at runtime.
- Digital signaturesA cryptographic mechanism to verify the authenticity and integrity of a message using a secret key to sign and a public key to verify.
- LatencyThe time delay between a request for data and the response.
- VectorizationThe process of converting scalar operations into SIMD (Single Instruction, Multiple Data) operations to improve performance.
- SIMDSingle Instruction, Multiple Data, a technique where a single CPU instruction performs the same operation on multiple data points simultaneously.
- CAP theoremA theorem stating that a distributed database can simultaneously provide at most two of three guarantees: Consistency, Availability, and Partition Tolerance.
- ConsensusAn algorithm where several nodes want to come to an agreement about a single value or proposal.
- HypergraphA generalization of a graph where edges can connect any number of vertices, used to represent coupling among subsets of subsystems.
- VariableA named storage location in memory that holds a value.
- ThroughputThe amount of data or number of queries a system can process in a given time.
- Write-ahead logA recovery protocol where change records are written to a separate log file before database pages are flushed to disk.
- CompilerA program that translates one language to another, such as source code to machine code.
- Cost modelAn internal cost representation used by the optimizer to estimate and compare the physical execution cost of different query plans given a database state.
- Io_uringAn asynchronous I/O interface for Linux that uses submission and completion queues to bypass system call overhead.
- Log sequence numberA unique identifier for a log record in a database, used to track the state of the database and ensure consistency.
- RdtscAn x86 instruction that reads the time-stamp counter in hardware, returning clock cycles since boot.
- Symbolic executionA technique for analyzing a program by treating inputs as symbolic variables rather than concrete values to explore all possible execution paths.
- RowHammerA phenomenon where repeatedly activating and deactivating a DRAM row causes disturbance errors in adjacent or neighboring rows.
- ShardingA technique for scaling a database by partitioning data across multiple servers, where each server holds a subset of the data.
- Dependent typesTypes that depend on values, representing more powerful type systems being adopted into languages like Haskell.
- ETLThe process of extracting data from operational sources, transforming it to a standard format, and loading it into a data warehouse.
- Flow stateA mental state where everything is just working and the user is deeply immersed in the activity.
- PAX (partition attributes across)A storage layout that combines row-based and column-based storage by partitioning data into pages and then storing attributes within those pages in a columnar format.
- AVX-512Intel's 512-bit SIMD extensions providing new instructions for data conversions, scatter, and permutations, split into selectively provided groups.
- CohortA group of nodes in a distributed system that participate in a consensus protocol together.
- Data warehouseA centralized repository for storing and analyzing large volumes of structured data.
- DMADirect Memory Access is a feature that allows hardware peripherals to access system memory independently of the CPU.
- Fault injectionThe practice of intentionally introducing random errors and degraded environmental conditions to verify that a system does not break.
- Intermediate representationA data structure or code representation used by a compiler to bridge the gap between high-level source code and low-level machine code.
- LLVM IRThe intermediate representation used by LLVM where most compiler optimizations take place before emitting machine code.
- Logical replicationAn API that applications use to get a logical representation of the write-ahead log in the form of inserts, updates, and deletes.
- MapReduceA programming model for processing large data sets with a parallel, distributed algorithm on a cluster.
- Neuromorphic computingComputing architectures that operate based on triggers and events rather than a fixed clock rate, similar to the human brain.
- Processing-using-memoryA PIM approach that uses the analog operational principles of memory cells to perform computation.
- Reference monitorAn external mechanism that checks every action an agent takes outside of the model itself.
- Reverse engineeringThe process of taking machine code or compiled binary and converting it back into source code.
- SegmentationA memory management technique that divides memory into segments, each with a base address and a limit.
- Side channel analysisAn implementation attack that measures physical quantities like power consumption or timing behavior to extract secret keys.
- Taint trackingTracking sensitive data as it flows through the system to prevent unauthorized transmission over the network.
- TranspilationThe process of converting source code from one programming language or dialect to another.