Approximate analysis of a closed fork/join model
From MaRDI portal
Recommendations
- An Analytical Throughput Approximation for Closed Fork/Join Networks
- An approximation method for general closed queuing networks with Fork/Join mechanisms
- Analysis of the fork-join queue
- Mean sojourn times in two-queue fork-join systems: bounds and approximations
- On a class of approximations for closed queueing networks
Cites work
- Acyclic fork-join queuing networks
- Analytic Queueing Models for Programs with Internal Concurrency
- Approximate analysis of a closed fork/join model
- Performance evaluation of fork and join synchronization primitives
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- Two Parallel Queues Created by Arrivals with Two Demands I
- Two Parallel Queues Created by Arrivals with Two Demands II
Cited in
(11)- Manufacturing cell formation in the presence of lot splitting and multiple units of the same machine
- Analysis of a fork/join station with inputs from a finite population subnetwork with multi-server stations
- ANALYTICAL APPROXIMATIONS FOR KITTING SYSTEMS WITH MULTIPLE INPUTS
- Throughput equivalencies in fork/ join queueing networks with finite buffers and general service times
- An approximation method for general closed queuing networks with Fork/Join mechanisms
- Nonlinear approximation of characteristics of a fork-join queueing system with Pareto service as a model of parallel structure of data processing
- Analysis of the fork-join queue
- Approximate analysis of a closed fork/join model
- Biased Processor Sharing in Fork-Join Queues
- A closer look at multiple forking: leveraging (in)dependence for a tighter bound
- An Analytical Throughput Approximation for Closed Fork/Join Networks
This page was built for publication: Approximate analysis of a closed fork/join model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q806208)
