Algebraic modelling and performance evaluation of acyclic fork-join queueing networks
Provides bounding techniques for performance evaluation of fork-join queueing networks, which are important for modeling parallel systems, but the results are incremental and theoretical.
The paper derives simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join queueing networks using (max,+)-algebra, and discusses their behavior under various service time assumptions with numerical examples.
Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join queueing networks are derived using a (max,+)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.