Development and Utilization of Parallel Generic Algorithms for Scientific Computations

Authors

Atanas Radenski, Chapman UniversityFollow
Andrew Vann
Boyana Norris

Files

Description

We develop generic parallel algorithms as extensible modules that encapsulate related classes and parallel methods. Extensible modules define common parallel structures, such as meshes, pipelines, or master-server networks in problem-independent manner. Such modules can be extended with sequential domain-specific code in order to derive particular parallel applications. In this paper, we first outline the essence of extensible modules. Then, we focus on a case study of the cellular automaton, a message-parallel generic algorithm from which we derive diverse parallel scientific applications.

ISBN

978-3-540-65460-5

Publication Date

1998

Publisher

Springer

City

Berlin

Keywords

generic parallel algorithms, extensible modules

Disciplines

Computer Sciences | Theory and Algorithms

Comments

The final publication is available at Springer via http://dx.doi.org/10.1007/3-540-49255-0_151.

A later copy of this paper, as published by SIAM, is available here.

Recommended Citation

Radenski, A., A. Vann, B. Norris. Development and Utilization of Parallel Generic Algorithms for Scientific Computations (preliminary report). In S. Demeyer, J. Bosch (Eds), Object-Oriented Technology: ECOOP'98 Workshop Reader, Springer, 1998, 464-465. doi: 10.1007/3-540-49255-0_151

Later published as:

Radenski, A., A. Vann, B. Norris. Development and Utilization of Generic Algorithms for Scientific Cluster Computations. In Henderson M., C. Anderson, and S. Lyons (Eds), Object Oriented Methods for Interoperable Scientific and Engineering Computing, SIAM, 1999, 97-105.

Peer Reviewed

1

Copyright

Springer/SIAM