An Upper Bound Solution for Homogeneous Fork/Join Queuing Systems
暂无分享,去创建一个
[1] P. Konstantopoulos,et al. Stationary and stability of fork-join networks , 1989, Journal of Applied Probability.
[2] Kishor S. Trivedi,et al. Analytic Queueing Models for Programs with Internal Concurrency , 1983, IEEE Transactions on Computers.
[3] Tobias Kiesling. Using Approximation with Time-Parallel Simulation , 2005, Simul..
[4] Donald F. Towsley,et al. Computing Performance Bounds of Fork-Join Parallel Programs Under a Multiprocessing Environment , 1998, IEEE Trans. Parallel Distributed Syst..
[5] Lester Lipsky,et al. Queueing Theory: A Linear Algebraic Approach , 1992 .
[6] Harry G. Perros,et al. A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System , 1991, IEEE Trans. Computers.
[7] Asser N. Tantawi,et al. Approximate Analysis of Fork/Join Synchronization in Parallel Queues , 1988, IEEE Trans. Computers.
[8] Elizabeth Varki,et al. Response Time Analysis of Parallel Computer and Storage Systems , 2001, IEEE Trans. Parallel Distributed Syst..
[9] Alan Weiss,et al. Allocating Independent Subtasks on Parallel Processors , 1985, IEEE Transactions on Software Engineering.
[10] Donald F. Towsley,et al. Acyclic fork-join queuing networks , 1989, JACM.
[11] Donald F. Towsley,et al. Analysis of Fork-Join Program Response Times on Multiprocessors , 1990, IEEE Trans. Parallel Distributed Syst..
[12] Haiying Zhang,et al. A Fast Simulation for Thousands of General Homogeneous Fork/Join Queues , 2010, 2010 International Conference on Intelligent Systems, Modelling and Simulation.
[13] Leonard Kleinrock,et al. Queueing Systems: Volume I-Theory , 1975 .
[14] Ashok K. Agrawala,et al. Analysis of the Fork-Join Queue , 1989, IEEE Trans. Computers.
[15] Ray Jinzhu Chen. A Hybrid Solution of Fork/Join Synchronization in Parallel Queues , 2001, IEEE Trans. Parallel Distributed Syst..
[16] L. Flatto,et al. Two parallel queues created by arrivals with two demands. II , 1984 .
[17] L. Flatto,et al. Erratum: Two Parallel Queues Created by Arrivals with Two Demands I , 1985 .
[18] Anurag Kumar,et al. Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System , 1993, IEEE Trans. Parallel Distributed Syst..
[19] Donald F. Towsley,et al. Bounding the Mean Response Time of the Minimum Expected Delay Routing Policy: An Algorithmic Approach , 1995, IEEE Trans. Computers.
[20] Simonetta Balsamo,et al. On Queue Length Moments in Fork and Join Queuing Networks with General Service Times , 1997, Computer Performance Evaluation.
[21] R. Serfozo,et al. Response times in M/M/s fork-join networks , 2004, Advances in Applied Probability.
[22] F. Baccelli,et al. The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds , 1989, Advances in Applied Probability.
[23] Kishor S. Trivedi,et al. Queueing Network Models for Parallel Processing with Asynchronous Tasks , 1982, IEEE Transactions on Computers.
[24] Asser N. Tantawi,et al. Performance analysis of parallel processing systems , 1987, SIGMETRICS '87.