Skip to Main content Skip to Navigation
Conference papers

Eigenvalue Grid and Cluster Computations, Using Task Farming Computing Paradigm and Data Persistency

Abstract : Recent progress has made possible to construct high performance distributed computing environments, such as computational grids and cluster of clusters, which provide access to large scale heterogeneous computational resources. Exploration of novel algorithms and evaluation of performance is a strategy research for the future of computational grid and cluster scientific computing for many important applications. We adapted the well-known parallel iterative Lanczos method to compute Hermitian eigenvalues of large sparse matrices for a GRID platform and for a cluster of clusters worldwide deployed between France and Japan. Parts of the proposed GRID algorithm use an efficient task-farming computing paradigm, with data persistency scheduling strategies.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-00694501
Contributor : Ist Rennes Connect in order to contact the contributor
Submitted on : Friday, May 4, 2012 - 2:45:28 PM
Last modification on : Friday, December 10, 2021 - 2:56:29 PM

Identifiers

  • HAL Id : hal-00694501, version 1

Collections

Citation

Serge Petiton, Laurent Choy. Eigenvalue Grid and Cluster Computations, Using Task Farming Computing Paradigm and Data Persistency. SIAM conference on Computational Science & Engineering, Feb 2007, Costa Mesa, United States. ⟨hal-00694501⟩

Share

Metrics

Record views

108