Performability Analysis of Fork-join Queueing Systems

DOI10.1057/JORS.1995.171MaRDI QIDQ4864352zbMATH OpenOpenAlexFDO

Authors P. Sundarrajan, Y. Narahari

Publication date 18 February 1996

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1995.171

zbMATH Keywords

automated manufacturingparallel processing systemsfork-join queueing systems

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Production models (90B30)

Recommendations

• Analysis of the fork-join queue
• Analysis of a fork/join synchronization station with inputs from Coxian servers in a closed queuing network
• scientific article; zbMATH DE number 148327
• A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
• Analysis of a fork/join station with inputs from a finite population subnetwork with multi-server stations

Cited in

(7)

• Reducing Response Time in Fork-Join Systems under Heavy Traffic Via Imbalance Control
• Performance evaluation of fork and join synchronization primitives
• Analysis of a fork/join synchronization station with inputs from Coxian servers in a closed queuing network
• Fork and Join Queueing Networks with Heavy Tails: Scaling Dimension and Throughput Limit
• Analytical approximations to predict performance measures of manufacturing systems with general distributions, job failures and parallel processing
• Performance evaluation of a single queue capable of handling two like jobs as a single entity
• Asymptotic analysis of intensity of Poisson flows assembly

This page was built for publication: Performability Analysis of Fork-join Queueing Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864352)