Abstract
dc:descriptionThe problem of programming a parallel processor is discussed. Previous methods of programming a parallel processor, analyzing a program for parallel paths, and special language features are discussed. Graph theory is used to define the three basic programming constructs: choice, sequence, repetition. The concept of mechanized programming is expanded to allow for total separation of control and computational sections of a program. A definition of a language is presented which provides for this separation. A method for developing the program graph is discussed. The control graph and data graph are developed separately. The two graphs illustrate control and data predecessor relationships used in determining parallel elements of a program.
Degree
thesis:*- Grantor dc:publisher
- North Texas State University
- Year dc:date
- 1979
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Cox, Richard D.
- Contributors dc:contributor
-
- Adams, Charles N.
- Allen, John Ed, 1937-
Subjects
dc:subject × 8Rights
dc:rights- Statement dc:rights
-
- Public
- Cox, Richard D.
- Copyright
- Copyright is held by the author, unless otherwise noted. All rights reserved.
- Language dc:language
- English
Identifiers
dc:identifier.*- Identifier
-
local-cont-no: 1002772450-Cox
call-no: 379 N81 no.5566
untcat: b1168460
oclc: 5394492
ark: ark:/67531/metadc504356