The 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.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc504356 |
| Date | 05 1900 |
| Creators | Cox, Richard D. |
| Contributors | Adams, Charles N., Allen, John Ed, 1937- |
| Publisher | North Texas State University |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | vi, 27 leaves : ill., Text |
| Rights | Public, Cox, Richard D., Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved. |
Page generated in 0.0031 seconds