No article text was recorded for this version.
synchronization overhead (concurrency control overhead)
Version 1 of 125 papers26 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Edge Partitioning in Parallel Structured Duplicate Detection
- Blog: The Research on Topological Reconstruction Method of Triangular Mesh under Multi-core Environment
- Blog: To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations
- Blog: Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm
- Blog: A fully data parallel WFST-based large vocabulary continuous speech recognition on a graphics processing unit
- Blog: Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages
- Blog: RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs
- Blog: Parallel Structured Duplicate Detection
- Blog: Fast Iterative Graph Computation with Block Updates
- Blog: NXgraph: An efficient graph processing system on a single machine
- Blog: ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms
- Blog: WolfPath: Accelerating Iterative Traversing-Based Graph Processing Algorithms on GPU
- Blog: Parallel Correlation Clustering on Big Graphs
- Blog: Pre-initialized composition for large-vocabulary speech recognition
- Blog: Betweenness Centrality is more Parallelizable than Dense Matrix Multiplication
- Blog: Composing Finite State Transducers on GPUs
- Blog: $\texttt{FlashSchNet}$: Fast and Accurate Coarse-Grained Neural Network Molecular Dynamics
- Blog: The Power of Pivoting for Exact Clique Counting
- Blog: Parallel Array-Based Single- and Multi-Source Breadth First Searches on Large Dense Graphs
- Blog: DPU: DAG Processing Unit for Irregular Graphs With Precision-Scalable Posit Arithmetic in 28 nm
- Blog: A Distributed $(2+ε)$-Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds
- Blog: Parallel Algorithms for Operations on Multi-Valued Decision Diagrams
- Blog: Efficient parallel translating embedding for knowledge graphs
- Blog: Clustering-based Partitioning for Large Web Graphs
- Blog: iQAN: Fast and Accurate Vector Search with Efficient Intra-Query Parallelism on Multi-Core Architectures
History & citation
Current · Permanent link
- This direction split from Reducing Contention in Parallel Graph Algorithms (52% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_synchronization_overhead_concurrency_con_a47a1a53,
title = {synchronization overhead (concurrency control overhead)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/synchronization-overhead-concurrency-control-overhead/rdr_a47a1a53a0a74126ad139c3e49dabc74},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_synchronization_overhead_concurrency_con_a47a1a53_v1,
title = {synchronization overhead (concurrency control overhead)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/synchronization-overhead-concurrency-control-overhead/rdr_a47a1a53a0a74126ad139c3e49dabc74/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}