Fetch speculation in a multithreaded processor

Electrical computers and digital processing systems: processing – Instruction fetching – Of multiple instructions simultaneously

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C712S218000, C712S228000, C712S244000

Reexamination Certificate

active

10881152

ABSTRACT:
In one embodiment, a processor comprises an instruction cache and a fetch generator circuit coupled thereto. The fetch generator circuit is configured to generate at least one fetch request to the instruction cache for at least one of the plurality of threads. The fetch generator circuit is also configured to monitor for a plurality of conditions for each thread, wherein each of the plurality of conditions defined to inhibit the thread from being fetched. The fetch generator circuit is configured to speculatively generate a first fetch request for a first thread of the plurality of threads if each thread is inhibited from fetching and the first thread is inhibited from fetching only due to a first predetermined condition of the plurality of conditions. In one particular implementation, the first predetermined condition is a lack of room in a corresponding one of a plurality of instruction buffers.

REFERENCES:
patent: 5046068 (1991-09-01), Kubo et al.
patent: 5257215 (1993-10-01), Poon
patent: 5339266 (1994-08-01), Hinds et al.
patent: 5353419 (1994-10-01), Touch et al.
patent: 5386375 (1995-01-01), Smith
patent: 5515308 (1996-05-01), Karp et al.
patent: 5546593 (1996-08-01), Kimura et al.
patent: 5619439 (1997-04-01), Yu et al.
patent: 5954789 (1999-09-01), Yu et al.
patent: 6076157 (2000-06-01), Borkenhagen et al.
patent: 6088788 (2000-07-01), Borkenhagen et al.
patent: 6088800 (2000-07-01), Jones et al.
patent: 6105127 (2000-08-01), Kimura et al.
patent: 6131104 (2000-10-01), Oberman
patent: 6212544 (2001-04-01), Borkenhagen et al.
patent: 6282554 (2001-08-01), Abdallah et al.
patent: 6341347 (2002-01-01), Joy et al.
patent: 6349319 (2002-02-01), Shankar et al.
patent: 6357016 (2002-03-01), Rodgers et al.
patent: 6397239 (2002-05-01), Oberman et al.
patent: 6415308 (2002-07-01), Dhablania et al.
patent: 6427196 (2002-07-01), Adiletta et al.
patent: 6434699 (2002-08-01), Jones et al.
patent: 6496925 (2002-12-01), Rodgers et al.
patent: 6507862 (2003-01-01), Joy et al.
patent: 6523050 (2003-02-01), Dhablania et al.
patent: 6560693 (2003-05-01), Puzak et al.
patent: 6564328 (2003-05-01), Grochowski et al.
patent: 6567839 (2003-05-01), Borkenhagen et al.
patent: 6594681 (2003-07-01), Prabhu
patent: 6625654 (2003-09-01), Wolrich et al.
patent: 6629236 (2003-09-01), Aipperspach et al.
patent: 6629237 (2003-09-01), Wolrich et al.
patent: 6658534 (2003-12-01), White et al.
patent: 6668308 (2003-12-01), Barroso et al.
patent: 6668317 (2003-12-01), Bernstein et al.
patent: 6671827 (2003-12-01), Guilford et al.
patent: 6681345 (2004-01-01), Storino et al.
patent: 6687838 (2004-02-01), Orenstien et al.
patent: 6694347 (2004-02-01), Joy et al.
patent: 6694425 (2004-02-01), Eickemeyer
patent: 6697935 (2004-02-01), Borkenhagen et al.
patent: 6711668 (2004-03-01), Wojcieszak et al.
patent: 6728845 (2004-04-01), Adiletta et al.
patent: 6748556 (2004-06-01), Storino et al.
patent: 6801997 (2004-10-01), Joy et al.
patent: 6820107 (2004-11-01), Kawai et al.
patent: 6847985 (2005-01-01), Gupta et al.
patent: 6857064 (2005-02-01), Smith et al.
patent: 6883107 (2005-04-01), Rodgers et al.
patent: 6889319 (2005-05-01), Rodgers et al.
patent: 6898694 (2005-05-01), Kottapalli et al.
patent: 2003/0204705 (2003-10-01), Oldfield et al.
Tulsen et al., “Power-sensitive multithreaded architecture,” IEEE 2000, pp. 199-206.
Uhrig et al., “Hardware-based power management for real-time applications,” Proceedings of the Second International Symposium on Parallel and Distributed Computing, IEEE 2003, 8 pages.
Tullsen, et al., “Simultaneous Multithreading: Maximizing On-Chip Parallelism,” ISCA 1995, pp. 533-544.
Tullsen, et al., “Exploiting Choice: Instruction Fetch and Issue on an Implementable Simultaneous Multithreading Processor,” pp. 191-202.
Uhrig, et al., “Implementing Real-Time Scheduling Within A Multithreaded Java Microcontroller,” 8 pages.
Ide, et al., “A 320-MFLOPS CMOS Floating-Point Processing Unit for Superscalar Processors,” IEEE 1993, 5 pages.
Nemawarkar, et al., “Latency Tolerance: A Metric for Performance Analysis of Multithreaded Architectures,” IEEE 1997, pp. 227-232.
Baniasadi, et al., “Instruction Flow-Based Front-end Throttling for Power-Aware High-Performance Processors,” ACM 2001, pp. 16-21.
Gura, et al., “An End-to-End Systems Approach to Elliptic Curve Cryptography,” 16 pages.
Eberle, et al., “Cryptographic Processor for Arbitrary Elliptic Curves over GF(2m),” 11 pages.
Alverson et al., “Tera Hardware-Software Cooperation,” Tera Computer Company, 1997, (16 pages).
Alverson et al., “The Tera Computer System,” Tera Computer Company, 1990, (pp. 1-6).
Alverson et al., Exploiting Heterogeneous Parallelism on a Multithreaded Multiprocessor, Tera Computer Company, 1992, (pp. 188-197).
Smith et al., “The End of Architecture,” 17thAnnual Symposium on Computer Arcitecture, Seattle, Washington, May 29, 1990, (pp. 10-17).
Ungerer et al., “A Survey of Processors with Explicit Multithreading,” ACM Computing Surveys, vol. 35, No. 1, Mar. 2003, (pp. 29-63).

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

Fetch speculation in a multithreaded processor does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fetch speculation in a multithreaded processor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fetch speculation in a multithreaded processor will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3822165

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