On the public citation graph
Scaling synchronization in multicore programs
0 signed · 21 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-319-09873-9_48openalex-snapshot
Delegation Locking Libraries for Improved Performance of Multithreaded Programs
inferredcites →https://doi.org/10.1145/103727.103729openalex-snapshot
Algorithms for scalable synchronization on shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/1250734.1250759openalex-snapshot
Optimistic parallelism requires abstractions
inferredcites →https://doi.org/10.1145/1810479.1810540openalex-snapshot
Flat combining and the synchronization-parallelism tradeoff
inferredcites →https://doi.org/10.1145/1897852.1897873openalex-snapshot
Data structures in the multicore age
inferredcites →https://doi.org/10.1145/2145816.2145849openalex-snapshot
Revisiting the combining synchronization technique
inferredcites →https://doi.org/10.1145/2442516.2442527openalex-snapshot
Fast concurrent queues for x86 processors
inferredcites →https://doi.org/10.1145/248052.248106openalex-snapshot
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
inferredcites →https://doi.org/10.1145/2482767.2482789openalex-snapshot
Distributed queues in shared memory
inferredcites →https://doi.org/10.1145/2483852.2483866openalex-snapshot
Nonblocking algorithms and scalable multicore programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4244openalex-snapshot
Fast synchronization‐free algorithms for parallel sparse triangular solves with multiple right‐hand sides
inferred← citeshttps://doi.org/10.1109/tcad.2018.2834423openalex-snapshot
A Message-Passing Microcoded Synchronization for Distributed Shared Memory Architectures
inferred← citeshttps://doi.org/10.1145/3087801.3087810openalex-snapshot
The Power of Choice in Priority Scheduling
inferred← citeshttps://doi.org/10.1145/3332466.3374511openalex-snapshot
Scaling concurrent queues by using HTM to profit from failed atomic operations
inferred← citeshttps://doi.org/10.1145/3419111.3421293openalex-snapshot
A user-level toolkit for storage I/O isolation on multitenant hosts
inferred← citeshttps://doi.org/10.1145/3565514openalex-snapshot
A Family of Relaxed Concurrent Queues for Low-Latency Operations and Item Transfers
inferred← citeshttps://doi.org/10.1145/3639404openalex-snapshot
Diciclo: Flexible User-level Services for Efficient Multitenant Isolation
inferred← citeshttps://doi.org/10.20868/upm.thesis.47796openalex-snapshot
Hoare-style Reasoning with Higher-order Control : Continuations and Concurrency
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.