Results 101 to 110 of about 5,171 (123)

Equivalence relations in queueing models of Fork/Join networks with blocking

Performance Evaluation, 1989
Abstract Fork/join (F/J) networks can be used to model parallel processing computer systems.and manufacturing systems. In this paper, we present some fundamental equivalence properties that hold for F/J networks with blocking. Two networks that are equivalent may appear different, but their behavior is closely related.
Mostafa H. Ammar, Stanley B. Gershwin
openaire   +1 more source

Analysis of Fork-Join Scheduling on Heterogeneous Parallel Servers

IEEE/ACM Transactions on Networking
This paper investigates the $(k,k)$ fork-join scheduling scheme on a system of n parallel servers comprising both slow and fast servers. Tasks arriving in the system are divided into k sub-tasks and assigned to a random set of k servers, where each ...
Moonmoon Mohanty, Gaurav Gautam, Vaneet Aggarwal, Parimal Parag   +3 more
semanticscholar   +1 more source

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

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

A fork-join queueing model: Diffusion approximation, integral representations and asymptotics

Queueing Systems, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaoming Tan, Charles Knessl
openaire   +2 more sources

Queueing networks based on Fork-Join

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

A Fast Simulation for Thousands of General Homogeneous Fork/Join Queues

International Symposium on Medical Simulation, 2010
R. Chen, Haiying Zhang, Hailong Hu
semanticscholar   +1 more source

Analysis and Simulation for a Mean Response Time Hybrid Solution to Homogeneous Fork/Join Queues

2010 Fourth UKSim European Symposium on Computer Modeling and Simulation, 2010
R. Chen, Muchenxuan Tong
semanticscholar   +1 more source

Simulation & Analysis of a Mean Response Time Upper-bound for Homogeneous Fork/Join Queues

2011 UkSim 13th International Conference on Computer Modelling and Simulation, 2011
R. Chen, K. Reschke, Muchenxuan Tong
semanticscholar   +1 more source