Automatic Assignment of Computations in a Variable Structure Computer System

The problem of optimal assignment of subcomputations of a computational task to autonomous computing structures of a variable structure computing system is investigated. In particular, it is desired to determine which computing structures should be constructed from the hardware inventory of the variable structure computing system and which subcomputations should be executed on which computing structures, and in what sequence, so as to minimize the total cost of computation (cost of restructuring of the system and the cost of the actual execution time). A successive approximation assigmnent procedure is formulated. The procedure requires representation of the computational task by a directed graph and an estimate of the number of traversals of each computational loop, as well as the branching probabilities of each conditional branching operation. Computer programs for automatic execution of the assignment procedure have been written. A numerical experiment on a problem from the area of the x-ray diffraction analysis of crystal structures indicates that the procedure is computationally practical, and also demonstrates that execution of the problem in a variable structure system leads to a considerable gain over a system of three modern high-speed general purpose computers.

[1]  E. F. Codd,et al.  Multiprogram scheduling , 1960, Commun. ACM.

[2]  Rosalind B. Marimont Applications of Graphs and Boolean Matrices to Computer Programming , 1960 .

[3]  Gerald Estrin,et al.  Organization of computer systems: the fixed plus variable structure computer , 1960, IRE-AIEE-ACM '60 (Western).

[4]  J. Heller,et al.  Sequencing Aspects of Multiprogramming , 1961, JACM.

[5]  Shmuel Winograd,et al.  Multiple Input-Output Links in Computer Systems , 1962, IBM J. Res. Dev..

[6]  J. L. Smith,et al.  Organizing a network of computers to meet deadlines , 1957, IRE-ACM-AIEE '57 (Eastern).

[7]  Gerald Estrin,et al.  Logarithmic and Exponential Function Evaluation in a Variable Structure Digital Computer , 1962, IRE Trans. Electron. Comput..

[8]  Roger L. Boyell Analysis of Time-Sharing in Digital Computers , 1960 .

[9]  Reese T. Prosser,et al.  Applications of Boolean matrices to the analysis of flow diagrams , 1899, IRE-AIEE-ACM '59 (Eastern).

[10]  G. Estrin,et al.  A very high-speed digital number sieve , 1962 .

[11]  Richard M. Karp,et al.  A Note on the Applicaton of Graph Theory to Digital Computer Programming , 1960, Inf. Control..

[12]  Paul E. Boudreau,et al.  Analysis of a Basic Queuing Problem Arising in Computer Systems , 1961, IBM J. Res. Dev..

[13]  Gerald Estrin,et al.  Organization of a ``Fixed-Plus-Variable'' Structure Computer for Computation of Eigenvalues and Eigenvectors of Real Symmetric Matrices , 1962, JACM.

[14]  Eugene S. Schwartz,et al.  An Automatic Sequencing Procedure with Application to Parallel Programming , 1961, JACM.

[15]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .