Advanced scalable algorithms for advanced architectures

Authors:
Vassil Alexandrov
Affiliations:
-
Venue:
CompSysTech '09 Proceedings of the International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing
Year:
2009

Citing 5
Cited 0

A new iterative Monte Carlo approach for inverse matrix problem

Journal of Computational and Applied Mathematics
Monte Carlo methods for matrix computations on the grid

Future Generation Computer Systems
A sparse parallel hybrid monte carlo algorithm for matrix computations

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Error analysis of a monte carlo algorithm for computing bilinear forms of matrix powers

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Comparison of the computational cost of a monte carlo and deterministic algorithm for computing bilinear forms of matrix powers

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the latest advances in the area of advanced computer architectures we are seeing already large scale machines at petascale level and we are discussing exascale computing. All these require efficient scalable algorithms in order to bridge the performance gap. In this paper examples of various approaches of designing scalable algorithms for such advanced architectures will be given and the corresponding properties of these algorithms will be outlined and discussed. Examples will outline such scalable algorithms applied to large scale problems in the area Computational Biology, Environmental Modelling etc. The key properties of such advanced and scalable algorithms will be outlined.