ABOUT THE SOLUTION OF PROBLEMS ON UNIVERSAL CALCULATING SYSTEMS (O RESHENII ZADACH NA UNIVERSALNYKH VYCHISLITELNYKH SISTEMAKH),
Abstract
The feasibility of the efficient solution of problems on universal computer systems with a large number of machines has been investigated. For that purpose the paper presents 16 types of problems covering the basic fields of mathematics. The problems were solved with the help of the best-known methods for their solution. The paper gives the estimate of the number of cycles needed for the solution of each of the particular problems and the necessary memory volume. For each type of problem, the logical scheme of the algorithm is also found, described by means of the P-language. Simultaneously, for each of the problems one searches for such a number k > 1 of machines entering into the universal computer system that the problem is solved on such a system k times faster than on a single machine. It is assumed that each machine entering into the universal computer system has a set of operations determined by the totality of problems which are being solved.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 12, 1968
- Accession Number
- AD0674310
Entities
People
- E. V. Evreinov
- Yu. G. Kosarev
Organizations
- National Air and Space Intelligence Center