Approximate analysis of a closed fork/join model
From MaRDI portal
Publication:806208
DOI10.1016/0377-2217(91)90071-3zbMath0729.60098OpenAlexW1966136240MaRDI QIDQ806208
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://www.lib.ncsu.edu/resolver/1840.4/1178
approximation algorithmmean response timeclosed queueing systemexponential service timesfork/join operation
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (5)
ANALYTICAL APPROXIMATIONS FOR KITTING SYSTEMS WITH MULTIPLE INPUTS ⋮ Analysis of a fork/join station with inputs from a finite population subnetwork with multi-server stations ⋮ 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 ⋮ Approximate analysis of a closed fork/join model
Cites Work
- Performance evaluation of fork and join synchronization primitives
- Approximate analysis of a closed fork/join model
- Two Parallel Queues Created by Arrivals with Two Demands I
- Two Parallel Queues Created by Arrivals with Two Demands II
- Acyclic fork-join queuing networks
- Analytic Queueing Models for Programs with Internal Concurrency
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
This page was built for publication: Approximate analysis of a closed fork/join model