Parallel programming with recurrent equations

Journal Article · Thu Jan 01 04:00:00 EST 1987 · Int. J. Supercomput. Appl.; (United States)

DOI:https://doi.org/10.1177/109434208700100205· OSTI ID:6078304

Szymanski, B K; Mueller-Wichards, D

In the assertive programming paradigm, computations are specified as sets of assertions about properties of the solution, and not as a sequence of procedural steps. Procedures are automatically generated from the assertive description. Assertive programming for scientific parallel processing is supported by equational languages in which assertions are expressed as algebraic equations. Such languages are naturally suited to mathematical modeling. They also prove effective for describing general computational tasks. Programs written in equational languages are concise, free from implementation details, and amenable to verification and parallel processing. This paper advocates the use of equational languages for programming large-scale computations on parallel machines. The example of the MODEL equational language demonstrates that powerful parallel software development tools can be built in an equational programming environment. The example specification of an econometric model of the six countries in the Pacific Basin illustrates a coordinated use of these tools in program development.

• Research Organization: Rensselaer Polytechnic Institute, Troy, NY 12180
• OSTI ID: 6078304
• Journal Information: Int. J. Supercomput. Appl.; (United States), Journal Name: Int. J. Supercomput. Appl.; (United States) Vol. 1:2; ISSN IJSAE
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
990230 -- Mathematics & Mathematical Models-- (1987-1989)
ASIA
COMPUTER CODES
COMPUTERS
DIGITAL COMPUTERS
ECONOMETRICS
ECONOMICS
EQUATIONS
MATHEMATICAL MODELS
PARALLEL PROCESSING
PROGRAMMING
PROGRAMMING LANGUAGES
SUPERCOMPUTERS