scientific article; zbMATH DE number 7561439
From MaRDI portal
Publication:5091082
DOI10.4230/LIPIcs.OPODIS.2018.11MaRDI QIDQ5091082
Petr Kuznetsov, Vitaly Aksenov, Anatoly Shalyto
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1710.07588
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel heap: an optimal parallel priority queue
- A parallel priority queue with constant time operations
- Randomized priority queues for fast parallel access
- Parallel priority queues
- Combining funnels: A dynamic approach to software combining
- Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
- CBPQ: high performance lock-free priority queue
- Scheduling multithreaded computations by work stealing
- The topological structure of asynchronous computability
- Heaps on Heaps
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
This page was built for publication:
