Approximate Analysis of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Computers
Analysis of the Fork-Join Queue
IEEE Transactions on Computers
Acyclic fork-join queuing networks
Journal of the ACM (JACM)
Interpolation approximations for symmetric Fork-Join queues
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Bound Performance Models of Heterogeneous Parallel Processing Systems
IEEE Transactions on Parallel and Distributed Systems
Output models of MAP/PH/1(/K) queues for an efficient network decomposition
Performance Evaluation
Computing Performance Bounds of Fork-Join Parallel Programs Under a Multiprocessing Environment
IEEE Transactions on Parallel and Distributed Systems
Approximate Analysis of Networks of PH|PH|1|K Queues: Theory & Tool Support
MMB '95 Proceedings of the 8th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation: Quantitative Evaluation of Computing and Communication Systems
The Queuing Network Analysis Tool (QNAT)
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
ETAQA Truncation Models for the MAP/MAP/1 Departure Process
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Java Modelling Tools: an Open Source Suite for Queueing Network Modelling andWorkload Analysis
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
An Approximate Analytical Method for General Queueing Networks
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
In this paper we present a tool for the analysis of hierarchical service-oriented extended open fork/join queueing networks (EOFJQNs). The tool especially focusses on application areas that consider a service-oriented respectively processoriented view of systems. Such application areas are for example business process management, logistics, supply chain management, production planing and control, and computer and communication systems. Since parallel process execution is a typical property of corresponding models we consider extended queueing networks that incorporate complex fork/join structures. For the analysis of EOFJQNs we apply a frequently used decomposition approach and we additionally approximate inter-arrival times and service times with phase-type distributions. Then the analysis of the isolated nodes is based on their underlying quasi-birth-and-death process. In this context the main problem is the analysis of complex fork/join structures. Therefore, at first we briefly reflect an approach for the analysis of rather simple fork/join nodes and afterwards apply a new aggregation techniques that allows us to reduce complex fork/join structures to simple fork/join nodes. We apply our tool to the analysis of a parallel production line.