Virtual Tree Machines

1 March 1984

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-33 (3) , 278-280
https://doi.org/10.1109/tc.1984.1676425

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.

Keywords

FIXED FINITE NETWORK
VIRTUAL TREE MACHINES
VIRTUAL TREE MACHINE
SUITABLE ALGORITHM
BINARY TREES
DISTRIBUTED COMPUTING
COMPUTATIONAL MODELING
PROCESS MANAGEMENT
COMPUTER NETWORKS
NP COMPLETE PROBLEM
LENSES
SHAPE
NETWORK TOPOLOGY
SIMULATION

This publication has 5 references indexed in Scilit:

IN-SITU MACHINING AND REPAIR OF CAMERON FC STYLE XMAS TREES
Published by Society of Petroleum Engineers (SPE) ,1989
Dense Trivalent Graphs for Processor Interconnection
IEEE Transactions on Computers, 1982
The Lens Interconnection Strategy
IEEE Transactions on Computers, 1981
Executing functional programs on a virtual tree of processors
Published by Association for Computing Machinery (ACM) ,1981
The Indirect Binary n-Cube Microprocessor Array
IEEE Transactions on Computers, 1977