Dynamic Distributed Data (DDD) in a parallel programming environment -- specification and functionality, Forschungs- und Entwicklungsberichte RUS--22, Rechenzentrum der Universitat (1994) [13 citations — 5 self]
Download:
|
|
by Klaus Birken, Peter Bastian
ftp://ftp.ica3.uni-stuttgart.de/pub/text/klausb/birken94a.ps.gz
Add To MetaCart
Abstract:
The parallel implementation of algorithms based on dynamic data structures (e.g. adaptive PDE solvers, sparse matrices) on architectures with distributed memory will unavoidably lead to various technical problems as for redundancy, consistency and load balancing. The module DDD is presented, which makes the development of dynamic parallel algorithms much easier. DDD consists of a formal model for describing distributed data, a functionality specification and a portable library implementation. The main goal of DDD is to provide a general and efficient interface connecting SPMD-style applications with various architectures and programming models.
