Files

Download

Download Full Text (117 KB)

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.

Peer Reviewed

1

Copyright

Springer/SIAM

Development and Utilization of Parallel Generic Algorithms for Scientific  Computations

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.