scientific article; zbMATH DE number 193789
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.
- Programming models for parallel computing
- scientific article; zbMATH DE number 46180
- Parallel programming: Models, methods and programming languages
- Models for parallel computations
- Structural synthesis of parallel programs (methodology and tools)
- scientific article; zbMATH DE number 45696
- Computational models for parallel computers
- scientific article; zbMATH DE number 3779257
- Boolean models and planning methods for parallel abstract programs
- P-functions and Boolean matrix factorization. A unified approach for wired, programmed and microprogrammed implementations of discrete algorithms
- scientific article; zbMATH DE number 3949698 (Why is no real title available?)
- scientific article; zbMATH DE number 4035102 (Why is no real title available?)
- scientific article; zbMATH DE number 4052988 (Why is no real title available?)
- scientific article; zbMATH DE number 465526 (Why is no real title available?)
- scientific article; zbMATH DE number 4003499 (Why is no real title available?)
- High performance implementation of a relativistic flows simulation application using active knowledge concept
- Higher order dataflow schemas
- Synthesis of parallel recursive programs in structural functional models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040585)