Acyclic fork-join queuing networks
From MaRDI portal
acyclic fork-join queuing networksflexible manufacturingnetwork response timesparallel processingstability conditionsstochastic ordering principles
Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)
Recommendations
- Algebraic modelling and performance evaluation of acyclic fork-join queueing networks
- Publication:4939103
- Stationary and stability of fork-join networks
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- Evaluation of the mean cycle time in fork-join queueing networks
Cited in
(28)- A mean-field limit for a class of queueing networks
- Stationary waiting time derivatives
- A recursive equations based representation for the \(G/G/m\) queue
- Analysis of a fork/join station with inputs from a finite population subnetwork with multi-server stations
- Evaluation of the mean cycle time in fork-join queueing networks
- The customer response times in the processor sharing queue are associated
- Scheduling parallel processors: Structural properties and optimal policies
- Analytical approximations to predict performance measures of manufacturing systems with general distributions, job failures and parallel processing
- Inverse problems in queueing theory and internet probing
- Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
- Controlling variability in split-merge systems and its impact on performance
- On parametric steady state analysis of a generalized stochastic Petri net with a fork-join subnet
- Exact Monte Carlo simulation for fork-join networks
- Stationary and stability of fork-join networks
- scientific article; zbMATH DE number 148327 (Why is no real title available?)
- Analytical approximations to predict performance measures of Markovian type manufacturing systems with job failures and parallel processing
- scientific article; zbMATH DE number 1172614 (Why is no real title available?)
- Manufacturing cell formation in the presence of lot splitting and multiple units of the same machine
- Throughput equivalencies in fork/ join queueing networks with finite buffers and general service times
- Algebraic modelling and performance evaluation of acyclic fork-join queueing networks
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- scientific article; zbMATH DE number 1406088 (Why is no real title available?)
- Control of fork-join processing networks with multiple job types and parallel shared resources
- Throughput scalability analysis of fork-join queueing networks
- Stochastic comparisons for rooted butterfly networks and tree networks, with random environments
- Task allocation in multiserver systems -- a survey of results.
- Biased Processor Sharing in Fork-Join Queues
- Approximate analysis of a closed fork/join model
This page was built for publication: Acyclic fork-join queuing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3830791)