On the public citation graph
Localized Fault Recovery for Nested Fork-Join Programs
0 signed · 47 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-540-72521-3_18openalex-snapshot
UTS: An Unbalanced Tree Search Benchmark
inferredcites →https://doi.org/10.1007/978-3-662-44202-9_27openalex-snapshot
Semantics of (Resilient) X10
inferredcites →https://doi.org/10.1016/j.future.2004.11.016openalex-snapshot
A higher order estimate of the optimum checkpoint interval for restart dumps
inferredcites →https://doi.org/10.1016/s0010-4655(00)00065-5openalex-snapshot
High performance computational chemistry: An overview of NWChem a distributed parallel application
inferredcites →https://doi.org/10.1109/ftcs.1994.315631openalex-snapshot
Faster checkpointing with N+1 parity
inferredcites →https://doi.org/10.1109/icdcs.2012.56openalex-snapshot
Combining Partial Redundancy and Checkpointing for HPC
inferredcites →https://doi.org/10.1109/ipdps.2015.81openalex-snapshot
Design for a Soft Error Resilient Dynamic Task-Based Runtime
inferredcites →https://doi.org/10.1109/pdp.2011.72openalex-snapshot
A Redundant Communication Approach to Scalable Fault Tolerance in PGAS Programming Models
inferredcites →https://doi.org/10.1109/sc.2014.64openalex-snapshot
Fault-Tolerant Dynamic Task Graph Scheduling
inferredcites →https://doi.org/10.1109/tc.1984.1676475openalex-snapshot
Algorithm-Based Fault Tolerance for Matrix Operations
inferredcites →https://doi.org/10.1145/1583991.1584017openalex-snapshot
Reducers and other Cilk++ hyperobjects
inferredcites →https://doi.org/10.1145/1941553.1941582openalex-snapshot
Lifeline-based global load balancing
inferredcites →https://doi.org/10.1145/2063384.2063443openalex-snapshot
Evaluating the viability of process replication reliability for exascale systems
inferredcites →https://doi.org/10.1145/2304576.2304589openalex-snapshot
Data-driven fault tolerance for work stealing computations
inferredcites →https://doi.org/10.1145/277650.277725openalex-snapshot
The implementation of the Cilk-5 multithreaded language
inferredcites →https://doi.org/10.1145/50202.50214openalex-snapshot
A case for redundant arrays of inexpensive disks (RAID)
inferredcites →https://doi.org/10.1145/568522.568525openalex-snapshot
A survey of rollback-recovery protocols in message-passing systems
inferredcites →https://doi.org/10.1177/1094342006062528openalex-snapshot
Fault-Tolerant Scheduling of Fine-Grained Tasks in Grid Environments
inferredcites →https://doi.org/10.1177/1094342014522573openalex-snapshot
Addressing failures in exascale computing
inferredcites →https://doi.org/10.12694/scpe.v16i2.1088openalex-snapshot
Fault Tolerance Schemes for Global Load Balancing in X10
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-030-20656-7_15openalex-snapshot
Resilient Optimistic Termination Detection for the Async-Finish Model
inferred← citeshttps://doi.org/10.1007/978-3-031-30445-3_2openalex-snapshot
Comparison of Load Balancing Schemes for Asynchronous Many-Task Runtimes
inferred← citeshttps://doi.org/10.1007/978-3-031-40843-4_17openalex-snapshot
Understanding System Resilience for Converged Computing of Cloud, Edge, and HPC
inferred← citeshttps://doi.org/10.1007/978-3-031-48803-0_9openalex-snapshot
Task-Level Checkpointing for Nested Fork-Join Programs Using Work Stealing
inferred← citeshttps://doi.org/10.1007/978-3-031-97196-9_4openalex-snapshot
Fail-Stop Failure Protection for Coordinated Work Stealing of Tasks that Communicate Through Futures
inferred← citeshttps://doi.org/10.1007/978-3-032-27676-6_4openalex-snapshot
Silent Data Corruption Protection Through Efficient Task Replication
inferred← citeshttps://doi.org/10.1007/s11227-018-2234-8openalex-snapshot
Hybrid work stealing of locality-flexible and cancelable tasks for the APGAS library
inferred← citeshttps://doi.org/10.1007/s42979-024-02624-8openalex-snapshot
Task-Level Checkpointing and Localized Recovery to Tolerate Permanent Node Failures for Nested Fork–Join Programs in Clusters
inferred← citeshttps://doi.org/10.1016/j.future.2019.11.031openalex-snapshot
A Comparison of Application-Level Fault Tolerance Schemes for Task Pools
inferred← citeshttps://doi.org/10.1109/ccgrid.2018.00075openalex-snapshot
Understanding scale-Dependent soft-Error Behavior of Scientific Applications
inferred← citeshttps://doi.org/10.1109/cluster.2017.127openalex-snapshot
Toward a General Theory of Optimal Checkpoint Placement
inferred← citeshttps://doi.org/10.1109/cluster48925.2021.00075openalex-snapshot
Load Balancing Policies for Nested Fork-Join
inferred← citeshttps://doi.org/10.1109/hpcs.2018.00103openalex-snapshot
A Selective and Incremental Backup Scheme for Task Pools
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.31openalex-snapshot
Fault Tolerance for Cooperative Lifeline-Based Global Load Balancing in Java with APGAS and Hazelcast
inferred← citeshttps://doi.org/10.1109/ipdpsw52791.2021.00089openalex-snapshot
Checkpointing vs. Supervision Resilience Approaches for Dynamic Independent Tasks
inferred← citeshttps://doi.org/10.1145/3236367.3236379openalex-snapshot
Energy-efficient localised rollback via data flow analysis and frequency scaling
inferred← citeshttps://doi.org/10.1145/3629527.3652277openalex-snapshot
Approximating Fork-Join Systems via Mixed Model Transformations
inferred← citeshttps://doi.org/10.1145/3731599.3767502openalex-snapshot
Stackless vs. Stackful Coroutines: A Comparative Study for RDMA-based Asynchronous Many-Task (AMT) Runtimes
inferred← citeshttps://doi.org/10.15803/ijnc.12.1_47openalex-snapshot
Task-Level Resilience: Checkpointing vs. Supervision
inferred← citeshttps://doi.org/10.15803/ijnc.8.1_2openalex-snapshot
A Java Task Pool Framework providing Fault-Tolerant Global Load Balancing
inferred← citeshttps://doi.org/10.4236/jsea.2017.1013053openalex-snapshot
Fault Tolerance for Lifeline-Based Global Load Balancing
inferred← citeshttps://doi.org/10.48550/arxiv.2102.12941openalex-snapshot
Checkpointing and Localized Recovery for Nested Fork-Join Programs
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.