The effects of program segmentation on job completion times in a multiprocessor computing system
Richard K. Dumas · NCSU Libraries Repository (North Carolina State University Libraries) · 1968
This paper is the result of a study to determine the relationship between job completion times in a multiprocessor system and the manner in which the component programs of the jobs are segmented.The nature of jobs consists of a set of functionally related programs some of which could or must be executed in parallel. Thus the work for the multiprocessor system is described in the form of a network of programs. A typical network may appear as in Figure 1. The nodes in Figure 1 act as “and” nodes for this study. For example, program E cannot be executed until programs B and C have been completed. Several networks may be in various stages of execution at any given time. In particular the study was concerned with minimizing the completion time of the highest priority network.