No label defined (Q4040585)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 193789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 193789 |
Statements
5 June 1993
0 references
synthesis of parallel programs
0 references
0.8901247
0 references
0.8791844
0 references
0 references
0.87628454
0 references
0 references
The problem of parallel programs/systems synthesis is examined along the following guidelines: a computing model and two sets of (input and output) variables are defined. The goal is to find a program which for any values of input variables computes the desired values of output variables. Given a family S of input specifications, a family P of resulting programs, an equivalence relation \(\sim\) on P and a partial order relation \(>\) on P (called the quality of a program), the task is to find an algorithm A: \(S\to P\) such that the output of a synthesis - a program A(s) - satisfies a specification s and is the maximal one (according to \(>)\) in the family of programs \(\{\) \(p| p\sim A(s)\}.\) A computing model, called Simple Computing Model (SCM) is defined in the first chapter. Given a SMC and sets of input and output variables the computation (called plan) is represented by a set of terms. Several results on finite/optimal plans are presented. Algorithms for the synthesis of parallel programs on SCM are discussed in chapter two. The notion of structured operations is defined and some transformations of this operation (refinement, substitution, decomposition,...) are examined. A generalized model, Computing Model with Arrays (CMA), is defined in chapter three and ways how to find out plan(s) of computation are examined. The language OPAL of input specifications is introduced. Some remarks on CM with queues close this topic. The last chapter presents some modifications and illustrate them on a systolic system design and a discrete system simulation. Some discussions on parallel programming languages close the book.
0 references