Parallel combining: benefits of explicit synchronization

DOI10.4230/LIPICS.OPODIS.2018.11MaRDI QIDQ5091082zbMATH OpenFDO

Authors Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto

Publication date 21 July 2022

Full work available at URL https://arxiv.org/abs/1710.07588

zbMATH Keywords

combiningconcurrent data structureparallel batched data structure

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Combining funnels: A dynamic approach to software combining
• Transactional Lock Elision Meets Combining
• Parallel finger search structures
• Bounded-wait combining: constructing robust and high-throughput shared objects
• Parallel heap: an optimal parallel priority queue

Cites work

• A parallel priority queue with constant time operations
• CBPQ: high performance lock-free priority queue
• Combining funnels: A dynamic approach to software combining
• Heaps on Heaps
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 1760035 (Why is no real title available?)
• Introduction to algorithms.
• Parallel heap: an optimal parallel priority queue
• Parallel priority queues
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Randomized priority queues for fast parallel access
• Scheduling multithreaded computations by work stealing
• Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
• The topological structure of asynchronous computability

This page was built for publication: Parallel combining: benefits of explicit synchronization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091082)