A sparse matrix algorithm on the Boolean vector machine |
| |
Authors: | Robert A. Wagner Merrell L. Patrick |
| |
Affiliation: | Department of Computer Science, Duke University, Durham, NC 27706, U.S.A. |
| |
Abstract: | The Boolean Vector Machine (BVM) is a large network of extremely small processors with very small memories operating in SIMD mode using bit serial arithmetic. Individual processors communicate via a hardware implementation of the Cube Connected Cycles (CCC) network. A prototype BVM with 2048 processing elements, each with 200 binary bits of memory, is currently being built using VLSI technology. The BVM's bit-serial arithmetic and the small memories of individual processors are apparently a drawback to its effectiveness when applied to large numerical problems. In this paper we analyze an implementation of a basic matrix-vector iteration algorithm for sparse matrices on the BVM. We show that a 220 Pe BVM can deliver over 1 billion (109) useful floating-point operations per second for this problem. The algorithm is expressed in a new language (BVL) which has been defined for programming the BVM. |
| |
Keywords: | Linear algebra sparse matrix algorithm Boolean vector machine Boolean vector language performance estimates |
本文献已被 ScienceDirect 等数据库收录! |