2,260 technical terms and definitions
cannon algorithm distributed, strassen parallel matrix, summa matrix algorithm, block matrix decomposition parallel
Parallel Matrix Multiplication Algorithms — Parallel matrix multiplication is a cornerstone of scientific computing and machine learning, with specialized algorithms designed…
merge sort parallel, gpu merge, merge path, parallel merge algorithm
Parallel Merge Algorithms are the techniques for combining two sorted sequences into a single sorted sequence using multiple processors simultaneously — a fundamental operation…
gpu sort algorithm, bitonic sort parallel, radix sort gpu, sorting network parallel
Parallel Sorting Algorithms are the fundamental computational primitives that order N elements in O(N log N / P) time on P processors — where GPU-optimized sorts (radix sort…
bitonic sort gpu, sorting network parallel, radix sort gpu implementation, parallel sorting complexity
Parallel Sorting Algorithms are fundamental building blocks of parallel computing that exploit massive thread-level parallelism to sort arrays orders of magnitude faster than…
parallel nas, neural architecture search parallel, distributed hyperparameter, nas distributed, automated machine learning
Parallel Neural Architecture Search (NAS) is the automated machine learning methodology that searches for optimal neural network architectures across a combinatorial design space…
conjugate gradient parallel, preconditioning parallel, krylov subspace methods, parallel sparse solver
Parallel Iterative Solvers are essential for large-scale scientific computing, enabling solution of sparse linear systems (Ax=b) through iterative refinement across distributed…
prefix computation hardware, Kogge Stone, Brent Kung, parallel adder tree
Parallel Prefix Networks are fundamental circuit and algorithmic structures that compute all prefixes of an associative binary operation (such as addition carries, OR-reduction…
prefix sum, parallel scan algorithm, inclusive exclusive scan
Parallel Prefix Scan (Parallel Scan) is a fundamental parallel algorithm that computes prefix operations on an array — where each output element is the cumulative operation (sum…
inclusive exclusive scan, work efficient scan, parallel scan algorithm, prefix sum application
Parallel Prefix Sum (Scan) is the fundamental parallel computing primitive that computes all prefix sums of an input array — where prefix_sum[i] = sum(input[0..i]) for all i…
inclusive exclusive scan, blelloch scan, scan primitive parallel, prefix sum gpu
Parallel Prefix Sum (Scan) is the fundamental parallel primitive that computes all prefix sums of an input array — where output[i] = input[0] + input[1] + ... + input[i]…
prefix sum gpu, scan work efficient, blelloch scan algorithm, parallel reduce scan
Parallel Prefix Scan is a foundational parallel algorithm computing cumulative sums (or generic associative operation) across array elements with logarithmic depth, essential…
parallel scan algorithm, inclusive scan, exclusive scan, blelloch scan
Parallel Prefix Sum (Scan) is the fundamental parallel algorithm that computes all prefix sums of an input array — where element i of the output is the sum (or other associative…
inclusive exclusive scan, gpu scan algorithm, blelloch scan, work efficient scan
Parallel Prefix Sum (Scan) is the foundational parallel algorithm that computes all prefix sums of an input array in O(log N) steps — transforming [a₀, a₁, a₂, ...] into [a�…
inclusive exclusive scan, work efficient scan blelloch, gpu prefix sum parallel, scan applications parallel
Parallel Prefix Sum (Scan) is a fundamental parallel primitive that computes all prefix sums (running totals) of an array in O(n/P + log n) parallel time, transforming…
inclusive exclusive scan, work efficient scan algorithm, scan applications parallel, gpu scan implementation
Parallel Prefix Sum (Scan) is a fundamental parallel primitive that computes all partial reductions of an input array — transforming [a₀, a₁, a₂, ...] into [a₀, a₀⊕a₁, a₀⊕a₁⊕a₂…
inclusive exclusive scan, work efficient scan algorithm, blelloch scan parallel, gpu prefix sum implementation
Parallel Prefix Sum (Scan) Algorithms — The parallel prefix sum, or scan, computes all partial reductions of a sequence in parallel, serving as a fundamental building block…
parallel processing throughput scaling prediction, parallel processing throughput, processing throughput scaling, throughput scaling prediction, parallel processing
Parallel Processing Throughput Scaling Prediction with Machine Learning Introduction & Motivation Parallel Processing Throughput Scaling Prediction with Machine Learning addresses…
parallel rng, random number generation parallel, reproducible parallel random, prng parallel
Parallel Random Number Generation is the challenge of producing statistically independent, high-quality random sequences across multiple threads or processors simultaneously…
curand gpu random, parallel rng, monte carlo parallel, reproducible random parallel
Parallel Random Number Generation is the technique of producing statistically independent streams of pseudo-random numbers across multiple parallel threads or processors — where…
rng parallel, curand parallel, reproducible parallel random, prng thread safety
Parallel Random Number Generation is the computational challenge of producing independent, high-quality pseudorandom number streams across multiple parallel threads or processes…
reproducible parallel rng, counter based random generators, independent stream parallelism, threefry philox generators
Parallel Random Number Generation — Producing statistically independent and reproducible streams of random numbers across multiple threads or processes for stochastic simulations…
reduction operation, parallel sum
Parallel Reduction — a fundamental parallel algorithm that combines N elements into a single result (sum, max, min, product) using steps instead of sequential steps. Sequential vs…
gpu reduction, tree reduction parallel, warp shuffle reduction, reduction optimization
Parallel Reduction is the fundamental parallel algorithm pattern that combines N input values into a single result (sum, max, min, dot product) using a logarithmic-depth tree…
tree reduction, warp shuffle reduction, parallel sum, reduction kernel
Parallel Reduction is the fundamental parallel algorithm that combines N input elements into a single output value using an associative binary operator (sum, max, min, AND, OR)…
tree reduction patterns, work efficient scan, segmented reduction operations, warp shuffle reduce
Parallel Reduction Algorithms — Techniques for combining a collection of values into a single result using an associative operator, executed across multiple processing elements…
parallel robot mechanism, parallel robot, robot mechanism
Parallel Robot Mechanism Introduction & Motivation Parallel Robot Mechanism addresses a central problem in robotics process control and parallel-mechanism-closed-loop prediction…
optimization
Parallel Sampling is the generation of multiple candidate continuations simultaneously for selection or aggregation - It is a core method in modern semiconductor AI serving…
discrete event parallel simulation, time warp optimistic simulation, parallel monte carlo methods, distributed simulation synchronization
Parallel Simulation Methods — Techniques for distributing simulation workloads across multiple processors to accelerate the modeling of complex systems, from physical phenomena…
parallel sort algorithm, gpu sort
Parallel Sorting Algorithms — sorting large datasets across multiple cores or GPUs, where traditional sequential sorts (quicksort, mergesort) must be redesigned to exploit…
gpu sort, bitonic sort parallel, radix sort parallel, merge sort parallel
Parallel Sorting Algorithms are the class of sorting algorithms designed to exploit multiple processors or GPU cores to sort N elements in O(N log N / P) time on P processors…
bitonic sort merge sort parallel, radix sort gpu implementation, sample sort distributed, parallel sort scalability
Parallel Sorting Algorithms are specialized sorting techniques designed to exploit multiple processing units for sorting large datasets faster than sequential O(N log N)…
parallel sort, sample sort, merge sort parallel
Parallel Sorting Algorithms are sorting methods designed to efficiently distribute the work of ordering n elements across p processors, achieving O(n log n / p) computation…
bitonic sort parallel, merge sort parallel, radix sort gpu parallel, sample sort distributed
Parallel Sorting Algorithms are sorting methods designed to exploit multiple processing elements simultaneously, distributing comparison and data movement operations across…
distributed merge sort, parallel quicksort partitioning, sample sort scalable, bitonic sorting network
Parallel Sorting Algorithms — Parallel sorting exploits multiple processors to sort large datasets faster than sequential algorithms, with different approaches offering varying…
distributed sort, sample sort parallel, merge sort parallel distributed
Distributed Parallel Sorting is the algorithmic problem of sorting a dataset too large for a single machine across multiple nodes in a distributed system, requiring efficient data…
parallel merge sort, bitonic sort, radix sort parallel, sample sort
Parallel Sorting Algorithms are the foundational parallel computing primitives that order N elements across P processors in O((N log N)/P + overhead) time — where the "overhead"…
sparse linear solver, sparse computation gpu, csr csc format, spmv sparse matrix vector
Parallel Sparse Matrix Computation is the high-performance computing discipline focused on efficient parallel algorithms for sparse matrices — matrices where the vast majority…
sparse matrix vector multiply, compressed sparse row parallel, graph partitioning sparse computation, load balancing irregular sparsity
Parallel Sparse Matrix Operations — Techniques for efficiently distributing and computing with matrices containing predominantly zero entries across multiple processors…
stencil parallel, wavefront parallelism, diamond tiling, stencil kernel, finite difference stencil
Parallel Stencil Computation is the high-performance computing pattern for algorithms where each output element is computed from a fixed neighborhood (stencil) of input elements…
halo exchange, ghost cell, stencil optimization, structured grid parallel
Parallel Stencil Computation is the numerical method where each grid point is updated based on a fixed pattern of neighboring values (the stencil) — ubiquitous in computational…
stencil optimization gpu, halo exchange stencil, temporal blocking stencil, structured grid computation
Parallel Stencil Computation is the structured-grid numerical technique where each grid point's value is updated based on a fixed pattern of neighboring values — fundamental…
stateful stream parallelism, exactly once streaming, windowed stream scaling, distributed event processing
Parallel Stream Processing is the runtime architecture for continuous low latency processing of high volume event streams across many workers. What It Covers Core concept…
reliability
Parallel system reliability is the reliability of a system with redundant paths where operation continues if at least one path survives - Parallel structure increases system…
signal & power integrity
Parallel Termination is termination connected at the receiver side to match line impedance directly - It provides strong reflection suppression at the load endpoint. What Is…
tree traversal parallel, parallel tree reduction, tree construction parallel, bvh parallel
Parallel Tree Algorithms are the techniques for constructing, traversing, and computing on tree data structures using multiple processors simultaneously — challenging because…
tree traversal parallelism, euler tour technique, parallel tree contraction, balanced parentheses tree encoding
Parallel Tree Algorithms are the techniques for constructing, traversing, and computing on tree data structures using multiple processors simultaneously — challenging because…
audio & speech
Parallel WaveGAN is a non-autoregressive GAN-based waveform generator conditioned on acoustic features - Parallel generation uses adversarial and spectral losses to synthesize…
simd, simt
SIMD (Single Instruction Multiple Data) and SIMT (Single Instruction Multiple Thread) are parallel execution models where GPUs excel, enabling the massive parallelism required…
parallelization granularity selection in ml compiler, parallelization granularity selection, granularity selection ml, selection ml compiler, parallelization granularity
Parallelization Granularity Selection in ML Compiler Introduction & Motivation Parallelization Granularity Selection in ML Compiler addresses a central problem in ml-compiler…
parallelization and multicore scaling, parallelization multicore scaling, parallelization multicore, multicore scaling
Parallelization and Multicore Scaling Introduction & Motivation Parallelization and Multicore Scaling addresses a central problem in performance-optimization process control…