Concurrent Compiling. Volume I. Representation of Algorithms as Cyclic Partial Orderings.
Final technical rept.,
APPLIED DATA RESEARCH INC WAKEFIELD MASS
Pagination or Media Count:
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 IO 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. ShapiroSaint nets are discussed with respect to additional semantic interpretations which could be assumed, and various properties which have been observed. Author
- Computer Programming and Software
- Computer Hardware