Performance analysis of parallel processing systems with horizontal decomposition

Proceedings - 2012 IEEE International Conference on Cluster Computing, CLUSTER 2012

Volumn , Issue , 2012, Pages 220-229

  Chen, Hanwei ^a   Yin, Jianwei ^a   Pu, Calton ^b  

^a ZHEJIANG UNIVERSITY   (China)

^b Georgia Institute of Technology   (United States)

Author keywords

fork join queueing network; horizontal decomposition; parallel processing; performance analysis

Indexed keywords

CLUSTER COMPUTING; COMPUTER ARCHITECTURE; QUEUEING NETWORKS;

CLUSTER SYSTEMS; EVALUATION RESULTS; HIERARCHICAL DECOMPOSITIONS; HORIZONTAL DECOMPOSITIONS; NUMBER OF ITERATIONS; PARALLEL PROCESSING; PERFORMANCE ANALYSIS; PRODUCT-FORM NETWORKS;

PARALLEL PROCESSING SYSTEMS;

EID: 84870690620     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTER.2012.11     Document Type: Conference Paper

References (24)

1. L. Flatto and S. Hahn, "Two parallel queues created by arrivals with two demands i," SIAM Journal on Applied Mathematics, vol. 44, no. 5, pp. 1041-1053, 1984.
2. E. Varki, "Response time analysis of parallel computer and storage systems," IEEE Trans. Parallel Distrib. Syst., vol. 12, pp. 1146-1161, November 2001.
3. A. Krishnamurthy and R. Suri, "Performance analysis of single stage kanban controlled production systems using parametric decomposition," Queueing Systems: Theory and Applications, vol. 54, pp. 141-162, October 2006.
4. E. Sonmez, A. Scheller-Wolf, and N. Secomandi. (2009) An analytical approximation for the throughput of a closed fork-join network with multi-station input subnetworks. Tepper School of Business. [Online]. Available: http://repository.cmu.edu/tepper/434
5. H. C. Zhao, C. H. Xia, Z. Liu, and D. Towsley, "A unified modeling framework for distributed resource allocation of general fork and join processing networks," in Proceedings of the ACM SIGMETRICS'10: International Conference on Measurement and Modeling of Computer Systems. New York, NY, USA: ACM, 2010, pp. 299-310.
6. A. Thomasian and P. F. Bay, "Analytic queueing network models for parallel processing of task systems," IEEE Trans. Comput., vol. 35, pp. 1045-1054, December 1986.
7. J. Yin, H. Chen, S. Deng, Z. Wu, and C. Pu, "A dependable esb framework for service integration," IEEE Internet Computing, vol. 13, no. 2, pp. 26-34, Mar. 2009. [Online]. Available: http://dx.doi.org/10.1109/MIC. 2009.26
8. P. Heidelberger and K. S. Trivedi, "Queueing network models for parallel processing with asynchronous tasks," IEEE Trans. Comput., vol. 31, pp. 1099-1109, November 1982.
9. F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, "Open, closed, and mixed networks of queues with different classes of customers," Journal of the ACM, vol. 22, pp. 248-260, April 1975.
10. M. Bertoli, G. Casale, and G. Serazzi, "The jmt simulator for performance evaluation of non-product-form queueing networks," in Proceedings of the 40th Annual Simulation Symposium. Washington, DC, USA: IEEE Computer Society, 2007, pp. 3-10.
11. P. Heidelberger and K. S. Trivedi, "Analytic queueing models for programs with internal concurrency," IEEE Trans. Comput., vol. 32, pp. 73-82, January 1983.
12. R. Nelson and A. N. Tantawi, "Approximate analysis of fork/join synchronization in parallel queues," IEEE Trans. Comput., vol. 37, pp. 739-743, June 1988.
13. A. Thomasian and A. N. Tantawi, "Approximate solutions for m/g/1 fork/join synchronization," in Proceedings of the 26th Conference on Winter Simulation. San Diego, CA, USA: Society for Computer Simulation International, 1994, pp. 361-368.
14. R. J. Chen, "A hybrid solution of fork/join synchronization in parallel queues," IEEE Trans. Parallel Distrib. Syst., vol. 12, no. 8, pp. 829-845, Aug. 2001. [Online]. Available: http://dx.doi.org/10.1109/71.946659
15. F. Baccelli and A. Makowski, "Simple computable bounds for the fork-join queue," INRIA, Tech. Rep. RR-0394, Apr. 1985. [Online]. Available: http://hal.inria.fr/inria-00076162/en/
16. J. C. S. Lui, R. R. Muntz, and D. Towsley, "Computing performance bounds of fork-join parallel programs under a multiprocessing environment," IEEE Trans. Parallel Distrib. Syst., vol. 9, pp. 295-311, March 1998.
17. F. Baccelli and W. Massey, "Series-parallel fork-join queueing networks and their stochastic ordering," INRIA, Tech. Rep. RR-0534, Jun. 1986. [Online]. Available: http://hal.inria.fr/inria-00076020/en/
18. C. Kim and A. K. Agrawala, "Analysis of the fork-join queue," IEEE Trans. Comput., vol. 38, pp. 250-255, February 1989.
19. F. Baccelli, W. A. Massey, and D. Towsley, "Acyclic fork-join queuing networks," Journal of the ACM, vol. 36, pp. 615-642, July 1989.
20. E. Varki, "Mean value technique for closed fork-join networks," in Proceedings of the ACM SIGMETRICS'99: International Conference on Measurement and Modeling of Computer Systems. New York, NY, USA: ACM, 1999, pp. 103-112.
21. M. Reiser and S. S. Lavenberg, "Mean-value analysis of closed multichain queuing networks," Journal of the ACM, vol. 27, pp. 313-322, April 1980.
22. A. Duda and T. Czachrski, "Performance evaluation of fork and join synchronization primitives," Acta Informatica, vol. 24, pp. 525-553, 1987.
23. Y. C. Liu and H. G. Perros, "A decomposition procedure for the analysis of a closed fork/join queueing system," IEEE Trans. Comput., vol. 40, pp. 365-370, March 1991.
24. B. Baynat and Y. Dallery, "An approximation method for general closed queuing networks with fork/join mechanisms," The Journal of the Operational Research Society, vol. 51, no. 2, pp. 198-208, 2000.