This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Performance Prediction of Parallel Computations with Precedent Constraints
May 2000 (vol. 11 no. 5)
pp. 491-508

Abstract—Performance analysis of concurrent executions in parallel systems has been recognized as a challenging problem. The aim of this research is to study approximate but efficient solution techniques for this problem. We model the structure of a parallel machine and the structure of the jobs executing on such a system. We investigate rich classes of jobs, which can be expressed by series, parallel-and, parallel-or, and probabilistic-fork. We propose an efficient performance prediction method for these classes of jobs running on a parallel environment which is modeled by a standard queueing network model. The proposed prediction method is computationally efficient, it has polynomial complexity in both time and space. The time complexity is $O(C^{2}N^{2}K)$ and the space complexity is $O(C^{2}N^{2}K)$, where $C$ is the number of job classes in the system, the number of tasks in each job class is $O(N)$, and $K$ is the number of service centers in the queueing model. The accuracy of the approximate solution is validated via simulation.

[1] M. Reiser and S. Lavenberg, “Mean-Value Analysis of Closed Multichain Queueing Networks,” J. ACM, vol. 27, no. 2, pp. 313-322, 1980.
[2] G. Fox,M. Johnson,G. Lyzenga,S. Otto,J. Salmon,, and D. Walker,Solving Problems on Concurrent Processors, Vol. I: General Techniques andRegular Problems.Englewood Cliffs, N.J.: Prentice Hall 1988.
[3] R. Jain, The Art of Computer Systems Performance Analysis. New York: Wiley, Inc. 1991.
[4] A. Kalpelnikov, R.R. Muntz, and M.D. Ercegovac, “A Modeling Methodology for the Analysis of Concurrent Systems and Computations,” J. Parallel and Distributed Computing, vol. 6, pp. 568–597, 1989.
[5] V.W. Mak and S.F. Lundstrom, “Predicting Performance of Parallel Computations,” IEEE Trans. Parallel and Distributed Systems, vol. 1, pp. 257–270, July 1990.
[6] V. Mak, “Performance Prediction of Concurrent Systems,” Technical Report CSL-TR-87-344, Computer Systems Laboratory, Standford Univ., Dec. 1987.
[7] P. Heidelberger and K. Trivedi, “Queueing Network Models for ParallelProcessing with Asynchronous Tasks,” IEEE Trans. Computers, vol. 31, pp. 1,099–1,109 Nov. 1982.
[8] P. Heidelberger and K.S. Trivedi, “Analytic Queueing Models for Programs with Internal Concurrency,” IEEE Trans. Computers, vol. 32 pp. 73–82, Jan. 1983.
[9] R. Nelson and A. Tantawi, “Approximate Analysis of Fork/Join Synchronization in Parallel Queues,” IEEE Trans. Computers, vol. 37, pp. 739–743, June 1988.
[10] R. Nelson and A. Tantawi, “Comparison of Task Response Times in Parallel Systems,” IBM technical report, May 1986.
[11] R. Nelson, D. Towsley, and A. Tantawi, “Performance Analysis of Parallel Processing Systems,” IEEE Trans. Software Engineering, vol. 14, pp. 532–539, Apr. 1988.
[12] W.W. Chu and K.K. Leung, “Task Response Time Model and its Applications for Real-Time Distributed Processing Systems,” Proc. Fifth Real-Time Symp., pp. 225–236, Dec. 1984.
[13] W. Chu and K.K. Leung, “Module Replication and Assignment for Real-Time Distributed Processing Systems,” Proc. IEEE, vol. 75, pp. 547–562, May 1987.
[14] A. Thomasian and P.F. Bay, "Analytic Queueing Network Models for Parallel Processing of Task Systems," IEEE Trans. Computers, vol. 35, no. 12, pp. 1,045-1,054, Dec. 1986.
[15] 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.
[16] K. Kant, “Analysis and Synthesis of Generalized Task Graphs,” The Second SRDS, pp. 107–118, Aug. 1990.
[17] A. Thomasian and P. Bay, “Queueing Network Models for ParallelProcessing of Task Systems,” Proc. 1983 Int'l Conf. Parallel Processing, pp. 421–428, 1983.
[18] L. Kleinrock, Queueing Systems: Volume 1; Theory. Wiley, 1975.
[19] S. Lavenberg and M. Reiser, “Stationary State Probabilities of Arrival Instants for Closed Queueing Networks with Multiple Types of Customers,” J. Applied Probability, vol. 17, pp. 1,048–1,061, Dec. 1980.
[20] P. Schweitzer, “Approximate Analysis of Multiclass Closed Networks of Queues,” Int'l Conf. Stochastic Control and Optimization, June 1979.
[21] J. Little, “A Proof for Queueing Formula$l=\lambda w$,” Operations Research, vol. 9, pp. 383–387, Apr. 1967.
[22] J. Zahorjan, “The Approximation Solution of Large Queueing Network Models,” PhD dissertation, Univ. Toronto, Toronto, Canada, Aug. 1980.
[23] S. Salza and S. Lavenberg, “Approximating Reponse Time Distributions in Closed Queueing Network Models of Computer Performance,” Performance '81, pp. 133–145, May 1981.
[24] H.A. David, Order Statistics. New York: John Wiley, 1981.
[25] K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Prentice Hall, 1982.
[26] H. Schwetman, "CSIM: A C-based, Process Oriented Simulation Language," Proc. 1991 Winter Simulation Conf., pp. 387-396, 1991.
[27] L. Kleinrock, Queueing Systems: Volume 2; Computer Applications. New York: Wiley, 1975.

Index Terms:
Concurrent programs, distributed systems, parallel processing, performance evaluation, queueing networks, task graphs.
Citation:
De-Ron Liang, Satish K. Tripathi, "On Performance Prediction of Parallel Computations with Precedent Constraints," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 5, pp. 491-508, May 2000, doi:10.1109/71.852402
Usage of this product signifies your acceptance of the Terms of Use.