Blocked matrix multiplication for computers with hierarchical me

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 15347

Patent

active

050994476

ABSTRACT:
A matrix multiplication method that is particularly well suited for use with a computer having hierarchical memory. The A and B term matrices are broken down into blocks and a sum of a series of outer products is computed in order to generate product matrix blocks. Reads to cache or other faster, high-level storage and writes to main memory are interleaved with the calculations in order to reduce or elimiante processor stalling. Individual blocks may be computed by separate processors without requiring communication of intermediate results.

REFERENCES:
patent: 3617720 (1971-11-01), Gentleman
patent: 4594682 (1986-06-01), Drimak
patent: 4697247 (1987-09-01), Grinberg
patent: 4719588 (1988-01-01), Tatemichi et al.
patent: 4841469 (1989-06-01), Kuenemund et al.
patent: 4914615 (1990-04-01), Karmarkar et al.
Dangarra, Gustavson and Karp; Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine; SIAM Review vol. 26, No. 1 pp. 91-112, Jan. 1984.
Bailey; Extra High Speed Matrix Multiplication on the Cray-2; pp.: 603-607, SIAM J. Sci. Stat,. Comput. vol. 9, No. 3 May 1988.
Jalby, Meier; Optimizing Matrix Operations on a Parallel Muliprocessor with a Hierarchical Memory System: pp.: 429-432, Proceedings 1986 Intl. Conf. on Parallel Processing Aug. 1986.
Gallivan, Jalby, Meier and Sameh; Impact of Hierarchical Memory Systems on Linear Algebra Algorithm Design; pp.: 12-48, The Intl. J. of Supercomputer Applications vol. 2, No. 1, 1988.
Gallivan, Jalby, Meier; The Use of BLAS3 in Linear Algebra on a Parallel Processor with a Hierarchical Memory; pp.: 1079-1084 SIAM J. Sci. Stat. Comput. vol. 8, No. 6, Nov. 1987.
Dongarra and Sorensan; Linear Algebra on High Perforance Computers; pp.: 57-88, Applied Mathematics & Computation vol. 20, Nos. 1 & 2, 1986.
Geist, Heath and E. Ng; Parallel Algorithms for Matrix Computations; pp.: 233-250, Mathematical Sci. Sec., Oak Ridge National Lab.
Lamagna; Fast Computer Algebra; pp.: 43-56, Computer Sep. 1982.
Jagadish and Kailath; A Family of New Efficiency Arrays for Matrix Multiplications; pp.: 149-155, IEEE Trans. on Computers vol. 38, No. 1, Jan. 1989.
Pan; How to Multiply Matrices Faster; pp.: 250-251, 1984, Book Reviews.
Evans; Designing Efficient Systolic Algorithms for VLSI Parallel Processor Arrays; pp.: 261-281, Parallel Architecture & Computer Vision, 1988.
Aggarwal, Alpern, Chandra and Snir; A Model for Hierarchical Memory; pp.: 305-314, Proceedings of the 19th Annual ACM Symposium on Theory of Computing 1987.
Johnson; Communication Efficient Basic Linear Algebra Computations on Hypercube Architecture; pp.: 133-172, J. of Parallel & Distributed Computing vol. 4, 1987.
Varman, Ramakrishnan; A Fault-Tolerant VLSI Matrix Multiplier; pp.: 351-357, Proceedings 1986 Intl. Conf. on Parallel Processing.
Carnevali, Radicati, Robert, Sguazzero; Block Algorithms for Gaussian Elimination and Householder Reduction on the IBM 3090 Vector Multiprocessor; pp.: 297-302, Proceeding of the Intl. Conf. on Parallel Processing & Applications, Italy Sep. 23-25, 1987.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Blocked matrix multiplication for computers with hierarchical me does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Blocked matrix multiplication for computers with hierarchical me, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Blocked matrix multiplication for computers with hierarchical me will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2015750

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.