An End-to-End Approach to the Resequencing Problem
Journal of the ACM (JACM)
Allocating Independent Subtasks on Parallel Processors
IEEE Transactions on Software Engineering
Approximate Analysis of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Computers
Performance Analysis of Parallel Processing Systems
IEEE Transactions on Software Engineering
Queues as Harris recurrent Markov chains
Queueing Systems: Theory and Applications
The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
Journal of the ACM (JACM)
ADA Programming Language
Bounds for Two Server Fork-Join Queueing Systems
Bounds for Two Server Fork-Join Queueing Systems
Acyclic Fork-Join Queueing Networks
Acyclic Fork-Join Queueing Networks
On the execution of parallel programs on multiprocessor systems—a queuing theory approach
Journal of the ACM (JACM)
Unboundedly parallel simulations via recurrence relations
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
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
A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System
IEEE Transactions on Computers
Task Response Time for Real-Time Distributed Systems with Resource Contentions
IEEE Transactions on Software Engineering
Algorithms for unboundedly parallel simulations
ACM Transactions on Computer Systems (TOCS)
Multiple feedback queue as a model of general purpose multiprocessor systems
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Extremal scheduling of parallel processing with and without real-time constraints
Journal of the ACM (JACM)
A performance evaluation of several priority policies for parallel processing systems
Journal of the ACM (JACM)
Approximate response time distribution in Fork and Join systems
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Bound Performance Models of Heterogeneous Parallel Processing Systems
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
Unboundedly parallel simulations via recurrence relations for network and reliability problems
WSC' 90 Proceedings of the 22nd conference on Winter simulation
A Hybrid Solution of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Parallel and Distributed Systems
On a synchronization queue with two finite buffers
Queueing Systems: Theory and Applications
Analysis of Fork-Join Program Response Times on Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System
IEEE Transactions on Parallel and Distributed Systems
Analysis of Processor Allocation in Multiprogrammed, Distributed-Memory Parallel Processing Systems
IEEE Transactions on Parallel and Distributed Systems
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
Renewal processes on partially ordered sets
Random Structures & Algorithms
Advances in Model Representations
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Constant time per edge is optimal on rooted tree networks
Distributed Computing
Journal of Parallel and Distributed Computing
Approximate closed-form aggregation of a fork-join structure in generalised stochastic petri nets
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
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
Inverse problems in queueing theory and Internet probing
Queueing Systems: Theory and Applications
Optimal File Splitting for Wireless Networks with Concurrent Access
NET-COOP '09 Proceedings of the 3rd Euro-NF Conference on Network Control and Optimization
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
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
Stochastic comparisons for rooted butterfly networks and tree networks, with random environments
Information Sciences: an International Journal
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
Distributed resource allocation for stream data processing
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Scheduling parallel processors: Structural properties and optimal policies
Mathematical and Computer Modelling: An International Journal
A hybrid analysis method for multi-class queueing networks with multi-server nodes
Decision Support Systems
| Hi-index | 0.01 |
In this paper the class of acyclic fork-join queuing networks that arise in various applications, including parallel processing and flexible manufacturing are studied. In such queuing networks, a fork describes the simultaneous creation of several new customers, which are sent to different queues. The corresponding join occurs when the services of all these new customers are completed. The evolution equations that govern the behavior of such networks are derived. From this, the stability conditions are obtained and upper and lower bounds on the network response times are developed. These bounds are based on various stochastic ordering principles and on the notion of association of random variables.