On the public citation graph

Delay Asymptotics and Bounds for Multi-Task Parallel Jobs

https://doi.org/10.1145/3308897.3308901
0 signed · 46 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/s11134-012-9311-0openalex-snapshot
Asymptotic independence of queues under randomized load balancing
inferredcites →https://doi.org/10.1007/s11134-016-9486-xopenalex-snapshot
Stochastic bounds in Fork–Join queueing systems under full and partial mapping
inferredcites →https://doi.org/10.1017/s0001867800018851openalex-snapshot
The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
inferredcites →https://doi.org/10.1109/12.2213openalex-snapshot
Approximate analysis of fork/join synchronization in parallel queues
inferredcites →https://doi.org/10.1109/71.246075openalex-snapshot
Performance analysis and scheduling of stochastic fork-join jobs in a multicomputer system
inferredcites →https://doi.org/10.1109/allerton.2017.8262765openalex-snapshot
Delay comparison of delivery and coding policies in data clusters
inferredcites →https://doi.org/10.1109/infcom.2013.6566956openalex-snapshot
A new analytical technique for designing provably efficient MapReduce schedulers
inferredcites →https://doi.org/10.1109/infocom.2015.7218487openalex-snapshot
The power of slightly more than one sample in randomized load balancing
inferredcites →https://doi.org/10.1109/isit.2014.6874955openalex-snapshot
The MDS queue: Analysing the latency performance of erasure codes
inferredcites →https://doi.org/10.1109/mascots.2016.43openalex-snapshot
A Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size
inferredcites →https://doi.org/10.1109/tit.2017.2674671openalex-snapshot
The MDS Queue: Analysing the Latency Performance of Erasure Codes
inferredcites →https://doi.org/10.1109/tnet.2014.2362745openalex-snapshot
MapTask Scheduling in MapReduce With Data Locality: Throughput and Heavy-Traffic Optimality
inferredcites →https://doi.org/10.1109/tnet.2015.2466453openalex-snapshot
Joint Latency and Cost Optimization for Erasure-Coded Data Center Storage
inferredcites →https://doi.org/10.1109/tnet.2017.2744607openalex-snapshot
A Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size
inferredcites →https://doi.org/10.1137/0144074openalex-snapshot
Two Parallel Queues Created by Arrivals with Two Demands I
inferredcites →https://doi.org/10.1145/1327452.1327492openalex-snapshot
MapReduce
inferredcites →https://doi.org/10.1145/1989493.1989540openalex-snapshot
On scheduling in map-reduce and flow-shops
inferredcites →https://doi.org/10.1145/2254756.2254761openalex-snapshot
Delay tails in MapReduce scheduling
inferredcites →https://doi.org/10.1145/2390231.2390234openalex-snapshot
More is less
inferredcites →https://doi.org/10.1145/2745844.2745849openalex-snapshot
Power of d Choices for Large-Scale Bin Packing
inferredcites →https://doi.org/10.1214/aoms/1177698701openalex-snapshot
Association of Random Variables, with Applications
inferredcites →https://doi.org/10.1214/aos/1176346079openalex-snapshot
Negative Association of Random Variables with Applications
inferredcites →https://doi.org/10.1287/moor.2016.0823openalex-snapshot
The Power of Slightly More than One Sample in Randomized Load Balancing
inferredcites →https://doi.org/10.1287/opre.2016.1582openalex-snapshot
Redundancy-d: The Power of d Choices for Redundancy
inferredcites →https://doi.org/10.14778/2367502.2367519openalex-snapshot
Interactive analytical processing in big data systems
inferredcites →https://doi.org/10.2307/1427522openalex-snapshot
Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes
inferredcites →https://doi.org/10.48550/arxiv.2309.16880openalex-snapshot
Near Delay-Optimal Scheduling of Batch Jobs in Multi-Server Systems

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.3760861openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-030-68110-4_17openalex-snapshot
Tail Latency in Datacenter Networks
inferred← citeshttps://doi.org/10.1007/s10586-021-03343-yopenalex-snapshot
Modeling and analysis of distributed schedulers in data center cluster networks
inferred← citeshttps://doi.org/10.1109/comsnets53615.2022.9668414openalex-snapshot
Latency-Redundancy Tradeoff in Distributed Read-Write Systems
inferred← citeshttps://doi.org/10.1109/tnsm.2019.2916877openalex-snapshot
TTLoC: Taming Tail Latency for Erasure-Coded Cloud Storage Systems
inferred← citeshttps://doi.org/10.1109/ton.2025.3594628openalex-snapshot
Queueing Delay Minimization in Overloaded Networks via Rate Control
inferred← citeshttps://doi.org/10.1109/ton.2025.3647752openalex-snapshot
On Resolving Non-Preemptivity in Multitask Scheduling: An Optimal Algorithm in Deterministic and Stochastic Worlds
inferred← citeshttps://doi.org/10.1145/3309697.3331498openalex-snapshot
Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory
inferred← citeshttps://doi.org/10.1145/3309697.3331504openalex-snapshot
Performance Analysis of Workload Dependent Load Balancing Policies
inferred← citeshttps://doi.org/10.1145/3322205.3311082openalex-snapshot
Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory
inferred← citeshttps://doi.org/10.1145/3341617.3326150openalex-snapshot
Performance Analysis of Workload Dependent Load Balancing Policies
inferred← citeshttps://doi.org/10.1145/3350755.3400265openalex-snapshot
Optimal Resource Allocation for Elastic and Inelastic Jobs
inferred← citeshttps://doi.org/10.1145/3379468openalex-snapshot
Delay-optimal Policies in Partial Fork-Join Systems with Redundancy and Random Slowdowns
inferred← citeshttps://doi.org/10.1145/3393691.3394181openalex-snapshot
Delay-Optimal Policies in Partial Fork-Join Systems with Redundancy and Random Slowdowns
inferred← citeshttps://doi.org/10.1287/msom.2022.1178openalex-snapshot
Cloud Computing Value Chains: Research from the Operations Management Perspective
inferred← citeshttps://doi.org/10.1561/9781680838435openalex-snapshot
Modeling and Optimization of Latency in Erasure-coded Storage Systems
inferred← citeshttps://doi.org/10.3390/math11143232openalex-snapshot
The Delay Time Profile of Multistage Networks with Synchronization
inferred← citeshttps://doi.org/10.3390/math12050659openalex-snapshot
Investigation of the Fork–Join System with Markovian Arrival Process Arrivals and Phase-Type Service Time Distribution Using Machine Learning Methods
inferred← citeshttps://doi.org/10.37661/1816-0301-2023-20-3-50-60openalex-snapshot
Performance characteristics of the fork-join queuing system
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.