Related papers: The structure and modeling results of the parallel…
Stochastic comparisons of series and parallel systems are important in many areas of engineering, operations research and reliability analysis. These comparisons allow for the evaluation of the performance and reliability of systems under…
This paper is concerned with the stability analysis of continuous-time switched systems with a random switching signal. The switching signal manifests its characteristics with that the dwell time in each subsystem consists of a fixed part…
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search methods mixed with local search principles, dominance conditions…
The stochastic comparisons of parallel and series system are worthy of study. In this paper, we present some stochastic comparisons of parallel and series systems having independent components from Gumble distribution with two parameters…
Parallel algorithms designed for simulation and performance evaluation of single-server tandem queueing systems with both infinite and finite buffers are presented. The algorithms exploit a simple computational procedure based on recursive…
We discuss two space-time models: one is expanding, the other is static. They are both derived from Schwarzschild's exterior solution. But they differ in the implementation of the parallelism at a distance and the choice of their master…
This paper considers some designs for sampling and interventions in dynamic networks and spatial temporal settings. The sample spreads through the population largely by tracing network links, although random sampling or spatial designs may…
This paper deals a continuous-time state-dependent jump linear system, a particular kind of stochastic switching system. In particular, we consider a situation when the transition rate of the random jump process depends on the state…
A large number of real and abstract systems involve the transformation of some basic resource into respective products under the action of multiple processing agents, which can be understood as multiple-agent production systems (MAP). At…
We consider a model describing the waiting time of a server alternating between two service points. This model is described by a Lindley-type equation. We are interested in the time-dependent behaviour of this system and derive explicit…
Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive communication volume or prohibitive critical path length. We describe algorithms that are a viable compromise and…
Stochastic service systems describe situations in which customers compete for service from scarce resources. Think of check-in lines at airports, waiting rooms in hospitals or queues in supermarkets, where the scarce resource is human…
This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the…
System performance for networks composed of interconnected subsystems can be increased if the traditionally separated subsystems are jointly optimized. Recently, parallel and distributed optimization methods have emerged as a powerful tool…
With the growing complexity and capability of contemporary robotic systems, the necessity of sophisticated computing solutions to efficiently handle tasks such as real-time processing, sensor integration, decision-making, and control…
A dynamical model for the distribution of resources between competing agents is studied. While global competition leads to the accumulation of all the resources by a single agent, local competition allows for a wider resource distribution.…
The machinery is suggested to describe the varying spacetime topology on the level of its substitutes by finite topological spaces.
Game-theoretical approach to the analysis of parallel algorithms is proposed. The approach is based on presentation of the parallel computing as a congestion game. In the game processes compete for resources such as core of a central…
Transport phenomena in parallel coupled scatterers are studied by transfer matrix formulism. We derive a simple recurrence relation for transfer matrix of one-dimensional two-terminal systems consisting of $N$ arbitrary scattering unit…
This paper considers differential problems with random switching, with specific applications to the motion of cells and centrally coordinated motion. Starting with a differential-equation model of cell motion that was proposed previously,…