System and method for modifying a load operation to include...

Electrical computers and digital processing systems: processing – Processing control – Processing control for data transfer

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C712S226000

Reexamination Certificate

active

10135631

ABSTRACT:
A system may include a dispatch unit, a scheduler, and an execution core. The dispatch unit may be configured to modify a load operation to include a register-to-register move operation in response to an indication that a speculative result of the load operation is linked to a data value identified by a first tag. The scheduler may be coupled to the dispatch unit and configured to issue the register-to-register move operation in response to availability of the data value. The execution core may be configured to execute the register-to-register move operation by outputting the data value and a tag indicating that the data value is the result of the load operation.

REFERENCES:
patent: 5428807 (1995-06-01), McKeen et al.
patent: 5452426 (1995-09-01), Papworth et al.
patent: 5584009 (1996-12-01), Garibay et al.
patent: 5778219 (1998-07-01), Amerson et al.
patent: 5781752 (1998-07-01), Moshovos et al.
patent: 5838941 (1998-11-01), Valentine et al.
patent: 5845103 (1998-12-01), Sadani et al.
patent: 5848256 (1998-12-01), Call et al.
patent: 6021485 (2000-02-01), Feiste et al.
patent: 6065103 (2000-05-01), Tran et al.
patent: 6108770 (2000-08-01), Chrysos et al.
patent: 6112296 (2000-08-01), Witt et al.
patent: 6175910 (2001-01-01), Pauporte et al.
patent: 6202204 (2001-03-01), Wu et al.
patent: 6237082 (2001-05-01), Witt et al.
patent: 6249862 (2001-06-01), Chinnakonda et al.
patent: 6295574 (2001-09-01), MacDonald
patent: 6321328 (2001-11-01), Karp et al.
patent: 6349382 (2002-02-01), Feiste et al.
patent: 6415380 (2002-07-01), Sato
patent: 6438673 (2002-08-01), Jourdan et al.
patent: 6463580 (2002-10-01), Wilkerson
patent: 6505293 (2003-01-01), Jourdan et al.
patent: 6549990 (2003-04-01), Hughes et al.
patent: 6643767 (2003-11-01), Sato
patent: 6658554 (2003-12-01), Moshovos et al.
patent: 2002/0023204 (2002-02-01), Barowski et al.
patent: 2003/0023959 (2003-01-01), Park
patent: 2005/0149702 (2005-07-01), Hily et al.
patent: 01/35212 (2001-05-01), None
patent: 03/093982 (2003-11-01), None
Dean M. Tullsen and John S. Seng. “Storageless Value Prediction Using Prior Register Values.” IEEE, 1999. pp. 270-279.
Jun Yang and Rajiv Gupta. “Load Redundancy Removal through Instruction Reuse.” Department of Computer Science, The University of Arizona.
Avinash Sodani and Gurindar S. Sohi. “Dynamic Instruction Reuse.” ACM, 1997. pp. 194-205.
“Webster's II: New College Dictionary.” Houghton Mifflin Company, 2001. p. 328.
Omondi, Amos R. The Microarchitecture of Pipelined and Superscalar Computers. Kluwer Academi Publishers, 1999. pp. 161-163 and 166.
Roget's New Millennium Thesaurus, First Edition, (v 1.1.1) Copyright 2005, Lexico Publishing. Found on www.thesaurus.com, pp. 1-5.
American Heritage Dictionary of the English Language, Fourth Edition, Copyright 2000, Houghton Mifflin Company. Found on www.dictionary.com, pp. 1-3.
WordNet 2.0, 2003 Princeton University. Found on www.dictionary.com, pp. 1-3.
Sima et al. Advanced Computer Architectures, A Design Space Approach, Addison-Wesley, 1998, pp. 209-211 and 228-231.
Petric, et al., “Three Extensions to Register Integration,” IEEE, 35thAnnual IEEE/ACM International Symposium on Microarchitecture (MICRO-35), Nov. 18-22, 2002, 12 pages.
Lee, et al., “Stack Value File: Custom Microarchitecture for the Stack,” IEEE, Seventh International Symposium on High-Performance Computer Architecture (HPCA'01), Jan. 20-24, 2001, 11 pages.
Chung, et al., “Direct Load: Dependence-Linked Dataflow Resolution of Load Address and Cache Coordinate,” 35thAnnual International Symposium on Microarchitecture (MICRO'01), Dec. 1-5, 2001, IEEE, pp. 76-87.
Ma, et al., “Symbolic Cache: Fast Memory Access Based on Program Syntax,” International Conference on Computer Design: VLSI in Computers & Processors (ICDD'01), Sep. 23-26, 2001, IEEE, pp. 54-61.
Andreas Moshovos, et al., “Memory Dependence Prediction in Multimedia Applications,” Northwestern University and University of Wisconsin-Madison, 18 pages.
Stephan Jourdan, et al., “A Novel Renaming Scheme to Exploit Value Temporal Locality Through Physical Register Reuse and Unification,” Intel Corporation, IEEE, 1998, 10 pages.
Michael Bekerman, et al., “Early Load Address Resolution Via Register Tracking,” Intel Corporation, 9 pages.
Thomas, et al., “Using Dataflow Based Context for Accurate Value Prediction,” ECE Dept., Univ. of Maryland, 11 pages.
Kim, et al., “Implementing Optimizations at Decode Time,” Dept. of Electrical and Computer Engineering, Univ. of Wisconsin-Madison, 12 pages.
Onder, et al., “Load and store Reuse Using Register File Contents,” Dept. of Computer Science, Michigan Technological Univ., 14 pages.
Moshovos, et al., “Streamlining Inter-operation Memory Communication via Data Dependence Predication,” Computer Sciences Dept., Univ. of Wisconsin-Madison, Dec. 1-3, 1997, 11 pages.
Reinman, et al, “Classifying Load and Store Instructions for Memory Renaming,” Dept of Computer Science and Engineering, Univ. of California, San Diego, Proceedings of the International Conference on Supercomputing, Jun. 1999, 10 pages.

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

System and method for modifying a load operation to include... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for modifying a load operation to include..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for modifying a load operation to include... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3743043

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