Flexible demand-based resource allocation for multiple...

Electrical computers and digital processing systems: processing – Processing architecture – Data driven or demand driven processor

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C712S027000

Reexamination Certificate

active

07003648

ABSTRACT:
A multi-threaded processor provides for efficient flow-control from a pool of un-executed stores in an instruction queue to a store queue. The processor also includes similar capabilities with respect to load instructions. The processor includes logic organized into a plurality of thread processing units (“TPUs”) and allocation logic that monitors each TPUs demand for entries in the store queue. Demand is determined by subtracting an adjustable threshold value from the most recently assigned store identifier value. If the difference between the most recently assigned instruction identifier for a TPU and the TPU's threshold is non-zero, then it is determined that the TPU has demand for at least one entry in the store queue. The allocation logic includes arbitration logic that determines which one of a plurality of TPUs with store queue demand should be allocated a free entry in the store queue.

REFERENCES:
patent: 6112019 (2000-08-01), Chamdani et al.
patent: 6481251 (2002-11-01), Meier et al.
patent: 6738896 (2004-05-01), Webb et al.

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

Flexible demand-based resource allocation for multiple... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Flexible demand-based resource allocation for multiple..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Flexible demand-based resource allocation for multiple... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3653142

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