The Boolean Vector Machine [BVM]

Authors:
Robert A. Wagner
Affiliations:
-
Venue:
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Year:
1983

Citing 11
Cited 2

The C programming language

The C programming language
Some Complexity Results for Matrix Computations on Parallel Processors

Journal of the ACM (JACM)
Ultracomputers

ACM Transactions on Programming Languages and Systems (TOPLAS)
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
On computing the fast Fourier transform

Communications of the ACM
Introduction to VLSI Systems

Introduction to VLSI Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Structure of Computers and Computations

Structure of Computers and Computations
A characterization of the power of vector machines

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A simple, efficient design automation processor

DAC '74 Proceedings of the 11th Design Automation Workshop
A programming language

A programming language

Compiling APL for parallel execution on an FFP machine

APL '85 Proceedings of the international conference on APL: APL and the future
Combining speed with alpha-particle induced memory, error tolerance in a large boolean vector machine

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe the architecture of a class of machines intended to solve computationally intensive problems much faster than can today's machines, at no increase in cost. We have investigated the programming of the BVM for several interesting algorithms on a BVM of 2k bit positions per register. More theoretical study of implementations of such highly parallel algorithms is motivated.