Doctoral Dissertations
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"--Abstract, page ii.
Advisor(s)
Metzner, John R.
Committee Member(s)
Stigall, Paul D.
Sager, Thomas J.
St. Clair, Daniel C.
Crosser, Orrin K.
Department(s)
Computer Science
Degree Name
Ph. D. in Computer Science
Publisher
University of Missouri--Rolla
Publication Date
Summer 1986
Pagination
xi, 180 pages
Note about bibliography
Includes bibliographical references (pages 173-179).
Rights
© 1986 Roger Eggen, All rights reserved.
Document Type
Dissertation - Open Access
File Type
text
Language
English
Thesis Number
T 5367
Print OCLC #
16220623
Recommended Citation
Eggen, Roger E., "A semantic basis for parallel algorithm design" (1986). Doctoral Dissertations. 612.
https://scholarsmine.mst.edu/doctoral_dissertations/612