Image de couverture de livre

Fast Concurrent Primitives Despite Contention

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bender, Michael A., Blelloch, Guy E., Farach-Colton, Martin, Hu, Yang, Johnson, Rob, Oshman, Rotem, Zhou, Renfei
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

History-Independent Concurrent Hash Tables
par: Attiya, Hagit, et autres
Publié: (2025)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
par: Blelloch, Guy E., et autres
Publié: (2025)

Big Atomics
par: Anderson, Daniel, et autres
Publié: (2025)

Parallel Cluster-BFS and Applications to Shortest Paths
par: Wang, Letong, et autres
Publié: (2024)

History-Independent Concurrent Objects
par: Attiya, Hagit, et autres
Publié: (2024)

Parallel Batch-Dynamic Maximal Independent Set
par: Blelloch, Guy, et autres
Publié: (2026)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
par: Blelloch, Guy, et autres
Publié: (2026)

Concurrent aggregate queries
par: Sela, Gal, et autres
Publié: (2024)

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
par: Williams, Marvin, et autres
Publié: (2025)

Memory Bounds for Concurrent Bounded Queues
par: Aksenov, Vitaly, et autres
Publié: (2021)

New Concurrent Order Maintenance Data Structure
par: Guo, Bin, et autres
Publié: (2022)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
par: McCoy, Hunter, et autres
Publié: (2025)

Skip Hash: A Fast Ordered Map Via Software Transactional Memory
par: Rodriguez, Matthew, et autres
Publié: (2024)

Auditable Shared Objects: From Registers to Synchronization Primitives
par: Attiya, Hagit, et autres
Publié: (2025)

Content-Oblivious Leader Election on Rings
par: Frei, Fabian, et autres
Publié: (2024)

Concurrent Deterministic Skiplist and Other Data Structures
par: Sasidharan, Aparna
Publié: (2023)

Fast Deterministic Distributed Degree Splitting
par: Maus, Yannic, et autres
Publié: (2026)

Fast Broadcast in Highly Connected Networks
par: Chandra, Shashwat, et autres
Publié: (2024)

No Cords Attached: Coordination-Free Concurrent Lock-Free Queues
par: Motiwala, Yusuf
Publié: (2025)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
par: Wang, Letong, et autres
Publié: (2023)

Fast Spanning Tree Sampling in Broadcast Congested Clique
par: Anari, Nima, et autres
Publié: (2026)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
par: Mordacchini, Matteo, et autres
Publié: (2025)

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
par: Polyanskii, Nikita, et autres
Publié: (2024)

The Art of the Fugue: Minimizing Interleaving in Collaborative Text Editing
par: Weidner, Matthew, et autres
Publié: (2023)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
par: Dang'ana, Michael
Publié: (2026)

Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
par: Elkin, Michael, et autres
Publié: (2025)

Parallel Joinable B-Trees in the Fork-Join I/O Model
par: Goodrich, Michael, et autres
Publié: (2025)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
par: Dhulipala, Laxman, et autres
Publié: (2024)

A Hybrid Vectorized Merge Sort on ARM NEON
par: Zhou, Jincheng, et autres
Publié: (2024)

Efficient Enumeration of Large Maximal k-Plexes
par: Cheng, Qihao, et autres
Publié: (2024)

MVP-ORAM: a Wait-free Concurrent ORAM for Confidential BFT Storage
par: Vassantlal, Robin, et autres
Publié: (2025)

Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation
par: Izumi, Taisuke, et autres
Publié: (2025)

Efficient Dynamic MaxFlow Computation on GPUs
par: Kannappan, Shruthi, et autres
Publié: (2025)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
par: Blin, Lelia, et autres
Publié: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
par: Jakob, Manuel, et autres
Publié: (2025)

Perfect Matching with Few Link Activations
par: Mirault, Hugo, et autres
Publié: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
par: Ghaffari, Mohsen, et autres
Publié: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
par: Feist, Dankrad, et autres
Publié: (2025)

Designing Parallel Algorithms for Community Detection using Arachne
par: Li, Fuhuan, et autres
Publié: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
par: Gil, Yuval, et autres
Publié: (2025)