Fault Oblivious Eigenvalue Solver
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908659510935552 |
|---|---|
| author | Mukherjee, Jayanta Kang, Xuejiao Gleich, David F. Sameh, Ahmed Grama, Ananth |
| author_facet | Mukherjee, Jayanta Kang, Xuejiao Gleich, David F. Sameh, Ahmed Grama, Ananth |
| contents | Eigenvalue problems serve as fundamental substrates for applications in large-scale scientific simulations and machine learning, often requiring computation on massively parallel platforms. As these platforms scale to hundreds of thousands of cores, hardware failures become a significant challenge to reliability and efficiency. In this paper, we propose and analyze a novel fault-tolerant eigenvalue solver based on erasure-coded computations -- a technique that enhances resilience by augmenting the system with redundant data a priori. This transformation reformulates the original eigenvalue problem as a generalized eigenvalue problem, enabling fault-oblivious computation while preserving numerical stability and convergence properties. We formulate the augmentation scheme, establish the necessary conditions for the encoded blocks, and prove the relationship between the original and transformed problems. We implement an erasure-coded TraceMin eigensolver and demonstrate its effectiveness in extracting eigenvalues in the presence of faults. Our experimental results show that the proposed solver incurs minimal computational overhead, maintains robust convergence, and scales efficiently with the number of faults, making it a practical solution for resilient eigenvalue computations in large-scale systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_13396 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fault Oblivious Eigenvalue Solver Mukherjee, Jayanta Kang, Xuejiao Gleich, David F. Sameh, Ahmed Grama, Ananth Numerical Analysis Eigenvalue problems serve as fundamental substrates for applications in large-scale scientific simulations and machine learning, often requiring computation on massively parallel platforms. As these platforms scale to hundreds of thousands of cores, hardware failures become a significant challenge to reliability and efficiency. In this paper, we propose and analyze a novel fault-tolerant eigenvalue solver based on erasure-coded computations -- a technique that enhances resilience by augmenting the system with redundant data a priori. This transformation reformulates the original eigenvalue problem as a generalized eigenvalue problem, enabling fault-oblivious computation while preserving numerical stability and convergence properties. We formulate the augmentation scheme, establish the necessary conditions for the encoded blocks, and prove the relationship between the original and transformed problems. We implement an erasure-coded TraceMin eigensolver and demonstrate its effectiveness in extracting eigenvalues in the presence of faults. Our experimental results show that the proposed solver incurs minimal computational overhead, maintains robust convergence, and scales efficiently with the number of faults, making it a practical solution for resilient eigenvalue computations in large-scale systems. |
| title | Fault Oblivious Eigenvalue Solver |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2511.13396 |