Efficiency bounds for multiprocessor computing systems

A digital computer algorithm is given for analysis of computing processes from the viewpoint of parallelism possibilities and run efficiency on a multiprocessor computer system. The number of processor units and main store may be both infinite and restricted. The efficiency of parallel run versus the amount of processor units and the busyness of processors during the computing processes run is analysed. Estimations of the limit of the parallelism efficiency statistisc are used to find the number of processor units sufficient for the efficient performance of a multiprocessor computer system.