An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
A performance evaluation of a general parallel processing model
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The CAEDE performance analysis tool
SETA1 Proceedings of the first international symposium on Environments and tools for Ada
A performance evaluation of several priority policies for parallel processing systems
Journal of the ACM (JACM)
Bound Performance Models of Heterogeneous Parallel Processing Systems
IEEE Transactions on Parallel and Distributed Systems
A Hybrid Solution of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Parallel and Distributed Systems
Analysis of Fork-Join Program Response Times on Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Computing Performance Bounds of Fork-Join Parallel Programs Under a Multiprocessing Environment
IEEE Transactions on Parallel and Distributed Systems
Response Time Analysis of Parallel Computer and Storage Systems
IEEE Transactions on Parallel and Distributed Systems
Advances in Model Representations
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Performance analysis and buffer allocations in some open assembly systems
Computers and Operations Research
A tool for the analysis of hierarchical service-oriented extended open fork/join queueing networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
A study of the convergence of steady state probabilities in a closed fork-join network
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Closed form approximations for steady state probabilities of a controlled fork-join network
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
On parametric steady state analysis of a generalized stochastic petri net with a fork-join subnet
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
| Hi-index | 14.98 |
A fork-join queue is considered as a typical model of parallel processing systems with arrival and departure synchronizations. An approach for obtaining the transient and the steady-state solutions of the fork-join queue in terms of the virtual waiting times, which can be used to obtain the response time and the delay between the fork and the join instants, is presented. With the restriction of the service time being the Erlangian distribution, the formulations result in a form of a series, the worth of which is in actually computing numerical results. The joint-state-occupancy probabilities can be easily deduced from the results. The approximate solutions in the steady state are presented for the cases where the interarrival time distributions are exponential and hyperexponential, and the service-time distributions are exponential and two-state Erlangian. The parallelism achievable with synchronization constraints is examined from the approximations.