Analysis of Graphs by Connectivity Considerations
Journal of the ACM (JACM)
Journal of the ACM (JACM)
NPL: highlights of a new programming language
Communications of the ACM
Procedure-oriented language statements to facilitate parallel processing
Communications of the ACM
Programming semantics for multiprogrammed computations
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Models of Pure time-sharing disciplines for resource allocation
ACM '69 Proceedings of the 1969 24th national conference
ACM '66 Proceedings of the 1966 21st national conference
A Survey of Some Theoretical Aspects of Multiprocessing
ACM Computing Surveys (CSUR)
A proposal for certain process management and intercommunication primitives
ACM SIGOPS Operating Systems Review
A survey of techniques for recognizing parallel processable streams in computer programs
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
| Hi-index | 0.00 |
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).