Method and structure for producing high performance linear...

Data processing: software development – installation – and managem – Software program development tool – Translation of code

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C717S151000, C717S159000, C717S160000, C708S495000, C708S520000

Reexamination Certificate

active

07571435

ABSTRACT:
A method (and structure) for executing linear algebra subroutines, includes, for an execution code controlling operation of a floating point unit (FPU) performing the linear algebra subroutine execution, unrolling instructions to preload data into a floating point register (FReg) of the FPU. The unrolling generates an instruction to load data into the FReg and the instruction is inserted into a sequence of instructions that execute the linear algebra subroutine on the FPU.

REFERENCES:
patent: 5025407 (1991-06-01), Gulley et al.
patent: 5099447 (1992-03-01), Myszewski
patent: 5438669 (1995-08-01), Nakazawa et al.
patent: 5513366 (1996-04-01), Agarwal et al.
patent: 5644517 (1997-07-01), Ho
patent: 5825677 (1998-10-01), Agarwal et al.
patent: 5944819 (1999-08-01), Kumar et al.
patent: 5983230 (1999-11-01), Gilbert et al.
patent: 6021420 (2000-02-01), Takamuki
patent: 6115730 (2000-09-01), Dhablania et al.
patent: 6357041 (2002-03-01), Pingali et al.
patent: 6470368 (2002-10-01), Garg et al.
patent: 6507892 (2003-01-01), Mulla et al.
patent: 6601080 (2003-07-01), Garg
patent: 6675106 (2004-01-01), Keenan et al.
patent: 7028168 (2006-04-01), Wadleigh
patent: 7031994 (2006-04-01), Lao et al.
patent: 2003/0088600 (2003-05-01), Lao et al.
patent: 2004/0148324 (2004-07-01), Garg
Dongarra et al., A Set of Level 3 Basic Linear Algebra Subprograms, ACM Transactions on Mathematical Software, vol. 16, No. 1, Mar. 1990, pp. 1-17.
Volume 1, “Foundations of Computer-Aided Chemical Process Design” Copyright 1981, American Institute of Chemical Engineering (2-Volume Series), pp. 77-143.
“Improving performance of linear algebra algorithms for dense matrices, using algorithmic prefetch” R. C. Agarwal, F. G. Gustavson, M. Zubair; IBM Journal of Research and Development; vol. 38, Issue 3 (May 1994); pp. 265-275; Year of Publication: 1994.
Gunnels, et al., “A Family of High-Performance Matrix Multiplication Algorithms”, ICCS 2001, LNCS 2073, pp. 51-60, 2001 (also available at http://www.cs.utexas.edu/users/flame/pubs/ICCS2001.pdf).
Gunnels, et al., “A Novel Theoretical Model Produces Matrix Multiplication Algorithms That Predict Current Practice”, IBM Research Report RC23443 (W0411-176), Nov. 19, 2004.
Phillip et al., PLAPACK: Parallel Linear Algebra Package Design Overview, 1997, IEEE Proceedings of the ACM/IEEE SC97 Conference.
Agarwal et al., A High Performance Algorithm Using Pre-Processing for the Sparse Matrix-Vector Multiplication, 1992, IEEE, pp. 32-41.
Fred G. Gustavson and Andre Henriksson and Isak Jonsson and Bo Kagstrom and Per Ling: Superscalar GEMM-based Level 3 BLAS The On-going Evolution of a Portable and High-Performance Library (1998); Applied Parallel Computing, Published 1998, Springer, pp. 207-215.
Vinod et al., A Framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels, 2002, Concurrency and Computation: Practice and Experience 14(10): 805-839.

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

Method and structure for producing high performance linear... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and structure for producing high performance linear..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and structure for producing high performance linear... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4109866

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