Using computation histories to make predictions

Details Using computation histories to make predictions Using computation histories to make predictions

2006-11-28

2006-11-28

Chan, Eddie (Department: 2183)

Electrical computers and digital processing systems: processing

Processing control

Branching

Reexamination Certificate

active

07143272

ABSTRACT:
Associated with an instruction in a program is a computation history. The computation history represents all objects that affect the result of the instruction, such objects including (but not limited to) registers, memory locations, static values, and instruction program counters. The computation history may be used to make a prediction about a property of the instruction.

REFERENCES:
patent: 4370711 (1983-01-01), Smith
patent: 5996060 (1999-11-01), Mendelson et al.
patent: 6173384 (2001-01-01), Weaver
patent: 6247122 (2001-06-01), Henry et al.
patent: 6353882 (2002-03-01), Hunt
patent: 6393544 (2002-05-01), Bryg et al.
patent: 6427206 (2002-07-01), Yeh et al.
patent: 6601161 (2003-07-01), Rappoport et al.
patent: 6766443 (2004-07-01), Sinharoy
patent: 6779108 (2004-08-01), Ju et al.
patent: 6813763 (2004-11-01), Takahashi et al.
Thomas et al. Using dataflow based context for Accurate Branch prediction. High Performance Computing 2002. 9th International Conference. Pages 587-596.
Sathe et al. Techniques for performing highly accurate data value prediction. Microprocessors and Microsystems 22 (1998) 303-313.
Reches et al. Implementation and Analysis of Path History in Dynamic Branch Prediction Schemes. IEEE transactions on Computers, vol. 47, No. 8, Aug. 1998. Pages 907-912.
Thomas et al. Using dataflow based context for accurate value prediction. International Conference on Parallel Architectures and Compilation Techniques, Sep. 8-12, 2001. Pages 107-117.
Jin, Zhigang, Passos, Nelson L. “Branch prediction of conditional nested loops through an address queue” Proceedings of the ISCA 14thconference parallel and distributed computing systems. Aug. 2001.
Passos et al. “Schedule-based multi-dimensional retiming on data flow graphs” IEEE 1994.
Passos et al. “Achieving full parallelism using multidimensional retiming” IEEE 1996.
Chao et al. “Static scheduling of uniform nested loops” IEEE 1993.
Lipasti et al. “Exceeding the dataflow limit via value prediction” IEEE 1996.
Yiannakis Sazeides “Dependence Based Value Prediction” Department of Computer Science University of Cyprus, Feb. 2002, pp. 1-23.

Affiliated with

Also associated with

Rating

Using computation histories to make predictions does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Using computation histories to make predictions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using computation histories to make predictions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3625984