27,049 technical terms and definitions
graph processing parallel, bfs parallel, pagerank parallel, graph partitioning parallel
Parallel Graph Algorithms are the parallel implementations of graph analysis operations — BFS, shortest path, PageRank, connected components, community detection — that must…
bfs parallel, graph processing gpu, vertex centric, graph partitioning parallel
Parallel Graph Algorithms are the class of algorithms that process graph structures (nodes and edges) across multiple processors — where the irregular, data-dependent access…
bfs parallel, pagerank parallel, graph processing framework, graph partitioning parallel
Parallel Graph Algorithms are the parallel computing techniques for processing large-scale graph structures (social networks, web graphs, knowledge graphs, circuit netlists)…
graph parallel processing, bfs parallel, graph analytics parallel
Parallel Graph Algorithms address the unique challenges of processing graph-structured data on parallel hardware, where irregular memory access patterns, poor locality, low…
distributed bfs traversal, graph partitioning parallel, parallel shortest path, vertex centric graph processing
Parallel Graph Algorithms — Parallel graph processing addresses the challenge of efficiently traversing and analyzing large-scale graph structures across multiple processors…
graph500 benchmark, push pull bfs traversal, csr sparse graph, gpu graph processing
Parallel Graph Analytics: Leveraging CSR Format and GPU Acceleration — a comprehensive approach to high-performance graph computation on modern hardware Parallel graph analytics…
parallel breadth first search, graph partitioning parallel, direction optimizing bfs, level synchronous bfs
Parallel Graph BFS (Breadth-First Search) is the foundational parallel graph traversal algorithm that explores all vertices at distance d from the source before visiting vertices…
gnn distributed training, graph sampling parallel, message passing parallel, gnn scalability
Parallel Graph Neural Network (GNN) Training is the distributed computing challenge of scaling graph neural network training to large-scale graphs (billions of nodes and edges)…
graph partitioning distributed, balanced graph cut, METIS partitioning
Parallel Graph Partitioning is the problem of dividing a graph's vertices into k roughly-equal-sized subsets (partitions) while minimizing the number of edges crossing partition…
pregel vertex centric model, graph partitioning distributed, graphx spark processing, bulk synchronous parallel graph
Parallel Graph Processing Frameworks are distributed computing systems designed to efficiently execute iterative algorithms on large-scale graphs by partitioning vertices…
concurrent hashmap, lock free hash, parallel hash table, concurrent dictionary
Parallel Hash Tables are concurrent data structures that allow multiple threads to simultaneously insert, lookup, and delete key-value pairs with minimal contention — requiring…
concurrent hashmap, lock free hash, gpu hash table, concurrent hash map
Parallel Hash Tables are the concurrent data structures that allow multiple threads to simultaneously insert, lookup, and delete key-value pairs with high throughput and low…
concurrent hash map, lock free hash, gpu hash table, cuckoo hashing parallel
Parallel and Concurrent Hash Tables are the data structures that enable multiple threads to simultaneously insert, lookup, and delete key-value pairs with O(1) average-case time…
concurrent hash map, lock free hash, gpu hash table, parallel dictionary
Parallel Hash Tables are the concurrent data structures that enable multiple threads to perform insert, lookup, and delete operations simultaneously on a shared key-value store…
convolution parallel, gpu image filter, parallel pixel processing, image pipeline parallel
Parallel Image Processing is the application of parallel computing to pixel-level and region-level operations on digital images — where the inherent data parallelism of images…
code ai
Parallel Inheritance Hierarchies is a code smell where two separate class hierarchies mirror each other in lockstep — every time a new subclass is added to Hierarchy A…
parallel integration simultaneous processing prediction, parallel integration simultaneous, integration simultaneous processing, simultaneous processing prediction
Parallel Integration Simultaneous Processing Prediction with Machine Learning Introduction & Motivation Parallel Integration Simultaneous Processing Prediction with Machine…
lustre parallel filesystem, hdf5 parallel, mpi io, parallel file access
Parallel I/O and Parallel File Systems are the storage technologies and programming interfaces that enable hundreds to thousands of compute nodes to read and write data…
lustre parallel file system, hpc storage parallel, mpi io parallel, gpfs spectrum scale
Parallel I/O and File Systems are the storage infrastructure that enables thousands of compute nodes to simultaneously read and write data at aggregate bandwidths of hundreds…
lustre parallel file system, mpi io collective operations, striping parallel storage, hdf5 parallel data format
Parallel I/O and File Systems — Parallel I/O systems distribute data across multiple storage devices and enable concurrent access from many compute nodes, addressing…
mpi io parallel file system, parallel file system architecture, io bandwidth optimization hpc, burst buffer io acceleration
Parallel I/O and File Systems are the storage infrastructure technologies that enable thousands of compute nodes to simultaneously read and write data to shared storage…
collective io tuning, file striping parallel fs, metadata scaling io, hpc io performance
Parallel IO Optimization is the performance engineering of shared storage access patterns in large scale parallel applications. What It Covers Core concept: tunes collective…
parallel file system, lustre gpfs, io bandwidth scaling
Parallel I/O Optimization is the set of techniques for efficiently reading and writing data across parallel file systems and storage devices in HPC and data-intensive computing…
parallel file system, lustre parallel, hdf5 parallel, io bottleneck hpc
Parallel I/O and Storage Systems are the hardware and software architectures that enable multiple processes to simultaneously read and write data to storage — essential for HPC…
distributed lu, scalapack, parallel linear algebra, parallel cholesky
Parallel Matrix Factorization is the distributed computation of matrix decompositions (LU, Cholesky, QR, SVD) across multiple processors — fundamental to scientific computing…
lu cholesky factorization parallel, dense linear algebra parallel, scalapack parallel, distributed matrix computation
Parallel Dense Linear Algebra is the high-performance computing discipline that implements matrix operations (LU, Cholesky, QR factorization, eigenvalue decomposition, SVD) on…
gemm, blas library, high performance matrix, matmul optimization
Parallel Matrix Multiplication (GEMM) is the operation C = α×A×B + β×C for dense matrices — the most important computational kernel in high-performance computing, deep learning…
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…