Abstract
As computing demands increase, emphasis is being placed on parallel architectures- To efficiently use parallel machines, software must be designed to take advantage of these machines. This research concentrates on an abstraction of algorithm design to permit the expression of parallel programs. The abstraction emphasizes thought about algorithms at a high level as opposed to algorithm implementation at a statement level. A model based on data flow allows algorithm expression using flow diagrams. The model specifies operating system requirements that support parallel programming at a module level. Paths are used to carry data between modules. Data enter modules through ports. Module activation is triggered by the satisfaction of data availability conditions. Continual module presence within the system, dynamic activation criteria, and a high level of programming distinguishes this model from other parallel programming systems.
Recommended Citation
Eggen, Roger E. and Metzner, John R., "A Semantic Basis for Parallel Algorithm Design" (1986). Computer Science Technical Reports. 74.
https://scholarsmine.mst.edu/comsci_techreports/74
Department(s)
Computer Science
Report Number
CSc-86-1
Document Type
Technical Report
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1986 University of Missouri--Rolla, All rights reserved.
Publication Date
May 1986
Comments
This report is substantially the Ph.D. dissertation of the first author, completed May, 1986.