Algebraic programming in the APS system
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Run-Time Parallelization and Scheduling of Loops
IEEE Transactions on Computers
Algebraic programs optimization
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Compiling Fortran D for MIMD distributed-memory machines
Communications of the ACM
Dynamic program parallelization
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Prototyping Fortran-90 compilers for massively parallel machines
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Parallelizing programs with APs
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |
An approach to declarative construction of parallel implementations (dynamical parallelizers) for a general class of sequential imperative programs by means of the algebraic programming system APS is considered. It gives advantages of rapid prototyping and evolutionary development of efficient parallelizers. An operational model of a dynamical parallelizer in the form of transition system is constructed and major parts of its declarative implementation are described as systems of relations. Techniques for designing efficient parallelizers are presented and exemplified.