Article: Resolution of large symmetric eigenproblems on a world-wide grid Journal: International Journal of Grid and Utility Computing (IJGUC) 2009 Vol.1 No.2 pp.71 - 85 Abstract: We propose a parallel and distributed application for the resolution of the large real symmetric eigenproblem on world-wide heterogeneous grids. It is based on the explicit restarted Lanczos algorithm which is a Krylov subspace method. We take into account the specificities of computational resources and deal with communication constraints over the internet. We propose techniques such as out-of-core and data persistence. We also show that a restarted algorithm and the combination of several paradigms of parallelism are relevant in this context. The results of the experiments stress the impact of the main numerical parameters of the Lanczos method. We also compare many platform configurations built on the top of two complementary experimental environments. We first use a realistic world-wide grid harnessing two geographical sites, in France and in Japan, interconnected by the internet. Then, we use the French national testbed Grid5000. We conclude on the scalability of our application and we forecast the next bounding factor of the implementation. It can be solved by means of a dedicated data management layer such as Omni Storage. Inderscience Publishers - linking academia, business and industry through research

Title: Resolution of large symmetric eigenproblems on a world-wide grid

Authors: Laurent Choy, Serge G. Petiton, Mitsuhisa Sato

Addresses: Center for Computational Sciences, University of Tsukuba, Japan. ' Fundamental Computer Science Laboratory of Lille and French National Institute for Research in Computer Science and Control, University of Sciences and Technologies of Lille, France. ' Center for Computational Sciences, University of Tsukuba, Japan

Abstract: We propose a parallel and distributed application for the resolution of the large real symmetric eigenproblem on world-wide heterogeneous grids. It is based on the explicit restarted Lanczos algorithm which is a Krylov subspace method. We take into account the specificities of computational resources and deal with communication constraints over the internet. We propose techniques such as out-of-core and data persistence. We also show that a restarted algorithm and the combination of several paradigms of parallelism are relevant in this context. The results of the experiments stress the impact of the main numerical parameters of the Lanczos method. We also compare many platform configurations built on the top of two complementary experimental environments. We first use a realistic world-wide grid harnessing two geographical sites, in France and in Japan, interconnected by the internet. Then, we use the French national testbed Grid5000. We conclude on the scalability of our application and we forecast the next bounding factor of the implementation. It can be solved by means of a dedicated data management layer such as Omni Storage.

Keywords: global computing; Grid5000; OmniRPC; eigenproblem; Lanczos; bisection; world-wide grids; grid computing; out-of-core; data persistence; parallelism; dedicated data management.

DOI: 10.1504/IJGUC.2009.022024

International Journal of Grid and Utility Computing, 2009 Vol.1 No.2, pp.71 - 85

Published online: 16 Dec 2008 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Resolution of large symmetric eigenproblems on a world-wide grid

Keep up-to-date