Results 111 to 120 of about 149 (130)

ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL

Probability in the Engineering and Informational Sciences, 2010
In this article, we consider the two-node fork-join model with a Poisson arrival process and exponential service times of heterogeneous service rates. Using a mapping from the queue lengths in the parallel nodes to the join queue length, we first derive the probability distribution function of the join queue length in terms of joint probabilities in ...
Li, Jun, Zhao, Yiqiang Q.
openaire   +1 more source

On the Features of Service Rate Control in Fork-Join Queueing System

Automation and Remote Control
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anastasia V. Gorbunova, Alexey V. Lebedev   +1 more
openaire   +2 more sources

Generalized parallel-server fork-join queues with dynamic task scheduling

Annals of Operations Research, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mark S. Squillante, Yanyong Zhang, Anand Sivasubramaniam, Natarajan Gautam   +3 more
openaire   +1 more source

Approximate analysis of finite fork/join queueing networks

Computers & Industrial Engineering, 1997
Abstract We perform an approximate analysis on the finite-buffered acyclic fork/join queueing networks under the “blocking before service” mechanism. This study, besides being able to handle a network with complex topology and with finite buffers, is more general than the existing ones of its kind in that two performance measures, the system ...
Kim, JH, Tcha, DW Tcha, Dong Wan
openaire   +2 more sources

Queueing networks based on Fork-Join

1992
Abstract
COLAJANNI, Michele, S. Tucci
openaire   +1 more source

Stochastic comparisons for fork-join queues with exponential processing times

Journal of Applied Probability, 1997
Consider a fork-join queue, where each job upon arrival splits into k tasks and each joins a separate queue that is attended by a single server. Service times are independent, exponentially distributed random variables. Server i works at rate , where μ is constant.
Frostig, Esther, Lehtonen, Tapani
openaire   +1 more source

Introduction to Fork-Join Queues

2022
openaire   +1 more source

On the Busy Cycle Maxima in a Heterogeneous Fork-Join Queue

ACM SIGMETRICS Performance Evaluation Review
This work investigates the distribution of the maximum response time during a busy cycle in a Fork-Join queueing system with two parallel servers having heterogeneous deterministic service times and Poisson arrivals. We formulate a renewal-type Fredholm integral equation of the second kind that explicitly characterizes the cumulative distribution ...
openaire   +1 more source

Relaxed Fork-Join Queueing Networks

2022
openaire   +1 more source

Approximate analysis of a closed fork/join model

European Journal of Operational Research, 1991
H G Perros
exaly