Simultaneous speculative threading light mode

Electrical computers and digital processing systems: processing – Processing control

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

08006073

ABSTRACT:
A system and method for management of resource allocation of threads for efficient execution of instructions. Prior to dispatching decoded instructions of a first thread from the instruction fetch unit to a buffer within a scheduler, logic within the instruction fetch unit may determine the buffer is already full of dispatched instructions. However, the logic may also determine that a buffer for a second thread within the core or micro core is available. The second buffer may receive and issue decoded instructions for the first thread until the buffer is becomes unavailable. While the second buffer receives and issues instructions for the first thread, the throughput of the system for the first thread may increase due to a reduction in wait cycles.

REFERENCES:
patent: 6907520 (2005-06-01), Parady
patent: 7185178 (2007-02-01), Barreh et al.
patent: 2005/0138328 (2005-06-01), Moy et al.
patent: 2005/0251648 (2005-11-01), Yamazaki
patent: 2006/0004995 (2006-01-01), Hetherington et al.
patent: 2006/0101238 (2006-05-01), Bose et al.
patent: 2006/0179274 (2006-08-01), Jones et al.
U.S. Appl. No. 61/052,536, filed May 12, 2008.

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

Simultaneous speculative threading light mode does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Simultaneous speculative threading light mode, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simultaneous speculative threading light mode will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2647642

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