Structured programming in symbolic multiprocessing

From MaRDI portal
Publication:3683523





This paper deals with further advancement of formalism oriented towards the description of structure of programs at each level of their design as well as the multilevel transition process itself: descending ascending or combinative. The formalism under development relies on the apparatus of grammars of structured design (GSD) where the modified systems of algorithmic algebras (SAA), oriented towards the formalization of parallel computations are combined with the output control mechanisms adopted in the theory of formal grammars. Classes of parallel algorithms and programs of symbol processing (sorting, syntactic analysis, translation, etc.) are generated by means of GSD. A concept of abstract type of memory (ATM) is introduced in connection with the refinement of the cluster concept and the well-known methods of multiprocessing formalization (pipeline, roundrobin, pile processing and their combinations) are formalized in terms of the parallel regular schemes over ATM. The suggested apparatus is approbated through its application to the classical problems of symbolic multiprocessing: writers-readers, dynamic exchange, arrow problem, clinch detection, etc. Among the unpublished results are the construction of the algorithmic algebra of data structures on the basis of modified SAAs; the formalization of the concept of abstract data type widely used in contemporary programming languages; the development of the apparatus of formal transformation, in particular, the optimization of classes of algorithm and programs generated by GSD with respect to chosen criteria.











This page was built for publication: Structured programming in symbolic multiprocessing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683523)