System and method for in-order queue draining
AssigneeHewlett-Packard Development Company, L.P.
InventorChris Greer
Life of this patent
Estimating the term…
Abstract
Disclosed are systems and methods for determining time-outs with respect to a plurality of transactions comprising utilizing a first time-out clock for simultaneously determining time-out states with respect to a first set of transactions of the plurality of transactions, and determining when transactions of the first set of transactions have reached a timed-out state of the time-out states.
Claims22
A method for draining an in-order queue, said method comprising:
- implementing a first queue loop sequence with respect to a transaction phase of transactions stored in said in-order queue, said first queue loop sequence spoofing completion of said transaction phase for said transactions stored in said in-order queue for which said transaction phase has not been completed;
- and
- after completion of said first queue loop sequence, implementing a second queue loop sequence with respect to another transaction phase of said transactions stored in said in-order queue, said second queue loop sequence spoofing completion of said another transaction phase for said transactions stored in said in-order queue for which said another transaction phase has not been completed.
A system for draining an in-order queue, said system comprising:
- a state machine having a first drain state and a second drain state, wherein said state machine is operable to sequence a first transaction phase pointer associated with in-process transactions using said first drain state to spoof completion of a transaction phase for said transactions, and wherein said state machine is further operable to sequence a second transaction phase pointer associated with said in-process transactions using said second drain state to spoof completion of another transaction phase for said transactions.
A computer program product having a computer readable medium having computer program logic recorded thereon for draining an in-order queue, said computer program product comprising:
- code for implementing a first queue loop sequence with respect to a transaction phase of transactions stored in said in-order queue, said first queue loop sequence spoofing completion of said transaction phase for said transactions stored in said in-order queue for which said transaction phase has not been completed until a first transaction phase pointer reaches a predetermined value;
- and
- code for implementing a second queue loop sequence with respect to another transaction phase of said transactions stored in said in-order queue, said second queue loop sequence spoofing completion of said another transaction phase for said transactions stored in said in-order queue for which said another transaction phase has not been completed until a second transaction phase pointer reaches said predetermined value.
Dependencies are inferred from the claim text.