Concurrent Compiling. Volume I. Representation of Algorithms as Cyclic Partial Orderings.
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1972
- Accession Number
- AD0742278
Entities
People
- David L. Presberg
- Harry Saint
- Robert M. Shapiro