scientific article; zbMATH DE number 7561437
From MaRDI portal
Publication:5091080
DOI10.4230/LIPIcs.OPODIS.2018.9MaRDI QIDQ5091080
Paul Renaud-Goud, Aras Atalar, Philippas Tsigas
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1805.04794
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
- Stein's method and point process approximation
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Analyzing the performance of lock-free data structures: a conflict-based model
- Fast and lock-free concurrent priority queues for multi-thread systems
- Removing logarithms from Poisson process error bounds.
- Randomized search trees
- Are Lock-Free Concurrent Algorithms Practically Wait-Free?
- Algorithms adapting to point contention
- A Proof for the Queuing Formula: L = λW
- A note on the height of binary search trees
- Contention in shared memory algorithms
- Analyzing Contention and Backoff in Asynchronous Shared Memory
This page was built for publication:
