scispace - formally typeset
Journal ArticleDOI

Automatic Assignment of Computations in a Variable Structure Computer System

Reads0
Chats0
TLDR
A numerical experiment on a problem from the area of the x-ray diffraction analysis of crystal structures indicates that the assignment procedure is computationally practical, and 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.
Abstract
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.

read more

Citations
More filters
Journal ArticleDOI

BE VISION, A Package of IBM 7090 FORTRAN Programs to Draw Orthographic Views of Combinations of Plane and Quadric Surfaces

TL;DR: The various subroutines of the package and their functions are described in this paper and numerous examples of pictures that were produced by BE VISION are given.
Journal ArticleDOI

A Multicomputer System with Dynamic Architecture

TL;DR: Basic principles of dynamic computer group implementation are considered: organization of parallel (for words) and serial (for instructions) exchange between primary memory and processor, automatic variation of the time intervals assigned for operations which are executed in differently sized computers, formation of the processor with variable word size.

On the Performance Potential of Different Types of Speculative Thread-Level Parallelism

TL;DR: This study shows that, at the loop-level, the upper bound on the arithmetic mean and geometric mean speedup achievable via TLS across SPEC CPU2000 is 39.16% (standard deviation = 31.23) and 18.18% respectively.
Journal ArticleDOI

Experiments on Models of Computations and Systems

TL;DR: Effectiveness of parallel processing, convergence properties of the successive approximation assignment and sequencing procedure, sensitivity to input parameter variation, the cost in computer time of the graph analysis, and comparison with more conventional SIMSCRIPT simulation are presented.

Synthesis of Dataflow Graphs for Reconfigurable Systems using Temporal Partitioning and Temporal Placement

TL;DR: This thesis deals with the development of various algorithms to solve the temporal partitioning and the temporal placement problems of the reconfigurable system synthesis.
References
More filters
Journal ArticleDOI

Algorithms for Solving Production-Scheduling Problems

TL;DR: It is shown that it is practical, in problems of small size, to generate the complete set of all active schedules and to pick the optimal schedules directly from this set and, when this is not practical, to random sample from the bet of allactive schedules.
Proceedings ArticleDOI

Organization of computer systems: the fixed plus variable structure computer

TL;DR: The past decade has seen the development of productive fast electronic digital computers, but a growing number of important problems have been recorded which are not practicably computable by existing systems.
Proceedings ArticleDOI

Applications of Boolean matrices to the analysis of flow diagrams

TL;DR: Questions concerning order of operations, location and disposition of transfers, identification of subroutines, internal consistency, redundancy and equivalence, all involve a knowledge of the structure of the program under study and must be handled effectively by any automatic programming system.
Journal ArticleDOI

Multiprogram scheduling: parts 1 and 2. introduction and theory

TL;DR: A concise scheduling algorithm is described which tends to minimize the time for executing the entire pending workload (or any subset of it), subject to external constraints such as precedence, urgency, etc.
Journal ArticleDOI

A note on the application of graph theory to digital computer programming

TL;DR: It is shown that properties of directed graphs and the associated connection matrices can be used to detect errors and eliminate redundancies in programs.
Related Papers (5)