Search arXiv⌕ Search

arXiv · 0706.0403

Asymptotic Behavior of Total Times For Jobs That Must Start Over If a Failure Occurs

Abstract

Many processes must complete in the presence of failures. Different systems respond to task failure in different ways. The system may resume a failed task from the failure point (or a saved checkpoint shortly before the failure point), it may give up on the task and select a replacement task from the ready queue, or it may restart the task. The behavior of systems under the first two scenarios is well documented, but the third ({\em RESTART}) has resisted detailed analysis. In this paper we derive tight asymptotic relations between the distribution of {\em task times} without failures to the {\em total time} when including failures, for any failure distribution. In particular, we show that if the task time distribution has an unbounded support then the total time distribution $H$ is always heavy-tailed. Asymptotic expressions are given for the tail of $H$ in various scenarios. The key ingredients of the analysis are the Cramér--Lundberg asymptotics for geometric sums and integral asymptotics, that in some cases are obtained via Tauberian theorems and in some cases by bare-hand calculations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Soeren Asmussen, Pierre Fiorini, Lester Lipsky, Tomasz Rolski, Robert Sheahan. 2007-06-04. Asymptotic Behavior of Total Times For Jobs That Must Start Over If a Failure Occurs. https://arxiv.org/abs/0706.0403

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rough backward SDEs with discontinuous Young drivers

We study solutions to backward differential equations that are driven hybridly by a deterministic discontinuous rough path $W$ of finite $q$-variation for $q \in [1, 2)$ and by Brownian motion $B$. To distinguish between integration of jumps in a forward- or Marcus-sense, we refer to these equations as forward- respectively Marcus-type rough backward stochastic differential equations (RBSDEs). We establish global well-posedness by proving global apriori bounds for solutions and employing fixed-point arguments locally. Furthermore, we lift the RBSDE solution and the driving rough noise to the space of decorated paths endowed with a Skorokhod-type metric and show stability of solutions with respect to perturbations of the rough noise. Finally, we prove well-posedness for a new class of backward doubly stochastic differential equations (BDSDEs), which are jointly driven by a Brownian martingale $B$ and an independent discontinuous stochastic process $L$ of finite $q$-variation. We explain, how our RBSDEs can be understood as conditional solutions to such BDSDEs, conditioned on the information generated by the path of $L$.

math.PR↗

Convergence of the KMP model to the KPZ equation

We prove that the Kipnis-Marchioro-Presutti (KMP) process converges to the Kardar-Parisi-Zhang (KPZ) equation, as time $t$ goes to infinity, in a properly scaled observation window shifted by $t^{3/4}$. Our proof is based on identifying the KMP process with a stochastic flow of kernels describing transition probabilities in a certain model of random walk in space-time random environment. This allows to apply a recent result of arXiv:2401.06073 proving convergence of the density field of random walks in random environment to the KPZ equation in a suitably general sense.

math.PR↗

Permuton and local limits for the Luce model

We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities proportional to prescribed positive weights. These permutations arise in applications such as ranking models, the Tsetlin library, and related Markov processes. Under minimal assumptions on the weights, we establish a permuton limit theorem describing the global behavior of Luce-distributed permutations and derive an explicit density of the limiting permuton. We further compute limiting pattern densities and analyze the differences between exact Luce permutations and their permuton approximations. We also study the local convergence of these permutations, proving a quenched Benjamini--Schramm limit and a central limit theorem for consecutive pattern occurrences. Finally, we prove a central limit theorem for the number of inversions.

math.PR↗