Structured programming in symbolic multiprocessing
This article applies Glushkov's systems of algorithmic algebras (SAA) to symbolic multiprocessing. Regular schemata on abstract memory types are used to formalize the main control techniques for parallel computations in slipway and pipeline multiprocessing. The expressive power of the proposed SAA apparatus is demonstrated for the reader-writer problem, the dynamic communication problem, the firing line problem, and parallel parsing. Structured design grammars combining the SAA apparatus with formal language models are applied for direct and inverse transformation from synchronous to asynchronous regular schemata and back. It is determined that program design based on structured design grammars preserves all the advantages of structured programming and enables partial program verification using top-down, bottom-up, and mixed parsers, the optimization of programs by prespecified criteria using the apparatus of identity transformations developed within the framework of SAA theory, and the joint multilevel (top-down, bottom-up, and mixed) design of structured algorithms and programs.
- OSTI ID:
- 5365578
- Journal Information:
- Cybernetics (Engl. Transl.); (United States), Vol. 19:5; Other Information: Translated from Kibernetika, No. 5, pp. 22-30, September-October, 1983
- Country of Publication:
- United States
- Language:
- English
Similar Records
Problem of identity transformations of nondeterministic program schemes in algorithmic algebra systems
Left-corner unification-based natural language processing