Electrical computers and digital processing systems: processing – Processing architecture – Vector processor
Reexamination Certificate
2008-04-29
2008-04-29
Chan, Eddie (Department: 2183)
Electrical computers and digital processing systems: processing
Processing architecture
Vector processor
C714S053000, C714S719000, C714S819000, C714S824000
Reexamination Certificate
active
10643574
ABSTRACT:
A method and apparatus to correctly compute a vector-gather, vector-operate (e.g., vector add), and vector-scatter sequence, particularly when elements of the vector may be redundantly presented, as with indirectly addressed vector operations. For an add operation, one vector register is loaded with the “add-in” values, and another vector register is loaded with address values of “add to” elements to be gathered from memory into a third vector register. If the vector of address values has a plurality of elements that point to the same memory address, the algorithm should add all the “add in” values from elements corresponding to the elements having the duplicated addresses. An indirectly addressed load performs the “gather” operation to load the “add to” values. A vector add operation then adds corresponding elements from the “add in” vector to the “add to” vector. An indirectly addressed store then performs the “scatter” operation to store the results.
REFERENCES:
patent: RE28577 (1975-10-01), Schmidt
patent: 4412303 (1983-10-01), Barnes et al.
patent: 4541046 (1985-09-01), Nagashima et al.
patent: 4771391 (1988-09-01), Blasbalg
patent: 4868818 (1989-09-01), Madan et al.
patent: 4888679 (1989-12-01), Fossum et al.
patent: 4933933 (1990-06-01), Dally et al.
patent: 4989131 (1991-01-01), Stone
patent: 5008882 (1991-04-01), Peterson et al.
patent: 5031211 (1991-07-01), Nagai et al.
patent: 5036459 (1991-07-01), Den Haan et al.
patent: 5068851 (1991-11-01), Bruckert et al.
patent: 5105424 (1992-04-01), Flaig et al.
patent: 5157692 (1992-10-01), Horie et al.
patent: 5161156 (1992-11-01), Baum et al.
patent: 5170482 (1992-12-01), Shu et al.
patent: 5175733 (1992-12-01), Nugent
patent: 5197130 (1993-03-01), Chen et al.
patent: 5218601 (1993-06-01), Chujo et al.
patent: 5218676 (1993-06-01), Ben-Ayed et al.
patent: 5239545 (1993-08-01), Buchholz
patent: 5276899 (1994-01-01), Neches
patent: 5280474 (1994-01-01), Nickolls et al.
patent: 5313628 (1994-05-01), Mendelsohn et al.
patent: 5313645 (1994-05-01), Rolfe
patent: 5331631 (1994-07-01), Teraslinna
patent: 5333279 (1994-07-01), Dunning
patent: 5341504 (1994-08-01), Mori et al.
patent: 5347450 (1994-09-01), Nugent
patent: 5353283 (1994-10-01), Tsuchiya
patent: 5365228 (1994-11-01), Childs et al.
patent: 5375223 (1994-12-01), Meyers et al.
patent: 5418916 (1995-05-01), Hall et al.
patent: 5430850 (1995-07-01), Papadopoulos et al.
patent: 5430884 (1995-07-01), Beard et al.
patent: 5434995 (1995-07-01), Oberlin et al.
patent: 5440547 (1995-08-01), Easki et al.
patent: 5446915 (1995-08-01), Pierce
patent: 5517497 (1996-05-01), LeBoudec et al.
patent: 5530933 (1996-06-01), Frink et al.
patent: 5546549 (1996-08-01), Barrett et al.
patent: 5548639 (1996-08-01), Ogura et al.
patent: 5550589 (1996-08-01), Shiojiri et al.
patent: 5555542 (1996-09-01), Ogura et al.
patent: 5560029 (1996-09-01), Papadopoulos et al.
patent: 5640524 (1997-06-01), Beard et al.
patent: 5649141 (1997-07-01), Yamazaki
patent: 5721921 (1998-02-01), Kessler et al.
patent: 5765009 (1998-06-01), Ishizaka
patent: 5787494 (1998-07-01), DeLano et al.
patent: 5796980 (1998-08-01), Bowles
patent: 5835951 (1998-11-01), McMahan
patent: 5860146 (1999-01-01), Vishin et al.
patent: 5897664 (1999-04-01), Nesheim et al.
patent: 5987571 (1999-11-01), Shibata et al.
patent: 6003123 (1999-12-01), Carter et al.
patent: 6014728 (2000-01-01), Baror
patent: 6088701 (2000-07-01), Whaley et al.
patent: 6101590 (2000-08-01), Hansen
patent: 6105113 (2000-08-01), Schimmel
patent: 6308250 (2001-10-01), Klausler
patent: 6308316 (2001-10-01), Hashimoto et al.
patent: 6490671 (2002-12-01), Frank et al.
patent: 6496925 (2002-12-01), Rodgers et al.
patent: 6519685 (2003-02-01), Chang
patent: 6684305 (2004-01-01), Deneau
patent: 6782468 (2004-08-01), Nakazato
patent: 6816960 (2004-11-01), Koyanagi
patent: 6922766 (2005-07-01), Scott
patent: 6925547 (2005-08-01), Scott et al.
patent: 6976155 (2005-12-01), Drysdale et al.
patent: 2002/0116600 (2002-08-01), Smith et al.
patent: 2002/0169938 (2002-11-01), Scott et al.
patent: 2002/0172199 (2002-11-01), Scott et al.
patent: 2003/0005380 (2003-01-01), Nguyen et al.
patent: 2003/0167383 (2003-09-01), Gupta et al.
patent: 2004/0044872 (2004-03-01), Scott
patent: 2004/0162949 (2004-08-01), Scott et al.
patent: 2005/0044128 (2005-02-01), Scott et al.
patent: 2005/0044339 (2005-02-01), Sheets
patent: 2005/0044340 (2005-02-01), Sheets et al.
patent: 0353819 (1990-02-01), None
patent: 0475282 (1990-09-01), None
patent: 0473452 (1992-03-01), None
patent: 0501524 (1992-09-01), None
patent: 0570729 (1993-11-01), None
patent: WO-87/01750 (1987-03-01), None
patent: WO-88/08652 (1988-11-01), None
patent: WO-95/16236 (1995-06-01), None
patent: WO-9610283 (1996-04-01), None
patent: WO-9632681 (1996-10-01), None
US 7,243,211, 07/2007, Kohn (withdrawn)
Patterson, David. Hennessy, John. “Computer Architecture: A Quantitative Approach”. Morgan Kaufmann Publishers Inc, 2nd Edition, 1996. pp. 194-197.
Cohoon, James. Davidson, Jack. “C++ Program Design”. McGraw-Hill Companies, Inc. 2nd Edition, 1999. p. 493.
Ernst, Dan. Hamel, Andrew. Austin, Todd. “Cyclone: A Broadcast-Free Dynamic Instruction Scheduler with Selective Replay”. Appears in the 30th Annual International Symposium on Computer Architecture (ISCA-2003), Jun. 2003.
Author Unknown: “ECPE 4504: Computer Organization Lecture 12: Computer Arithmetic”. The Bradley Department of Electrical Engineering, Oct. 17, 2000.
“Cray Assembly Language (CAL) for Cray X1™ Systems Reference Manual”,Section 2.6, Memory Ordering,http://docs.cray.com/books/S-2314-51/index.html, (Jun. 2003), 302 pgs.
“Deadlock-Free Routing Schemes on Multistage Interconnection Networks”,IBM Technical Disclosure Bulletin,35, (Dec. 1992), 232-233.
“Msync—Synchronise Memory with Physical Storage”,The Single UNIX® Specification, Version 2, The Open Group,https://www.opengroup.org/onlinepubs/007908799/xsh/msync.html, (1997), 3 pgs.
Abts, D., “So Many States, So Little Time: Verifying Memory Coherence in the Cray X1”,Parallel and Distributed Processing Symposium,(Apr. 22, 2003), 11-20.
Adve, V. S., et al., “Performance Analysis of Mesh Interconnection Newtorks with Deterministic Routing”,Transactions on Parallel and Distributed Systems,(Mar. 1994), 225-246.
Bolding, K., “Non-Uniformities Introduced by Virtual Channel Deadlock Prevention”,Tehnical Report 92-07-07, Department of Computer Science and Engineering,FR-35 University of Washington; Seattle, WA 98195, (Jul. 21, 1992), 1-6.
Bolla, R., “A Neural Strategy for Optimal Multiplexing of Circuit and Packet-Switched Traffic”,Proceedings, IEEE Global Telecommunications Conference,(1992), 1324-1330.
Boura, Y. M., et al., “Efficient Fully Adaptive Wormhole Routing inn- dimensional Meshes”,Proceedings, International Conference on Distributed Computing Systems,(Jun. 1994), 589-596.
Bundy, A., et al., “Turning Eureka Steps into Calculations in Automatic Program Synthesis”,Proceedings of UK IT 90,(IEE Conf. Pub. 316) (DAI Research Paper 448), (1991), 221-226.
Carlile, B. R., “Algorithms and Design: The Cray APP Shared-Memory System”,COMPCON Spring '93. Digest of Papers.,(Feb. 22, 1993), 312-320.
Chen, Y., et al., “UTLB: A Mechanism for Address Translation on Network Interfaces”,Proceedings of the Eighth International Conference on Architectural Support for Programming Languages and Operating Systems(ASPLOS), (1998), 193-204.
Chien, A. A., et al., “Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors”,Proceedings 19th International. Symposium on Computer Architecture,(May 1992), 268-277.
Dally, W. J., et al., “Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels”,IEEE Transactions on Parallel and Distributed Systems
Chan Eddie
Cray Inc.
Fennema Robert E.
LandOfFree
Indirectly addressed vector load-operate-store method and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Indirectly addressed vector load-operate-store method and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Indirectly addressed vector load-operate-store method and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3946780