Abstract
Achieving satisfactory performance results in heterogeneous computing environments, such as network of workstations (NOWs) made up of dissimilar processing elements, requires a careful choice of the workload to be assigned to each target machine. The use of approximate analytical models can help to understand which are the parameters that mostly affect performance. In this paper we will show how to study analytically the behavior of an existing parallel program, a Cholesky factorization code, running in a heterogeneous NOW under the PVM run-time system. Firstly, the Cholesky factorization algorithm is introduced, along with a description of the target computing environment. After an analysis of the load distribution, the construction of the analytical model of the application is described in thorough detail. Finally, the results predicted through the model are compared to the performance figures obtained by executing the program in the real computing environment.
Similar content being viewed by others
References
T. E. Anderson, D. E. Culler, and D. A. Patterson. A Case for NOW (Networks of Workstations). IEEE Micro, 15:54–64, 1995.
R. Aversa, A. Mazzeo, N. Mazzocca, and U. Villano. Heterogeneous system performance prediction and analysis using PS. IEEE Concurrency, 6:20–29, 1998.
R. Aversa, A. Mazzeo, N. Mazzocca, and U. Villano. Developing applications for heterogeneous computing environments using simulation: A case study. Parallel Computing, 24:741–761, 1998.
L. S. Blackford, J. Choi, A. Cleary, E. D'Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R. C. Whaley. ScaLAPACK Users' Guide, SIAM, Philadelphia, PA, 1997.
P. Boulet, J. Dongarra, F. Rastello, Y. Robert, and F. Vivien. Algorithmic issues on heterogeneous computing platforms. Parallel Processing Letters, 9:197–213, 1999.
J. Choi, J. Dongarra, S. Ostrouchov, A. Petitet, D. Walker, and R. C. Whaley. The design and implementation of the ScaLAPACK LU, QR, and Cholesky factorization routines. Scientific Programming, 5:173–184, 1996.
M. Cierniak, M. J. Zaki, and W. Li. Compile-time scheduling algorithms for heterogeneous network of workstations. The Computer Journal, 40:356–372, 1997.
B. Di Martino, A. Mazzeo, N. Mazzocca, and U. Villano. Parallel program analysis and restructuring by detection of point-to-point interaction patterns and their transformation into collective communication constructs. Science of Computer Programming, 40:235–263, 2001.
J. Dongarra and T. Dunigan. Message-passing performance of various computers. Tech Rep UT-CS-95-299, University of Tennessee, 1996.
A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM: Parallel Virtual Machine, MIT Press, Cambridge, MA, 1994.
M. T. Heath and J. A. Etheridge. Visualizing the performance of parallel programs. IEEE Software, 8:29–39, 1991.
R. W. Hockney and C. R. Jesshope. Parallel Computers 2, Adam Hilger, Philadelphia, PA, 1988.
J. Labarta, S. Girona, V. Pillet, T. Cortes, and L. Gregoris. DiP: A parallel program development environment. In Proc. Euro-Par '96, pp. II665–II674, 1996.
A. Mazzeo, N. Mazzocca, and U. Villano. Efficiency measurements in heterogeneous distributed computing systems: From theory to practice. Concurrency: Practice and Experience, 10:285–313, 1998.
B. Qin, H. A. Sholl, and R. A. Ammar. Micro time cost analysis of parallel computations. IEEE Trans. On Comp., 40:613–628, 1991.
M. R. Steed and M. J. Clement. Performance Prediction of PVM Programs, In Proc. 10th Int. Par. Proc. Symp., 803–807, 1996.
R. van de Geijn. Using PLAPACK: Parallel Linear Algebra Package, MIT Press, Cambridge, MA, 1997.
J. Yan, S. Sarukkai, and P. Mehra. Performance measurement, visualization and modeling of parallel and distributed programs using the AIMS toolkit. Software-Practice and Experience, 25:429–461, 1995.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Aversa, R., Mazzocca, N. & Villano, U. A Case Study of Application Analytical Modeling in Heterogeneous Computing Environments: Cholesky Factorization in a NOW. The Journal of Supercomputing 24, 5–24 (2003). https://doi.org/10.1023/A:1020968009122
Issue Date:
DOI: https://doi.org/10.1023/A:1020968009122