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
Proceedings ArticleDOI

Implementation methodology for emerging reconfigurable systems

TL;DR: This work presents a workflow methodology for accelerating a production-level biomolecular simulation framework called LAMMPS in ImpulseC, and explores the design space and characterize the performance of the implementation on the XD1000 platform.
Proceedings ArticleDOI

Hardware-software partitioning of soft multi-core cyber-physical systems

TL;DR: A soft multi-core architecture in the fabric forming a loosely coupled network with a queue-based messaging framework for inter-core communication that provides parallel improvements (as per Amdahl's Law) and a familiar Harvard abstraction is proposed.

An Oracle for Tolerating and Detecting Asymmetric Races

TL;DR: ToleRace is introduced, an oracle that allows programs to either tolerate or detect asymmetric races based on local replication of shared state, and provides an approximation of atomicity in critical sections by creating local copies of shared variables when a critical section is entered and propagating the appropriate copy when the critical sections is exited.
Journal ArticleDOI

A survey of scheduling methods for multiprocessor systems

TL;DR: The survey paper is devoted to the present state of scheduling methods for multiprocess or systems and a number of precise and heuristic methods, anomalies in the heuristic Methods, and results of computational experiments are considered.
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)