Robert W. Nowlin
ABSTRACT
In the modern world of control and estimation theory, matrix multiplications are ubiquitous. Minicomputers designed as general purpose machines do not have instruction sets designed to efficiently implement these multiplications. A microprogrammable machine may be capable of efficient matrix multiplications if it has the proper architecture. A Hewlett-Packard HP-2100 minicomputer was used to investigate architectural and efficiency problems. Algorithms were developed to calculate execution times for any n, m, and T where n and m refer to the matrix dimensions and T is the basic machine instruction time. The execution times for various size matrix operations indicated savings of up to 80% for microcoded operations.
- 1.Agrawala, A. K., and Rauscher, T. G. "Microprogramming: Perspective and Status," IEEE Trans. Comp., Vol. C-23, No. 8, August 1974, pp. 817-837.Google Scholar
- 2.Hewlett-Packard. 2100 Computer Microprogramming Guide, Hewlett-Packard Company, Cupertino, California, February 1972.Google Scholar
- 3.Hewlett-Packard. 2100 Computer Microprogramming Software, Hewlett-Packard Company, Cupertino, California, September 1973.Google Scholar
- 4.Hewlett-Packard. 2100A Computer Reference Manual, Hewlett-Packard Company, Cupertino, California, December 1971.Google Scholar
- 5.Jones, Louise H. "A Survey of Current Work in Microprogramming," Computer, Vol. 8, No. 8, August 1975, pp. 33-38.Google ScholarDigital Library
- 6.Stewart, G. W. Introduction To Matrix Computations, Academic Press, New York, New York, 1973.Google Scholar
Index Terms
- A microprogrammed machine architecture for efficient matrix multiplication
Recommendations
Codevelopment of multi-level instruction set architecture and hardware for an efficient matrix processor
The instruction set architecture (ISA) is the part of the processor that is visible to the programmer or compiler writer. Multi-level ISA is proposed to explicitly communicate data parallelism to hardware (processor) in a compact way instead of the ...
Generalized matrix inversion is not harder than matrix multiplication
Starting from the Strassen method for rapid matrix multiplication and inversion as well as from the recursive Cholesky factorization algorithm, we introduced a completely block recursive algorithm for generalized Cholesky factorization of a given ...
Sparse Matrix Multiplication On An Associative Processor
Sparse matrix multiplication is an important component of linear algebra computations. Implementing sparse matrix multiplication on an associative processor (AP) enables high level of parallelism, where a row of one matrix is multiplied in parallel with ...
Comments