Analysis of the fork-join queue

DOI10.1109/12.16501MaRDI QIDQ3817592zbMATH OpenOpenAlexWikidataFDO

Authors Cheeha Kim, Ashok K. Agrawala

Publication date 1989

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.16501

zbMATH Keywords

fork-join queueparallel processingresponse timesynchronizationsvirtual waiting times

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Recommendations

• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• Mean sojourn times in two-queue fork-join systems: bounds and approximations
• Approximate analysis of a closed fork/join model
• A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
• ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL

Cited in

(28)

• Analysis of a fork/join station with inputs from a finite population subnetwork with multi-server stations
• Performance analysis and buffer allocations in some open assembly systems.
• Fork-Join program response time on multiprocessors with exchangeable join
• A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
• 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
• Estimating completion time ratios of a fork-join barrier synchronization
• An approximation method for general closed queuing networks with Fork/Join mechanisms
• Queueing with redundant requests: exact analysis
• scientific article; zbMATH DE number 148327 (Why is no real title available?)
• Mean sojourn times in two-queue fork-join systems: bounds and approximations
• Response times in M/M/s fork-join networks
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• Performability Analysis of Fork-join Queueing Systems
• Bounds and Approximations for Overheads in the Time to Join Parallel Forks
• Large fork-join queues with nearly deterministic arrival and service times
• On the control of fork-join networks
• Sojourn times in G/M/1 fork-join networks
• scientific article; zbMATH DE number 2196402 (Why is no real title available?)
• Performance evaluation of fork and join synchronization primitives
• Nonlinear approximation of characteristics of a fork-join queueing system with Pareto service as a model of parallel structure of data processing
• Biased Processor Sharing in Fork-Join Queues
• Stochastic customer order scheduling to minimize long-run expected order cycle time
• Extreme values for the waiting time in large fork-join queues
• Approximate analysis of a closed fork/join model
• Generalized parallel-server fork-join queues with dynamic task scheduling
• Departure process in a mixed fork-join synchronization network

This page was built for publication: Analysis of the fork-join queue

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