Related papers: Stochastic Comparison of Parallel Systems with Log…
Estimating statistical models within sensor networks requires distributed algorithms, in which both data and computation are distributed across the nodes of the network. We propose a general approach for distributed learning based on…
We consider a parallel system of $m$ identical machines prone to unpredictable crashes and restarts, trying to cope with the continuous arrival of tasks to be executed. Tasks have different computational requirements (i.e., processing time…
Consider two batches of independent or interdependent exponentiated location-scale distributed heterogeneous random variables. This article investigates ordering results for the second-order statistics from these batches when a vector of…
Precedence order is a natural type of comparison for random variables in numerous engineering applications (e.g., for the stress-strength modeling). In this note, we show that, for a $k$-out-of-$n$ system, redundancy at the component level…
In the context of industrial engineering, cold-standby redundancies allocation strategy is usually adopted to improve the reliability of coherent systems. This paper investigates optimal allocation strategies of cold standbys for series and…
When developing a software system, a change in one part of the system may lead to unwanted changes in other parts of the system. These affected parts may interfere with system performance, so regression testing is used to deal with these…
Stochastic orders are very useful tool to compare the lifetimes of two coherent systems. We show that, under certain conditions, a coherent system of used components performs better (worse) than a used coherent system with respect to…
Arrival of multicore systems has enforced a new scenario in computing, the parallel and distributed algorithms are fast replacing the older sequential algorithms, with many challenges of these techniques. The distributed algorithms provide…
Researchers are often interested in drawing inferences regarding the order between two experimental groups on the basis of multivariate response data. Since standard multivariate methods are designed for two-sided alternatives, they may not…
The randomization effect of the two-way (particle-flow) interaction has been studied and quantified using the notion of distributed chaos and the results of numerical simulations and laboratory measurements. It is shown, in particular, that…
In this paper we compare the minimums of two independent and heterogeneous samples each following Kumaraswamy-G distribution with the same and the different parent distribution functions. The comparisons are carried out with respect to…
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…
Distributed locking mechanisms are fundamental to ensuring data consistency and integrity in distributed systems. This paper presents a comprehensive analysis of distributed locking algorithms, focusing on their performance characteristics…
The topic of this paper is the distributed and incremental generation of long executions of concurrent systems, uniformly or more generally with weights associated to elementary actions. Synchronizing sequences of letters on alphabets…
In this paper we compare the minimums of two heterogeneous samples each following Weibull-G distribution under three scenarios. In the Fifirst scenario, the units of the samples are assumed to be independently distributed and the…
Based on differences of generalized R\'enyi entropies nontrivial constraints on the shape of the distribution function of broadly distributed observables are derived introducing a new parameter in order to quantify the deviation from…
We investigate distributed memory parallel sorting algorithms that scale to the largest available machines and are robust with respect to input size and distribution of the input elements. The main outcome is that four sorting algorithms…
We study failure rate monotonicity and generalized convex transform stochastic ordering properties of random variables, with a concern on applications. We are especially interested in the effect of a tail weight iteration procedure to…
We investigate the physical mechanism behind the counterintuitive phenomenon, the distribution of continuous-variable entanglement between two distant modes by sending a third separable auxiliary mode between them. For this purpose, we…
In the realm of big data and machine learning, data-parallel, distributed stochastic algorithms have drawn significant attention in the present days.~While the synchronous versions of these algorithms are well understood in terms of their…