Article

Free access

The Boolean Vector Machine [BVM]

Author:

Robert A. WagnerAuthors Info & Claims

ISCA '83: Proceedings of the 10th annual international symposium on Computer architecture

Pages 59 - 66

https://doi.org/10.1145/800046.801639

Published: 13 June 1983 Publication History

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 2^k bit positions per register. More theoretical study of implementations of such highly parallel algorithms is motivated.

References

[1]

Pratt, V.R., Rabin, M. and Stockmeyer, L.J., "A Characterization of the Power of Vector Machines," Proc. 6th ACM Symp. of Theory of Computation, May 1974, pp. 122-134. See also Stockmeyer, L.J., "Arithmetic versus Boolean Operations in Idealized Register Machines," IBM Research Report RC5954, 4/21/76, IBM T.J. Watson Research Center, Yorktown Heights, N.Y. 10598.

Digital Library

[2]

Kuck, D.J., The Structure of Computers and Computations, Vol. 1, New York: John Wiley, 1978.

Digital Library

[3]

Singleton, R.C., "On Computing the Fast Fourier Transform," CACM 10, 10 (October 1967), pp. 647-654.

Digital Library

[4]

Schwartz, J.T., "Ultracomputers," ACM Trans. on Prog. Languages and systems, Vol. 2, No. 4 (October 1980), pp. 484-521.

Digital Library

[5]

Preparata, F.P. and Vuillemin, J., "The Cube-Connected Cycles: a Versatile Network for Parallel Computation," CACM 24, 5 (May 1981), pp. 300-309.

Digital Library

[6]

Kernighan, B.W. and Ritchie, D.M., The C Programming Language, Prentice-Hall (1978).

Digital Library

[7]

Kuhn, R.H., "Optimization and Interconnection Complexity for: Parallel Processors, Single-Stage Networks, and Decision Trees," Tech. Report UIUCDCS-R-80-1009, Dept. of Computer Science, Univ. of Illinois, Urbana-Champaign, IL (February 1980).

[8]

Gentleman, W.M., "Some Complexity Results for Matrix Computations in Parallel Processors," J.ACM vol. 25 (January 1978), pp. 112-115.

Digital Library

[9]

Iverson, K.E., A Programming Language (Wiley 1962).

Digital Library

[10]

Pakin, S., APL360 Reference Manual (Science Research Associates 1972).

[11]

Flanders, P.M., Hunt, D.J., Parkinson, D. and Reddaway, S.F., "Experience Gained in Programming the Pilot DAP, A Parallel Processor with 1024 Processing Elements," in Parallel Computers - Parallel Mathematics, M. Feilmeier, Editor, Int. Assoc. for Math and Computers in Simulation, 1977.

[12]

Karp, R., "Reducibility Among Combinatorial Problems," in Complexity of Computer Computations, Miller, R.E. and Thatcher, J.W., Editors, Plenum Press, New York (1972), pp. 85-104.

[13]

Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP Completeness, W.H. Freeman and Co., San Francisco (1979).

Digital Library

[14]

Stone, H.S., "Parallel Processing with the Perfect Shuffle," IEEE Trans. on Computers, C-20,2 (February 1971), pp. 153-161.

Digital Library

[15]

Bryant, Randal E., "An Algorithm for MOS Logic Simulation," Lambda, 4th Quarter 1980, pp. 46-53.

[16]

Mead, Carver and Conway, Lynn, Introduction to VLSI systems, Addison-Wesley, 1980.

Digital Library

[17]

Druffel, L.E., Schmidt, D.C. and Wagner, R.A., "A Simple, Efficient Design Automation Processor," 11th DA Workshop Proc. (June 1974), pp. 127-135.

Digital Library

[18]

Wagner, R.A., "The Circuit Simulation Compiler," Tech. Report, Vanderbilt University, 1973.

[19]

Robinson, I.N. and Moore, W.R., "A Parallel Processor Array Architecture and its Implementation in Silicon," Proc. 9th Ann. Symp. on Computer Architecture, May 1982, pp. 41-45.

[20]

Hall. J.S., "A General-Purpose Cam-Based System," in VLSI systems and Computations, H.T. Kung, B. Sproull and G. Steele (eds.), Computer Science Press, Rockville, MD., 1981, pp. 379-388.

[21]

Leighton, F.T. and Miller, G.L., "Optimal Layouts for Small Shuffle-Exchange Graphs," Proc. of the VLSI 81 Conference, J.P. Gray (ed.), Academic Press, London, August 1981, pp. 289-299.

