Displaying 341 – 360 of 383

Showing per page

Transfert de Charge dans un Réseau de Processeurs Totalement Connectés

Maryse Béguin (2010)

RAIRO - Operations Research

In this paper, a model of the load transfer on a fully connected net is presented. Each processor can accept at most K tasks. A load difference of two tasks between two processors is a prohibited situation and when it may appear, an immediat and instantaneous transfer is decided. The performances of the system are evaluated by the following indices: the reject probability, the throughput, the mean response time, the stationary probability distribution for a processor to host i tasks. The aim of...

α-stable limits for multiple channel queues in heavy traffic

Zbigniew Michna (2003)

Applicationes Mathematicae

We consider a sequence of renewal processes constructed from a sequence of random variables belonging to the domain of attraction of a stable law (1 < α < 2). We show that this sequence is not tight in the Skorokhod J₁ topology but the convergence of some functionals of it is derived. Using the structure of the sample paths of the renewal process we derive the convergence in the Skorokhod M₁ topology to an α-stable Lévy motion. This example leads to a weaker notion of weak convergence. As...

Currently displaying 341 – 360 of 383