Allocating Independent Subtasks on Parallel Processors
IEEE Transactions on Software Engineering
Data networks
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
Acyclic fork-join queuing networks
Journal of the ACM (JACM)
Analysis of the Effects of Delays on Load Sharing
IEEE Transactions on Computers
Discrete Mathematical Structures with Applications to Computer Science
Discrete Mathematical Structures with Applications to Computer Science
Stochastic Analysis of Computer and Communication Systems
Stochastic Analysis of Computer and Communication Systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
On the optimal allocation of customers that must depart in sequence
Operations Research Letters
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
An efficient and effective performance evaluation method for multiprogrammed multiprocessor systems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
A Hybrid Solution of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Parallel and Distributed Systems
Response Time Analysis of Parallel Computer and Storage Systems
IEEE Transactions on Parallel and Distributed Systems
Value-maximizing deadline scheduling and its application to animation rendering
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Stochastic robustness metric and its use for static resource allocations
Journal of Parallel and Distributed Computing
Performance evaluation of a synchronization station with multiple inputs and population constraints
Computers and Operations Research
An extended evaluation of two-phase scheduling methods for animation rendering
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
| Hi-index | 0.00 |
The authors model a parallel processing system comprising several homogeneouscomputers interconnected by a communication network. Jobs arriving to this system havea linear fork-join structure. Each fork of the job gives rise to a random number of tasksthat can be processed independently on any of the computers. Since exact analysis offork-join models is known to be intractable, the authors resort to obtaining analyticalbounds to the mean job response time of the fork-join job. For jobs with a single fork-joinand, probabilistic allocation of tasks of the job to the N processors, they obtain upperand lower bounds to the mean job response time. Upper bounds are obtained using theconcept of associated random variables and are found to be a good approximation to themean job response time. A simple lower bound is obtained by neglecting queueing delays. They also find two lower bounds that include queueing delays. For multiple fork-join jobs, they study an approximation based on associated random variables. Finally, two versions of the join-the-shortest-queue (JSQ) allocation policy (i.e., JSQ by batch and JSQ by task) are studied and compared, via simulations and diffusion limits.