Data speculation based on stack-relative addressing patterns

Details Data speculation based on stack-relative addressing patterns Data speculation based on stack-relative addressing patterns

2006-08-08

2006-08-08

Padmanabhan, Mano (Department: 2188)

Electrical computers and digital processing systems: memory

Address formation

Generating a particular pattern/sequence of addresses

C712S239000, C712S219000, C365S049130

Reexamination Certificate

active

07089400

ABSTRACT:
A processor may include a stack file and an execution core. The stack file may include an entry configured to store an addressing pattern and a tag. The addressing pattern identifies a memory location within the stack area of memory. The stack file may be configured to link a data value identified by the tag stored in the entry to the speculative result of a memory operation if the addressing pattern of the memory operation matches the addressing pattern stored in the entry. The execution core may be configured to access the speculative result when executing another operation that is dependent on the memory 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: 5845103 (1998-12-01), Sadani et al.
patent: 5892936 (1999-04-01), Tran et al.
patent: 6021485 (2000-02-01), Feiste et al.
patent: 6065103 (2000-05-01), Tran et al.
patent: 6108770 (2000-08-01), Chrysons 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: 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: 6549990 (2003-04-01), Hughes et al.
patent: 6643767 (2003-11-01), Sato
patent: 6658554 (2003-12-01), Moshovos et al.
patent: 6671196 (2003-12-01), Civlin
patent: 2002/0023204 (2002-02-01), Barowski et al.
patent: 01/35212 (2001-05-01), None
patent: 03/093982 (2003-11-01), None
Kim, et al., “Implementing Optimizations at Decode Time,” Dept. of Electrical and Computer Engineering, Univ. of Wisconsin-Madison, 11 pages.
Moshovos, et al., “Streamlining Inter-operations Memory Communication via Data Dependence Prediction,” IEEE, 1997, 11 pages.
Reinman, et al., “Classifying Load and Store Instructions for Memory Renaming,” Proceedings of the International Conference on Supercomputing, Jun. 1999, 10 pages.
Bekerman, et al., “Early Load Address Resolution Via Register Tracking,” Intel Corporation, Proceedings 27thInternational Symposium Computer Architecture, Jun. 2000, pp. 306-316.
Jourdan, et al., “A Novel Renaming Scheme to Exploit Value Temporal Locality through Physical Register Reuse and Unification,” Intel Corporation, IEEE, 1998, 10 pages.
Moshovos, et al., “Memory Dependence Prediction in Multimedia Applications,” 18 pages.
Thomas, et al., “Using Dataflow Context for Accurate Value Prediction,” 10 pages.
Onder, et al., “Load and Store Reuse Using Register File Contents,” ACM 15thInternational Conference on Supercomputing, pp. 289-302, Jun. 2001.
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.

Affiliated with

Also associated with

Rating

Data speculation based on stack-relative addressing patterns does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data speculation based on stack-relative addressing patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data speculation based on stack-relative addressing patterns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3687748