Matrix processing method of shared-memory scalar...

Electrical computers and digital processing systems: processing – Processing architecture – Array processor

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C708S520000

Reexamination Certificate

active

06907513

ABSTRACT:
In accordance with a parallel matrix processing method adopted in a shared-memory scalar computer, a matrix to be subjected to LU factorization is divided into a block D of the diagonal portion and blocks beneath the D diagonal block such as L1, L2and L3. Then, D+L1, D+L2and D+L3are assigned to 3 processors respectively for processing them in parallel. Next, a block U is updated by adopting an LU-factorization method and C1to C3are updated with L1to L3and U. By carrying out this processing on the inner side gradually decreasing in size as blocks, finally, a portion corresponding to the D diagonal block remains to be processed. By applying the LU factorization to this D portion, the LU factorization for the entire matrix can be completed.

REFERENCES:
patent: 5157778 (1992-10-01), Bischoff et al.
patent: 5490278 (1996-02-01), Mochizuki
patent: 5604911 (1997-02-01), Ushiro
patent: 5644517 (1997-07-01), Ho
patent: 6144932 (2000-11-01), Hachiya
patent: 6182270 (2001-01-01), Feldmann et al.
patent: 6360190 (2002-03-01), Kumashiro
patent: 8-227405 (1995-09-01), None
Communication from Japanese Patent Office dated Mar. 30, 2004.

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

Matrix processing method of shared-memory scalar... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Matrix processing method of shared-memory scalar..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matrix processing method of shared-memory scalar... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3511529

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