Approximate Analysis of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Computers
Queueing Systems Serving Task Families
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Scheduling in multiprogrammed parallel systems
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Acyclic fork-join queuing networks
Journal of the ACM (JACM)
Efficient distributed simulation
ACM SIGSIM Simulation Digest
Analysis of computation-communication issues in dynamic dataflow architectures
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
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 performance of multiprogrammed multiprocessor scheduling algorithms
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Scheduling parallel programs with non-uniform parallelism profiles
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Scheduling in parallel systems with a hierarchical organization of tasks
ICS '92 Proceedings of the 6th international conference on Supercomputing
The influence of random delays on parallel execution times
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A performance evaluation of several priority policies for parallel processing systems
Journal of the ACM (JACM)
Bounds on the speedup and efficiency of partial synchronization in parallel processing systems
Journal of the ACM (JACM)
A Hierarchical Task Queue Organization for Shared-Memory Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Execution Time Analysis of Communicating Tasks in Distributed Systems
IEEE Transactions on Computers
Bound Performance Models of Heterogeneous Parallel Processing Systems
IEEE Transactions on Parallel and Distributed Systems
Efficient distributed simulation
ANSS '89 Proceedings of the 22nd annual symposium on Simulation
Performance prediction based loop scheduling for heterogeneous computing environment
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Performance analysis for parallel solutions to generic search problems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
An efficient and effective performance evaluation method for multiprogrammed multiprocessor systems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
On Performance Prediction of Parallel Computations with Precedent Constraints
IEEE Transactions on Parallel and Distributed Systems
A Hybrid Solution of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Parallel and Distributed Systems
The Circulating Processor Model of Parallel Systems
IEEE Transactions on Computers
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
Computing Performance Bounds of Fork-Join Parallel Programs Under a Multiprocessing Environment
IEEE Transactions on Parallel and Distributed Systems
LISPACK-A Methodology and Tool for the Performance Analysis of Parallel Systems and Algorithms
IEEE Transactions on Software Engineering
Job Superscheduler Architecture and Performance in Computational Grid Environments
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Journal of Parallel and Distributed Computing
Using bulk arrivals to model I/O request response time distributions in zoned disks and RAID systems
Proceedings of the Fourth International ICST 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
Scheduling parallel processors: Structural properties and optimal policies
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.01 |
A bulk arrival M^x/M/c queueing system is used to model a centralized parallel processing system with job splitting. In such a system, jobs wait in a central queue, which is accessible by all the processors, and are split into independent tasks that can be executed on separate processors. The job response time consists of three components: queueing delay, service time, and synchronization delay. An expression for the mean job response time is obtained for this centralized parallel processing system. Centralized and distributed parallel processing systems (with and without job splitting) are considered and their performances compared. Furthermore, the effects of parallelism and overheads due to job splitting are investigated.