초록

Various methods and apparatuses to deactivating the mechanism to resolve instruction starvation if an agent which issued a first transaction does not reissue the first transaction within a predefined time period.

대표청구항 ▼

We claim: 1. A method, comprising: determining whether instruction starvation is occurring based upon detecting whether a first transaction from a first agent has not been accepted by a system resource; activating a mechanism to resolve instruction starvation if it is determined that instruction st

We claim: 1. A method, comprising: determining whether instruction starvation is occurring based upon detecting whether a first transaction from a first agent has not been accepted by a system resource; activating a mechanism to resolve instruction starvation if it is determined that instruction starvation is occurring; and deactivating the mechanism to resolve instruction starvation if an agent which issued the first transaction does not reissue the first transaction within a predefined time period. 2. The method of claim 1, wherein the agent does not reissue the first transaction because the first transaction was speculative or a circumstance exists to prevent the agent from reissuing the first transaction. 3. The method of claim 1, wherein the predefined time period comprises a threshold amount of retry responses sent to one or more agents. 4. The method of claim 3, wherein the threshold amount of retry responses comprises an adjustable number of retry responses that increases if the mechanism to resolve instruction starvation transitions from an activated state to a deactivated state. 5. The method of claim 1, wherein the predefined time period comprises a threshold amount of time. 6. The method of claim 1, further comprising: filtering out transaction types that do not trigger activation of the mechanism to resolve instruction starvation in a computing processing system. 7. The method of claim 1, further comprising: increasing a duration of the predefined time period if the mechanism to resolve instruction starvation transitions from an activated state to a deactivated state. 8. The method of claim 1, further comprising: deactivating the mechanism to resolve instruction starvation also if one or more logical conditions exist which if satisfied deactivate the mechanism to resolve instruction starvation. 9. The method of claim 8, wherein at least one of the one or more logical conditions comprises all of the retry counters being reset for all the agents attempting to use the system resource. 10. The method of claim 1, further comprising: receiving the first transaction from the first agent having a unique identifier; associating a retry response sent in response to the first transaction with the unique identifier of the first agent that issued the first transaction. 11. The method of claim 1, further comprising: after activating the mechanism to resolve instruction starvation, accepting exactly one transaction from each agent attempting to use the system resource until all of the agents attempting to use that system resource make forward progress on executing an instruction stream. 12. The method of claim 1, further comprising: determining that instruction starvation is occurring if an agent sending a transaction to the system resource exceeds its retry threshold and the system resource is ready to accept the transaction that tripped the retry threshold. 13. The method of claim 1, further comprising: after the first transaction has been accepted, initiating an acceptance of the first transaction and determining if conditions exist for the mechanism to resolve instruction starvation to veto the acceptance. 14. The method of claim 1, further comprising: after the first transaction has not been accepted, initiating a retry response for the first transaction and then determining if conditions exist to activate the mechanism to resolve instruction starvation. 15. A machine-readable medium that provides instructions, which when executed by a machine, cause the machine to perform operations comprising: determining whether instruction starvation is occurring based upon detecting whether a first transaction from a first agent has not been accepted by a system resource; activating a mechanism to resolve instruction starvation if it is determined that instruction starvation is occurring; and deactivating the mechanism to resolve instruction starvation if an agent which issued the first transaction does not reissue the first transaction within a predefined time period. 16. The article of manufacture of claim 15, further comprising instructions which, when executed by the machine, cause the machine to perform the further operations comprising: associating retry responses sent in response to the first transaction with the first agent that issued the first transaction. 17. The article of manufacture of claim 15, further comprising instructions which, when executed by the machine, cause the machine to perform the further operations comprising: after the first transaction has been accepted, initiating an acceptance of the first transaction and determining if conditions exist for the mechanism to resolve instruction starvation to veto the acceptance. 18. The article of manufacture of claim 15, further comprising instructions which, when executed by the machine, cause the machine to perform the further operations comprising: after activating the mechanism to resolve instruction starvation, accepting exactly one transaction from each agent attempting to use the system resource until all of the agents attempting to use that system resource make forward progress on executing an instruction stream. 19. The article of manufacture of claim 15, further comprising instructions which, when executed by the machine, cause the machine to perform the further operations comprising: determining that instruction starvation is occurring if an agent sending a transaction to the system resource exceeds its retry threshold and the system resource is ready to accept the transaction that tripped the retry threshold. 20. The article of manufacture of claim 15, wherein the predefined time period comprises a retry threshold limit equal to or greater than a preset number of consecutive retries. 21. An apparatus, comprising: means for determining whether instruction starvation is occurring based upon detecting whether a first transaction from a first agent has not been accepted by a system resource; means for resolving instruction starvation if it is determined that instruction starvation is occurring; and means for disengaging the mechanism to resolve instruction starvation if an agent which issued the first transaction does not reissue the first transaction within a predefined time period. 22. The apparatus of claim 21, further comprising: means for associating retry responses sent in response to the first transaction with the first agent that issued the first transaction. 23. The apparatus of claim 21, further comprising: means for after the first transaction has been accepted, initiating an acceptance of the first transaction and determining if conditions exist for the mechanism to resolve instruction starvation to veto the acceptance. 24. The apparatus of claim 21, further comprising: means for after activating the mechanism to resolve instruction starvation, accepting exactly one transaction from each agent attempting to use the system resource until all of the agents attempting to use that system resource make forward progress on executing an instruction stream. 25. The apparatus of claim 21, further comprising: means for determining that instruction starvation is occurring if an agent sending a transaction to the system resource exceeds its retry threshold and the system resource is ready to accept the transaction that tripped the retry threshold. 26. An apparatus, comprising: logic to determine whether instruction starvation is occurring and to resolve the instruction starvation if an agent that issued a first transaction does not reissue the first transaction within a predefined time period, wherein the logic comprises a state machine having an activated state and a deactivated state, the state machine to transition the activated state to resolve a detected instruction starvation condition by accepting exactly one transaction from each agent attempting to use the system resource until all of the agents attempting to use that system resource make forward progress on executing an instruction stream, the state machine to transition to the deactivated state if an agent which issued a first transaction does not reissue the first transaction after receiving a retry response within a predefined time period. 27. The apparatus of claim 26, wherein the logic comprises electronic circuits that follow the rules of Boolean Logic. 28. The apparatus of claim 26, wherein the logic to associate retry responses sent in response to the first transaction with the first agent that issued the first transaction. 29. The apparatus of claim 26, wherein the logic further comprises: one or more filters to filter out transaction that should not trigger activation of the mechanism to resolve instruction starvation. 30. The apparatus of claim 26, wherein the state machine deactivates the mechanism to resolve instruction starvation also if one or more logical conditions exist which if satisfied deactivate the mechanism to resolve instruction starvation. 31. The apparatus of claim 26, wherein the logic further comprises: a retry timeout counter to resolve instruction starvation if an agent which issued a first transaction does not reissue the first transaction after receiving a retry response within a predefined time period; and a variable timeout counter to increase the predefined period of time used by the retry timeout counter to trigger the mechanism to resolve instruction starvation to transition from the activated state to the deactivated state. 32. The apparatus of claim 26, wherein the logic further comprises: two or more retry counters to associate retry responses sent in response to a transaction with a corresponding agent that issued the transaction based upon the unique agent identifier associated with the transaction; and one or more comparators to determine if a given agent exceeds a retry threshold limit, a first retry counter to communicate to a first comparator the number of retry responses sent in response to a transaction with the corresponding agent that issued the transaction. 33. The apparatus of claim 26, wherein the agent comprises a thread. 34. A computer system, comprising: a bus; a plurality of agents sharing the bus; and a processor having logic to determine whether instruction starvation is occurring and to resolve the instruction starvation if an agent that issued a first transaction does not reissue the first transaction within a predefined time period, wherein the logic within the processor comprises a state machine having an activated state and a deactivated state, the state machine to transition the activated state to resolve a detected instruction starvation condition by accepting exactly one transaction from each agent attempting to use the system resource until all of the agents attempting to use that system resource make forward progress on executing an instruction stream, the state machine to transition to the deactivated state if the agent which issued the first transaction does not reissue the first transaction after receiving a retry response within the predefined time period. 35. The computer system of claim 34, wherein the predefined time period comprises a retry threshold limit equal to or greater than a preset number of consecutive retries. 36. The computer system of claim 34, wherein the logic further comprises: two or more retry counters to associate retry responses sent in response to a transaction with a corresponding agent that issued the transaction based upon the unique agent identifier associated with the transaction; and one or more comparators to determine if a given agent exceeds a retry threshold limit, a first retry counter to communicate to a first comparator the number of retry responses sent in response to a transaction with the corresponding agent that issued the transaction. 37. The computing system of claim 34, wherein the logic to also associate retry responses sent in response to a first transaction with a first agent that issued the first transaction based upon a unique agent identifier associated with the first agent.