Virtual Tree Machines

Authors:
F. W. Burton;M. M. Huntbach
Affiliations:
Department of Electrical Engineering and Computer Science, University of Colorado;-
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 5
Cited 2

Tree machines and divide-and-conquer algorithms

CONPAR '81 Proceedings of the Conference on Analysing Problem Classes and Programming for Parallel Computing
Executing functional programs on a virtual tree of processors

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Dense Trivalent Graphs for Processor Interconnection

IEEE Transactions on Computers
The Indirect Binary n-Cube Microprocessor Array

IEEE Transactions on Computers
The Lens Interconnection Strategy

IEEE Transactions on Computers

Implementing a graph-colouring algorithm in Parlog

ACM SIGPLAN Notices
Agent-oriented programming: from prolog to guarded definite clauses

Agent-oriented programming: from prolog to guarded definite clauses

Quantified Score

Hi-index	14.98

Visualization

Abstract

A virtual tree machine consists of a fixed finite network of processors together with a suitable algorithm for deciding when and where to solve each subproblem.