This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Response Time Analysis of Parallel Computer and Storage Systems
November 2001 (vol. 12 no. 11)
pp. 1146-1161

Abstract—Fork-join structures have gained increased importance in recent years as a means of modeling parallelism in computer and storage systems. The basic fork-join model is one in which a job arriving at a parallel system splits into K independent tasks that are assigned to K unique, homogeneous servers. In this paper, a simple response time approximation is derived for parallel systems with exponential service time distributions. The approximation holds for networks modeling several devices, both parallel and nonparallel. (In the case of closed networks containing a stand-alone parallel system, a mean response time bound is derived.) In addition, the response time approximation is extended to cover the more realistic case wherein a job splits into an arbitrary number of tasks upon arrival at a parallel system. Simulation results for closed networks with stand-alone parallel subsystems and exponential service time distributions indicate that the response time approximation is, on average, within 3 percent of the seeded response times. Similarly, simulation results with nonexponential distributions also indicate that the response time approximation is close to the seeded values. Potential applications of our results include the modeling of data placement in disk arrays and the execution of parallel programs in multiprocessor and distributed systems.

[1] V.A.F. Almeida and L.W. Dowdy, “A Reduction Technique for Solving Queueing Network Models of Programs with Internal Concurrency,” Proc. Third Int'l Conf. Supercomputing, May 1988.
[2] F. Baccelli, “Two Parallel Queues Created by Arrivals with Two Demands: The M/G/2 Symmetrical Case,” Technical Report 426, Inst. Nat'l de Recherche en Informatique et en Automatique, July 1985.
[3] F. Baccelli, W.A. Massey, and D. Towsley, "Acyclic Fork-Join Queueing Network", J. ACM, vol. 36, no. 3, July 1989.
[4] F. Baccelli and Z. Liu, “On the Execution of Parallel Programs on Multiprocessor Systems—A Queueing Theory Approach,” J. ACM, vol. 37, no. 2, pp. 373-414, Apr. 1990.
[5] F. Baskett, K.M. Chandy, R.R. Muntz, and R. Palacios, “Open, Closed and Mixed Networks of Queues with Different Classes of Customers,” J. ACM, vol. 22, no. 2, pp. 248-260, 1975.
[6] S. Balsamo, L. Donatiello, and N.M. Van Dijk, “Bound Performance Models of Heterogeneous Parallel Processing Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 10, Oct. 1998.
[7] R.B. Cooper, Introduction to Queueing Theory, third edition, Maryland: Mercury Press/Fairchild, 1990.
[8] L. Flatto and S. Hahn, “Two Parallel Queues Created by Arrivals with Two Demands I,” SIAM J. Applied Math., vol. 44, pp. 1041-1053, Oct. 1984.
[9] L. Flatto, “Two Parallel Queues Created by Arrivals with Two Demands II,” SIAM J. Applied Math., vol. 45, pp. 861-878, Oct. 1985.
[10] P. Heidelberger and S.K. Trivedi, “Queueing Network Models for Parallel Processing with Asynchronous Tasks,” IEEE Trans. Computers, vol. 31, no. 11, pp. 1099-1109, Nov. 1982.
[11] P. Heidelberger and S.K. Trivedi, “Analytic Queueing Models for Programs with Internal Concurrency,” IEEE Trans. Computers, vol. 32, pp. 73-82, Jan. 1983.
[12] C. Kim and A.K. Agrawala, "Analysis of the Fork-Join Queue," IEEE Trans. Computers, vol. 38, pp. 250-255, no. 2, 1989.
[13] A. Kumar and R. Shorey, "Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Mutilcomputer System," IEEE Trans. Parallel and Distributed. Systems, vol. 4, no. 10, pp. 1,147-1,164, Oct. 1993.
[14] E.D. Lazowska, J. Zahorjan, G.S. Graham, and K.C. Sevcik, Quantitative System Performance, Prentice Hall, pp 64-66, 1984.
[15] E.K. Lee and R.H. Katz, "An Analytic Performance Model of Disk Arrays," Proc. 1993 SIGMETRICS Conf. Measurement and Modeling of Computer Systems, pp. 98-109,Santa Clara, Calif., 1993.
[16] Y.C. Liu and H.G. Perros, “Approximate Analysis of a Closed Fork/Join Model,” European J. Operational Research, vol. 53, pp. 382-392, 1991.
[17] Y.C. Liu and H.G. Perros, “A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System,” IEEE Trans. Computers, vol. 40, no. 3, pp. 365-370, Mar. 1991.
[18] R.R. Muntz and J.C.S. Lui, “Bounding the Response Time of a Minimum Expected Delay Routing System,” IEEE Trans. Computers, vol. 44, no. 5, pp. 1371-1382, Dec. 1995.
[19] 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 and Distributed Systems, vol. 9, no. 3, pp. 295-311, Mar. 1998.
[20] S. Varma and A.M. Makowski, "Interpolation Approximations for Symmetric Fork-Join Queues," Proc. Performance '93, pp. 245-273,Rome, 1993.
[21] R. Nelson and A. Tantawi, “Approximate Analysis of Fork/Join Synchronization in Parallel Queues,” IEEE Trans. Computers, vol. 37, pp. 739–743, June 1988.
[22] M. Reiser and S. Lavenberg, “Mean-Value Analysis of Closed Multichain Queueing Networks,” J. ACM, vol. 27, no. 2, pp. 313-322, 1980.
[23] A. Thomasian and A. Tantawi, "Approximate Solutions for M/G/1 Fork-Join Synchronization," Proc. Winter Simulation Conf., pp. 361-368,Orlando, Fla., Dec. 1994.
[24] A. Thomasian and J. Menon, “Approximate Analysis for Fork-Join Synchronization in RAID5,” Computer Systems: Science and Eng., 1997.
[25] A. Thomasian and J. Menon, RAID5 Performance with Distributed Sparing IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 6, pp. 640-657, June 1997.
[26] K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Prentice Hall, 1982.
[27] E. Varki and L.W. Dowdy, “Analysis of Closed Balanced Fork-Join Queueing Networks,” Proc. ACM/SIGMETRICS, vol. 24, no. 1, pp. 232-241, May 1996.
[28] E. Varki, “Mean Value Technique for Closed Fork-Join Networks,” Proc. ACM SIGMETRICS Conf. Measurement and Modeling of Computer Systems, pp. 103-112, May 1999.
[29] E. Varki, L.W. Dowdy, and C. Zhang, “Quick Performance Bounds for Parallel Networks,” technical report, Univ. of New Hampshire, Feb. 2000.
[30] E. Varki and X.S. Wang, “An Approximate Performance Model of Disk Array Storage Systems,” Proc. Computer Measurement Group's 2000 Int'l Conf., Dec. 2000.

Index Terms:
Performance evaluation, fork-join networks, parallel computer and storage systems, mean-value analysis.
Citation:
Elizabeth Varki, "Response Time Analysis of Parallel Computer and Storage Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 11, pp. 1146-1161, Nov. 2001, doi:10.1109/71.969125
Usage of this product signifies your acceptance of the Terms of Use.