article · 1994

Dynamic Distributed Data in a Parallel Programming Environment DDD - Reference Manual Rev. 1.0

Klaus Birken

Cited by 0Abstract and details only

Abstract

The parallel implementation of algorithms based on dynamic data structures on architectures with distributed memory access leads to various technical problems as for data redundancy, consistency and load balancing. The DDD library allows easier development of those dynamic parallel algorithms. This document contains the complete specification of the DDD library interface, including a detailed reference manual, the memory manager specification and a list of DDD errors. Chapter 1 Introduction DDD (short for dynamic distributed data) is a library for implementing parallel programs based on algorithms which use dynamic data structures on MIMD computers. It is based on a corresponding formal model of distributed data structures, which assists the application programmer in designing the distributed structure as well as in developing a correct data parallelization method (cf. [3]). Most of the technical problems of parallel implementations on distributed memory machines (cf. [5]) can be ...

Cite this paper

APA 7

Birken, K. (1994). Dynamic Distributed Data in a Parallel Programming Environment DDD - Reference Manual Rev. 1.0.

MLA 9

Birken, Klaus. “Dynamic Distributed Data in a Parallel Programming Environment DDD - Reference Manual Rev. 1.0.” 1994.

Chicago

Birken, Klaus. 1994. “Dynamic Distributed Data in a Parallel Programming Environment DDD - Reference Manual Rev. 1.0.”

Harvard

Birken, K. (1994) ‘Dynamic Distributed Data in a Parallel Programming Environment DDD - Reference Manual Rev. 1.0’.

BibTeX

@article{birken1994dynamic,
  title = {{Dynamic Distributed Data in a Parallel Programming Environment DDD - Reference Manual Rev. 1.0}},
  author = {Birken, Klaus},
  year = {1994}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.