[22]

Rosenberg, A., "Three-Dimensional Integrated Circuitry," in VLSI Systems and Computation, op.cit., pp. 69-80.

[23]

Wagner, R. A. "Towards a Method of Programming Large SIMD Arrays of Computing Elements", Tech Report CS-1982-15 Dept. of Computer Science, Duke University, September, 1982.

Cited By

Tuck R(1989)An optimally portable SIMD programming languageProceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation10.1109/FMPC.1988.47505(617-624)Online publication date: 1989
https://doi.org/10.1109/FMPC.1988.47505
Koster A(1986)Compiling APL for parallel execution on an FFP machineProceedings of the international conference on APL: APL and the future10.1145/17701.255327(29-37)Online publication date: 1-Jun-1986
https://dl.acm.org/doi/10.1145/17701.255327
Koster A(1985)Compiling APL for parallel execution on an FFP machineACM SIGAPL APL Quote Quad10.1145/255315.25532715:4(29-37)Online publication date: 12-May-1985
https://dl.acm.org/doi/10.1145/255315.255327
Show More Cited By

Index Terms

The Boolean Vector Machine [BVM]

Recommendations

Twin support vector machine: theory, algorithm and applications

Twin support vector machine (TWSVM) has gained increasing interest from various research fields recently. In this paper, we aim to report the current state of the theoretical research and practical advances on TWSVM. We first give the basic thought and ...
Self-Universum support vector machine

In this paper, for an improved twin support vector machine (TWSVM), we give it a theoretical explanation based on the concept of Universum and then name it Self-Universum support vector machine (SUSVM). For the binary classification problem, SUSVM takes ...
An overview on nonparallel hyperplane support vector machine algorithms

Support vector machine (SVM) has attracted substantial interest in the community of machine learning. As the extension of SVM, nonparallel hyperplane SVM (NHSVM) classification algorithms have become current researching hot spots in machine learning ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ISCA '83: Proceedings of the 10th annual international symposium on Computer architecture

June 1983

424 pages

ISBN:0897911016

DOI:10.1145/800046

ACM SIGARCH Computer Architecture News Volume 11, Issue 3
June 1983
413 pages
ISSN:0163-5964
DOI:10.1145/1067651
Issue’s Table of Contents

Copyright © 1983 Author.

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IEEE-CS: Computer Society

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 1983

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 543 of 3,203 submissions, 17%

Upcoming Conference

ISCA '25

Sponsor:
sigarch

The 52nd Annual International Symposium on Computer Architecture

June 21 - 25, 2025

Tokyo , Japan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
286
Total Downloads

Downloads (Last 12 months)85
Downloads (Last 6 weeks)17

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Tuck R(1989)An optimally portable SIMD programming languageProceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation10.1109/FMPC.1988.47505(617-624)Online publication date: 1989
https://doi.org/10.1109/FMPC.1988.47505
Koster A(1986)Compiling APL for parallel execution on an FFP machineProceedings of the international conference on APL: APL and the future10.1145/17701.255327(29-37)Online publication date: 1-Jun-1986
https://dl.acm.org/doi/10.1145/17701.255327
Koster A(1985)Compiling APL for parallel execution on an FFP machineACM SIGAPL APL Quote Quad10.1145/255315.25532715:4(29-37)Online publication date: 12-May-1985
https://dl.acm.org/doi/10.1145/255315.255327
King RWagner RAgrawal D(1984)Combining speed with alpha-particle induced memory, error tolerance in a large boolean vector machineProceedings of the 11th annual international symposium on Computer architecture10.1145/800015.808192(251-253)Online publication date: 1-Jan-1984
https://dl.acm.org/doi/10.1145/800015.808192
King RWagner R(1984)Combining speed with alpha-particle induced memory, error tolerance in a large boolean vector machineACM SIGARCH Computer Architecture News10.1145/773453.80819212:3(251-253)Online publication date: 1-Jan-1984
https://dl.acm.org/doi/10.1145/773453.808192
Duval LWagner RHan YLoveland D(1987)Finding test-and-treatment procedures using parallel computationJournal of Parallel and Distributed Computing10.1016/0743-7315(87)90039-64:3(309-318)Online publication date: 1-Jun-1987
https://dl.acm.org/doi/10.1016/0743-7315%2887%2990039-6

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents