Runtime Adaptation of an Iterative Linear System Solution to Distributed Environments
Distributed cluster environments are becoming popular platforms for high performance computing in lieu of single-vendor supercomputers. However, the reliability and sustainable performance of a cluster are difficult to ensure since the amount of available distributed resources may vary during the application execution. To increase robustness, an application needs to have self-adaptive features that are invoked at the runtime. For a class of computationally-intensive distributed scientific applications, iterative linear system solutions, we show a benefit of the adaptations that change the amount of local computations based on the runtime performance information. A few strategies for efficient exchange of such information are discussed and tested on two cluster architectures.
KeywordsLocal Equation Sparse Linear System Processor Number Runtime Adaptation Power3 Cluster
Unable to display preview. Download preview PDF.
- 1.MPI Forum. MPI: A message-passing standard. Intl. J. Supercomut. Applic., 8, 1994.Google Scholar
- 2.T. Davis. University of orida sparse matrix collection. NA Digest, 1997. http://www.cise.ufl.edu/~davis/sparse..
- 4.Y. Saad and A. Malevsky. PSPARSLIB: A portable library of distributed memory sparse iterative solvers. In V. E. Malyshkin et al., editor, Proceedings of Parallel Computing Technologies (PaCT-95), 3-rd international conference, St. Petersburg, Russia, Sept. 1995, 1995.Google Scholar
- 5.Y. Saad and M. Sosonkina. Non-standard parallel solution strategies for distributed sparse linear systems. In A. Uhl P. Zinterhof, M. Vajtersic, editor, Parallel Computation: Proc. of ACPC’99, Lecture Notes in Computer Science, pages 13–27, Berlin, 1999. Springer-Verlag.Google Scholar