Approximate Analysis of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Computers
Performance Analysis of Parallel Processing Systems
IEEE Transactions on Software Engineering
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
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System
IEEE Transactions on Parallel and Distributed Systems
Mean value technique for closed fork-join networks
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Integrated Performance Models for SPMD Applications and MIMD Architectures
IEEE Transactions on Parallel and Distributed Systems
Response Time Analysis of Parallel Computer and Storage Systems
IEEE Transactions on Parallel and Distributed Systems
Integrated Performance Models for SPMD Applications and MIMD Architectures
IEEE Transactions on Parallel and Distributed Systems
A model of periodic acknowledgement
Performance Evaluation
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
Performance models for hierarchical grid architectures
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
Cycle times in a serial fork-join network
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
| Hi-index | 0.00 |
Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to obtain secure lower and upper bounds on the performance of these systems. The bounding models are solved by using a matrix-geometric algorithmic approach. Formal proofs of the bounds are provided along with error bounds on the accuracy of the bounds. These error bounds in turn are reduced to simple computational expressions. Numerical results are included. The results are of interest for application to arbitrary fork-join models with parallel heterogeneous processors and synchronization.