Method and structure for fast in-place transformation of standard full and packed matrix data formats

US9213680B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9213680-B2
Application numberUS-84927207-A
CountryUS
Kind codeB2
Filing dateSep 1, 2007
Priority dateJan 14, 2005
Publication dateDec 15, 2015
Grant dateDec 15, 2015

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A method and structure for an in-place transformation of matrix data. For a matrix A stored in one of a standard full format or a packed format and a transformation T having a compact representation, blocking parameters MB and NB are chosen, based on a cache size. A sub-matrix A 1 of A, A 1 having size M 1 =m*MB by N 1 =n*NB, is worked on, and any of a residual remainder of A is saved in a buffer B. Sub-matrix A 1 is worked on by contiguously moving and contiguously transforming A 1 in-place into a New Data Structure (NDS), applying the transformation T in units of MB*NB contiguous double words to the NDS format of A 1 , thereby replacing A 1 with the contents of T(A 1 ), and moving and transforming NDS T(A 1 ) to standard data format T(A 1 ) with holes for the remainder of A in buffer B. The contents of buffer B is contiguously copied into the holes of A 2 , thereby providing in-place transformed matrix T(A).

First claim

Opening claim text (preview).

Having thus described our invention, what we claim as new and desire to secure by Letters Patent is as follows: 1. A computerized method for an in-place transformation of matrix data, said method comprising: for a matrix A having a size M×N, as stored in a memory of a computer in one of a standard full format or a packed format in one of a column major format or a row major format, and for a transformation T having a compact representation, choosing blocking parameters MB and NB b…

Assignees

Inventors

Classifications

Patent family

Related publications grouped by family.

External sources

Next steps

Free tools are coming soon. Tell us what you want to track and we'll notify you.

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9213680B2 cover?
A method and structure for an in-place transformation of matrix data. For a matrix A stored in one of a standard full format or a packed format and a transformation T having a compact representation, blocking parameters MB and NB are chosen, based on a cache size. A sub-matrix A 1 of A, A 1 having size M 1 =m*MB by N 1 =n*NB, is worked on, and any of a residual remainder of A is saved in a bu…
Who is the assignee on this patent?
Gustavson Fred Gehrung, Gunnels John A, Sexton James C, and 1 more
What technology area does this patent fall under?
Primary CPC classification G06F17/16. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Dec 15 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).