Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
HARNESS and fault tolerant MPI
Parallel Computing - Clusters and computational grids for scientific computing
Guest editorial: the earth simulator
Parallel Computing
Fast simulations of stochastic dynamical systems
Journal of Computational Physics
SIAM Journal on Scientific Computing
Probabilistically induced domain decomposition methods for elliptic boundary-value problems
Journal of Computational Physics
Super-Scalable algorithms for computing on 100,000 processors
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Domain decomposition solution of nonlinear two-dimensional parabolic problems by random trees
Journal of Computational Physics
Journal of Scientific Computing
A new domain decomposition approach suited for grid computing
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Scalability and performance analysis of a probabilistic domain decomposition method
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Hi-index | 0.00 |
Present and future supercomputers offer many opportunities and advantages to attack complex and demanding industrial and applied mathematical problems, but provide also new challenges. In the Peta-Flops regime, these concern both, the way to exploit the increasingly available power and the need of designing algorithms which are scalable and fault-tolerant at the same time. An example of a probabilistic domain decomposition method, which is indeed scalable and naturally fault-tolerant, is presented. Grid computing should also be mentioned as an increasingly popular way to perform massively distributed computing: it represents a way to exploit computing power, aside the existing supercomputers. Beyond classical supercomputers there is the prospective quantum computer, in view of which it is advisable to start now a search for suitable algorithms for certain classes of problems.