Recognition and representation of parallel processable streams in computer programs-II (Task/process Parallelism)
C. V. Ramamoorthy, M. J. Gonzalez · 1969
Advances in the areas of hardware technology, processor organization and programming science have given fresh impetus to research in parallel processing within single job streams. Given a program with a large degree of inherent parallelism, the theoretical time required for problem solution can be reduced “by a factor at least as great as the number of processors” [1].A need exists for new techniques for detecting parallel processable segments in sequentially coded programs and for indicating (representing) parallelism during actual program writing and coding. In a companion paper [4], the authors considered some methods of detecting and representing parallel processable “subtasks” within a task (process). In this paper we shall study the techniques of recognizing and representing parallel processable tasks within a single job stream (program).