Accession Number : AD0742278
Title : Concurrent Compiling. Volume I. Representation of Algorithms as Cyclic Partial Orderings.
Descriptive Note : Final technical rept.,
Corporate Author : APPLIED DATA RESEARCH INC WAKEFIELD MASS
Personal Author(s) : Shapiro,Robert M. ; Saint,Harry ; Presberg,David L.
Report Date : MAR 1972
Pagination or Media Count : 222
Abstract : Issues are discussed relating to the translation of conventional sequentially defined algorithms into cyclic partial orderings. Procedures are elaborated for determining a minimal ordering on decision effects in an algorithm. Procedures and schemata are presented for representing I/O operations. Algorithm segmentation procedures are defined, rules are given for individually translating algorithm segments into cyclic partial orderings, and procedures are given for linking cyclic partial orderings of continuous segments. A comparative study is made of Jorge E. Rodriguez' approach to the representation of algorithms as highly concurrent processes. Shapiro/Saint nets are discussed with respect to additional semantic interpretations which could be assumed, and various properties which have been observed. (Author)
Descriptors : (*COMPUTER PROGRAMMING, ALGORITHMS), MATHEMATICAL LOGIC, DECISION MAKING, COMPILERS, GRAPHICS, INPUT OUTPUT DEVICES, DATA PROCESSING, MULTIPLE OPERATION
Subject Categories : Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE