On the public citation graph
Deadlock avoidance in parallel programs with futures: why parallel tasks should not wait for strangers
0 signed · 62 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.1002/cpe.705openalex-snapshot
MPI‐CHECK: a tool for checking Fortran 90 MPI programs
inferredcites →https://doi.org/10.1007/11531142_26openalex-snapshot
Static Deadlock Detection for Java Libraries
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot
Cooperating Sequential Processes
inferredcites →https://doi.org/10.1007/978-3-319-11454-5_2openalex-snapshot
Evaluation of OpenMP Dependent Tasks with the KASTORS Benchmark Suite
inferredcites →https://doi.org/10.1007/978-3-319-46982-9_23openalex-snapshot
Dynamic Determinacy Race Detection for Task Parallelism with Futures
inferredcites →https://doi.org/10.1007/978-3-540-68564-7_5openalex-snapshot
MPI Correctness Checking with Marmot
inferredcites →https://doi.org/10.1007/978-3-642-03466-4_9openalex-snapshot
A Deadlock-Free Semantics for Shared Memory Concurrency
inferredcites →https://doi.org/10.1007/978-3-662-48096-0_33openalex-snapshot
A Composable Deadlock-Free Approach to Object-Based Isolation
inferredcites →https://doi.org/10.1007/bf02277859openalex-snapshot
Detecting causal relationships in distributed computations: In search of the holy grail
inferredcites →https://doi.org/10.1007/s10703-012-0143-7openalex-snapshot
Efficient data race detection for async-finish parallelism
inferredcites →https://doi.org/10.1016/0020-0190(71)90006-8openalex-snapshot
Efficient determination of the transitive closure of a directed graph
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1109/9.633824openalex-snapshot
Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
inferredcites →https://doi.org/10.1109/mc.1980.1653786openalex-snapshot
The Deadlock Problem: An Overview
inferredcites →https://doi.org/10.1109/sc.2012.79openalex-snapshot
MPI runtime error detection with MUST: Advances in deadlock detection
inferredcites →https://doi.org/10.1137/s0097539793259471openalex-snapshot
Space-Efficient Scheduling of Multithreaded Computations
inferredcites →https://doi.org/10.1145/1059513.1059514openalex-snapshot
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O ( n 2 barrier
inferredcites →https://doi.org/10.1145/1147403.1147416openalex-snapshot
A theory of data race detection
inferredcites →https://doi.org/10.1145/122759.122767openalex-snapshot
Detecting access anomalies in programs with critical sections
inferredcites →https://doi.org/10.1145/125826.125861openalex-snapshot
On-the-fly detection of data races for programs with nested fork-join parallelism
inferredcites →https://doi.org/10.1145/1297027.1297033openalex-snapshot
Statistically rigorous java performance evaluation
inferredcites →https://doi.org/10.1145/1345206.1345212openalex-snapshot
Quasi-static scheduling for safe futures
inferredcites →https://doi.org/10.1145/1542275.1542319openalex-snapshot
A graph based approach for MPI deadlock detection
inferredcites →https://doi.org/10.1145/1810479.1810526openalex-snapshot
Deadlock avoidance for streaming computations with filtering
inferredcites →https://doi.org/10.1145/2039239.2039247openalex-snapshot
Dynamic deadlock avoidance in systems code using statically inferred effects
inferredcites →https://doi.org/10.1145/2450136.2450138openalex-snapshot
A Transformation Framework for Optimizing Task-Parallel Programs
inferredcites →https://doi.org/10.1145/2509136.2509538openalex-snapshot
Effective race detection for event-driven programs
inferredcites →https://doi.org/10.1145/258492.258493openalex-snapshot
Efficient detection of determinacy races in Cilk programs
inferredcites →https://doi.org/10.1145/2688500.2688519openalex-snapshot
Dynamic deadlock verification for general barrier synchronisation
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/4472.4478openalex-snapshot
MULTILISP: a language for concurrent symbolic computation
inferredcites →https://doi.org/10.1145/45075.46163openalex-snapshot
Deadlock detection in distributed databases
inferredcites →https://doi.org/10.1145/582034.582042openalex-snapshot
A parallel java grande benchmark suite
inferredcites →https://doi.org/10.1145/582419.582440openalex-snapshot
Ownership types for safe programming
inferredcites →https://doi.org/10.1145/7351.7478openalex-snapshot
Reliable communication in the presence of failures
inferredcites →https://doi.org/10.1155/2015/205827openalex-snapshot
An Efficient Algorithm for On-the-Fly Data Race Detection Using an Epoch-Based Technique
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-97492-2_10openalex-snapshot
Verification of Concurrent Programs Using Hybrid Concrete-Symbolic Interpretation
inferred← citeshttps://doi.org/10.1016/j.scico.2019.04.002openalex-snapshot
Translating active objects into colored Petri nets for communication analysis
inferred← citeshttps://doi.org/10.1080/23080477.2020.1778226openalex-snapshot
Dynamic Budget-Total Need Based Resource Reservation Technique
inferred← citeshttps://doi.org/10.1109/tc.2021.3122843openalex-snapshot
Deadlock Avoidance Algorithms for Recursion-Tree Modeled Requests in Parallel Executions
inferred← citeshttps://doi.org/10.1145/3229060openalex-snapshot
Dynamic Deadlock Verification for General Barrier Synchronisation
inferred← citeshttps://doi.org/10.1145/3385412.3386013openalex-snapshot
Responsive parallelism with futures and state
inferred← citeshttps://doi.org/10.1145/3437801.3441616openalex-snapshot
An ownership policy and deadlock detector for promises
inferred← citeshttps://doi.org/10.1145/3498708openalex-snapshot
Static prediction of parallel computation graphs
inferred← citeshttps://doi.org/10.1145/3627535.3638487openalex-snapshot
Language-Agnostic Static Deadlock Detection for Futures
inferred← citeshttps://doi.org/10.1145/3632895openalex-snapshot
Disentanglement with Futures, State, and Interaction
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.