Abstract

We propose a new paradigm for programming tightly coupled multicomputer systems, 2DT. 2DT-programs are composed of local computations on linear data (columns) and global transformations on 2-dimensional combinations of the columns (2D-arrays). Local computations can be expressed in a functional or imperative base language; a typed variant of Backus' FP, 2DT-FP, is chosen in this paper.An interleaving semantics for 2DT-FP is given, exposing the potential for parallel execution of 2DT-FP programs. The claim is proved that any sequential and thus any parallel execution will deliver the same result.Keywordsparallel languageoperational semantics

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call