Using computation histories to make predictions

Electrical computers and digital processing systems: processing – Processing control – Branching

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07624258

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: 5828874 (1998-10-01), Steely et al.
patent: 5996060 (1999-11-01), Mendelson et al.
patent: 6173384 (2001-01-01), Weaver
patent: 6247122 (2001-06-01), Henry et al.
patent: 6272623 (2001-08-01), Talcott
patent: 6353882 (2002-03-01), Hunt
patent: 6393544 (2002-05-01), Bryg et al.
patent: 6418530 (2002-07-01), Hsu et al.
patent: 6427206 (2002-07-01), Yeh et al.
patent: 6510511 (2003-01-01), Talcott
patent: 6516409 (2003-02-01), Sato
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, Renju, Franklin, Manoj, Wilkerson, Chris, Stark, Jared. “Improving branch prediction by dynamic dataflow-based identification of correlated branches from a large global history” Proceedings of the 30th annual international symposium on computer architecture, pp. 314-323, 2003.
Thomas, Renju, Franklin, Manoj. “Using dataflow based context for accurate branch prediction” High performance computing 2002, pp. 587-596.
Sazeides, Yiannakis. “Dependence Based Value Prediction” Department of Computer Science University of Cyprus, Feb. 2002. pp. 1-23. Nicosia, Cyprus.
Thomas, et al. “Using Dataflow Based Context for Accurate Branch Prediction” High Performance Computing 2002. 9th International Conference. pp. 587-596.
Sathe, et al. “Techniques For Performing Highly Accurate Data Value Prediction” Microprocessors and Microsystems 22 (1998). pp. 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. pp. 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. pp. 107-117.
Jin, et al. “Branch Prediction of Conditional Nested Loops Through an Address Queue” Proceeding of the ISCA 14th Conference 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.

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

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

     

Profile ID: LFUS-PAI-O-4058290

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