On the public citation graph

Lock coarsening: Eliminating lock overhead in automatically parallelized object-based programs

0 signed · 24 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0022173openalex-snapshot
A lock technique for disjoint and non-disjoint complex objects
inferredcites →https://doi.org/10.1038/324446a0openalex-snapshot
A hierarchical O(N log N) force-calculation algorithm
inferredcites →https://doi.org/10.1109/tc.1987.5009499openalex-snapshot
Compiler Algorithms for Synchronization
inferredcites →https://doi.org/10.1145/195470.195490openalex-snapshot
Reactive synchronization algorithms for multiprocessors
inferredcites →https://doi.org/10.1145/195473.195490openalex-snapshot
Reactive synchronization algorithms for multiprocessors
inferredcites →https://doi.org/10.1145/209936.209952openalex-snapshot
Compiler optimizations for eliminating barrier synchronization
inferredcites →https://doi.org/10.1145/223982.223990openalex-snapshot
The SPLASH-2 programs
inferredcites →https://doi.org/10.1145/231379.231390openalex-snapshot
Commutativity analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1096-9128(199911)11:13<773::aid-cpe453>3.0.co;2-5openalex-snapshot
Synchronization transformations for parallel computing
inferred← citeshttps://doi.org/10.1007/3-540-48294-6_2openalex-snapshot
Static Analyses for Eliminating Unnecessary Synchronization from Java Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-89740-8_10openalex-snapshot
Minimum Lock Assignment: A Method for Exploiting Concurrency among Critical Sections
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_17openalex-snapshot
Reasoning about Lock Placements
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_20openalex-snapshot
Lock Removal for Concurrent Trace Programs
inferred← citeshttps://doi.org/10.1007/s10586-018-2540-1openalex-snapshot
Restructuring AMS to reduce synchronization overheads on android system
inferred← citeshttps://doi.org/10.1007/s11432-012-4743-zopenalex-snapshot
Finding shrink critical section refactoring opportunities for the evolution of concurrent code in trustworthy software
inferred← citeshttps://doi.org/10.1016/j.scico.2005.03.002openalex-snapshot
Observations on the assured evolution of concurrent Java programs
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00129-6openalex-snapshot
Comprehensive synchronization elimination for Java
inferred← citeshttps://doi.org/10.1145/1229428.1229459openalex-snapshot
Optimized lock assignment and allocation
inferred← citeshttps://doi.org/10.1145/2541228.2555306openalex-snapshot
Profile-guided transaction coalescing—lowering transactional overheads by merging transactions
inferred← citeshttps://doi.org/10.1145/263699.263718openalex-snapshot
Synchronization transformations for parallel computing
inferred← citeshttps://doi.org/10.1145/267959.269969openalex-snapshot
Commutativity analysis
inferred← citeshttps://doi.org/10.1145/320384.320400openalex-snapshot
Compositional pointer and escape analysis for Java programs
inferred← citeshttps://doi.org/10.1145/320385.320400openalex-snapshot
Compositional pointer and escape analysis for Java programs
inferred← citeshttps://doi.org/10.1145/349299.349327openalex-snapshot
Effective synchronization removal for Java
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.