Abstract
We analyze the performance obtainable on heterogeneous computing systems with data-parallel ring algorithms for the computation of long- and short-range interactions. The algorithms were originally developed for homogeneous parallel systems, where they yield a nearly linear speed-up. Two heterogeneous platforms are considered: a network of ALPHA Unix workstations and a network of Pentium PCs with Windows 2000. The parallel framework is PVM.
Our analysis shows that using a virtual ring of processes and assigning to each node a number of processes proportional to its relative speed, we greatly reduce load umbalancing and are able to achieve good performance even on highly heterogeneous systems. The analysis can be applied to similar problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Boulet, P., Dongarra, J., Robert, Y., Vivien, F.: Static tiling for heterogeneous computing platforms. Parallel Computing 25, 547–568 (1999)
Clematis, A., Corana, A.: Porting regular applications on heterogeneous workstation networks: performance analysis and modeling. Parallel Algorithms and Applications 17, 205–226 (2002)
Clematis, A., Dodero, G., Gianuzzi, V.: Efficient use of parallel libraries on heterogeneous networks of workstations. J. Systems Architecture 46, 641–653 (2000)
Corana, C.A.: Parallel computation of the correlation dimension from a time series. Parallel Computing 25, 639–666 (1999)
Fischer, M., Dongarra, J.: Experiences with Windows 95/NT as a cluster computing platform for parallel computing. J. Parallel and Distributed Computing Practices 2(2) (1999)
Fox, G.C., Johnson, M.A., Lyzenga, G.A., Otto, S.W., Salmon, J.K., Walker, D.W.: Solving Problems on Concurrent Processors, vol. 1. Prentice-Hall, Englewood Cliffs (1988)
Grassberger, P.: An optimized box-assisted algorithm for fractal dimensions. Phys. Lett. A 148, 63–68 (1990)
Hollingsworth, J.K., Guven, E., Akinlar, C.: Benchmarking a network of PCs running parallel applications. In: Proc. IEEE Int. Performance, Computing and Communications Conference, pp. 1–7. IEEE, Los Alamitos (1998)
Schmidt, B.K., Sunderam, V.S.: Empirical analysis of overheads in cluster environments. Concurrency: Practice and Experience 6, 1–32 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corana, A. (2003). Ring Algorithms on Heterogeneous Clusters with PVM: Performance Analysis and Modeling. In: Dongarra, J., Laforenza, D., Orlando, S. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2003. Lecture Notes in Computer Science, vol 2840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39924-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-39924-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20149-6
Online ISBN: 978-3-540-39924-7
eBook Packages: Springer Book Archive