On the public citation graph

Evaluating the Effectiveness of Replication for Tail-Tolerance

0 signed · 29 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/11777830_8openalex-snapshot
Explicit Inverse Characterizations of Acyclic MAPs of Second Order
inferredcites →https://doi.org/10.1007/978-3-642-40725-3_15openalex-snapshot
Performance Enhancement by Means of Task Replication
inferredcites →https://doi.org/10.1023/a:1011083915877openalex-snapshot
Calculation of the Steady State Waiting Time Distribution in GI/PH/c and MAP/PH/c Queues
inferredcites →https://doi.org/10.1081/stm-200056210openalex-snapshot
Matching Three Moments with Minimal Acyclic Phase Type Distributions
inferredcites →https://doi.org/10.1090/s0002-9939-1953-0055639-3openalex-snapshot
Sequential minimax search for a maximum
inferredcites →https://doi.org/10.1109/allerton.2013.6736597openalex-snapshot
When do redundant requests reduce latency ?
inferredcites →https://doi.org/10.1109/ccgrid.2008.79openalex-snapshot
Fault Tolerance and Recovery of Scientific Workflows on Computational Grids
inferredcites →https://doi.org/10.1109/infocom.2015.7218512openalex-snapshot
Enhancing reliability and response times via replication in computing clusters
inferredcites →https://doi.org/10.1109/mascots.2014.13openalex-snapshot
Assessing the Impact of Concurrent Replication with Canceling in Parallel Jobs
inferredcites →https://doi.org/10.1109/tcomm.2015.2506161openalex-snapshot
When Do Redundant Requests Reduce Latency?
inferredcites →https://doi.org/10.1109/tpds.2003.1167369openalex-snapshot
Opportunity cost algorithms for reduction of I/O and interprocess communication overhead in a computing cluster
inferredcites →https://doi.org/10.1137/1.9780898719734openalex-snapshot
Introduction to Matrix Analytic Methods in Stochastic Modeling
inferredcites →https://doi.org/10.1145/2408776.2408794openalex-snapshot
The tail at scale
inferredcites →https://doi.org/10.1145/2535372.2535392openalex-snapshot
Low latency via redundancy
inferredcites →https://doi.org/10.1287/opre.30.1.125openalex-snapshot
Approximating a Point Process by a Renewal Process, I: Two Basic Methods
inferredcites →https://doi.org/10.2307/1427202openalex-snapshot
Markov processes whose steady state distribution is matrix-exponential with an application to theGI/PH/1 queue
inferredcites →https://doi.org/10.2307/2032161openalex-snapshot
Sequential Minimax Search for a Maximum

What points at this work

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

inferred← citeshttps://doi.org/10.1109/access.2018.2873287openalex-snapshot
Intelligent Offload Detection for Achieving Approximately Optimal Load Balancing
inferred← citeshttps://doi.org/10.1109/icac.2018.00013openalex-snapshot
SmallTail: Scaling Cores and Probabilistic Cloning Requests for Web Systems
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524365openalex-snapshot
Variability-aware request replication for latency curtailment
inferred← citeshttps://doi.org/10.1109/infocom.2017.8056974openalex-snapshot
Power of redundancy: Designing partial replication for multi-tier applications
inferred← citeshttps://doi.org/10.1109/mcc.2018.011791711openalex-snapshot
Holistic Workload Scaling: A New Approach to Compute Acceleration in the Cloud
inferred← citeshttps://doi.org/10.1109/tpds.2016.2564962openalex-snapshot
Optimization for Speculative Execution in Big Data Processing Clusters
inferred← citeshttps://doi.org/10.1109/tpds.2017.2706268openalex-snapshot
Cutting Latency Tail: Analyzing and Validating Replication without Canceling
inferred← citeshttps://doi.org/10.1109/tpds.2020.2982137openalex-snapshot
A Black-Box Fork-Join Latency Prediction Model for Data-Intensive Applications
inferred← citeshttps://doi.org/10.1109/tsc.2017.2780845openalex-snapshot
sPARE: Partial Replication for Multi-Tier Applications in the Cloud
inferred← citeshttps://doi.org/10.1145/2851553.2851562openalex-snapshot
Tackling Latency via Replication in Distributed Systems
inferred← citeshttps://doi.org/10.1145/3208040.3208058openalex-snapshot
ForkTail
inferred← citeshttps://doi.org/10.4108/eai.25-10-2016.2266606openalex-snapshot
A Queueing Network Model for Performance Prediction of Apache Cassandra
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.