Abstract: Methods and systems for generating common priority information for a plurality of requestors in a computing system that share a plurality of computing resources for use in a next cycle to arbitrate between the plurality of requestors, include generating, for each resource, priority information for the next cycle based on an arbitration scheme; generating, for each resource, relevant priority information for the next cycle based on the priority information for the next cycle for that resource, the relevant priority information for a resource being the priority information that relates to requestors that requested access to the resource in the current cycle and were not granted access to the resource in the current cycle; and combining the relevant priority information for the next cycle for each resource to generate the common priority information for the next cycle.

Abstract: Adder circuits and associated methods for processing a set of at least three floating-point numbers to be added together include identifying, from among the at least three numbers, at least two numbers that have the same sign—that is, at least two numbers that are both positive or both negative. The identified at least two numbers are added together using one or more same-sign floating-point adders. A same-sign floating-point adder comprises circuitry configured to add together floating-point numbers having the same sign and does not include circuitry configured to add together numbers having different signs.

Abstract: Adder circuits and associated methods for processing a set of at least three floating-point numbers to be added together include identifying, from among the at least three numbers, at least two numbers that have the same sign—that is, at least two numbers that are both positive or both negative. The identified at least two numbers are added together using one or more same-sign floating-point adders. A same-sign floating-point adder comprises circuitry configured to add together floating-point numbers having the same sign and does not include circuitry configured to add together numbers having different signs.

Abstract: Methods and arbiters for arbitrating between a plurality of ordered requestors and a shared resource based on priorities allocated to the requestors. The methods include determining whether there is at least one requestor that has requested access in the current cycle and has priority in the current cycle; in response to determining that there is at least one requestor that has requested access in the current cycle and has priority in the current cycle, selecting a lowest ordered requestor that has requested access in the current cycle and has priority in the current cycle; and in response to determining that there are no requestors that have requested access in the current cycle and have priority in the current cycle, selecting a highest ordered requestor that has requested access in the current cycle.

Abstract: Adder circuits and associated methods for processing a set of at least three floating-point numbers to be added together include identifying, from among the at least three numbers, at least two numbers that have the same sign—that is, at least two numbers that are both positive or both negative. The identified at least two numbers are added together using one or more same-sign floating-point adders. A same-sign floating-point adder comprises circuitry configured to add together floating-point numbers having the same sign and does not include circuitry configured to add together numbers having different signs.

Abstract: Adder circuits and associated methods for processing a set of at least three floating-point numbers to be added together include identifying, from among the at least three numbers, at least two numbers that have the same sign—that is, at least two numbers that are both positive or both negative. The identified at least two numbers are added together (608) using one or more same-sign floating-point adders (120, 220a, 320, 420). A same-sign floating-point adder comprises circuitry configured to add together floating-point numbers having the same sign and does not include circuitry configured to add together numbers having different signs.

Abstract: Methods and arbiters for arbitrating between a plurality of ordered requestors and a shared resource based on priorities allocated to the requestors. The methods include determining whether there is at least one requestor that has requested access in the current cycle and has priority in the current cycle; in response to determining that there is at least one requestor that has requested access in the current cycle and has priority in the current cycle, selecting a lowest ordered requestor that has requested access in the current cycle and has priority in the current cycle; and in response to determining that there are no requestors that have requested access in the current cycle and have priority in the current cycle, selecting a highest ordered requestor that has requested access in the current cycle.

Abstract: Adder circuits and associated methods for processing a set of at least three floating-point numbers to be added together include identifying, from among the at least three numbers, at least two numbers that have the same sign—that is, at least two numbers that are both positive or both negative. The identified at least two numbers are added together (608) using one or more same-sign floating-point adders (120, 220a, 320, 420). A same-sign floating-point adder comprises circuitry configured to add together floating-point numbers having the same sign and does not include circuitry configured to add together numbers having different signs.

Abstract: Methods and arbiter systems for arbitrating between a plurality of ordered requestors and a shared resource based on priorities allocated to the requestors include determining whether there is at least one requestor that has requested access in the current cycle and has priority in the current cycle. In response to determining that there is at least one requestor that has requested access in the current cycle and has priority in the current cycle, a lowest ordered requestor is selected that has requested access in the current cycle and has priority in the current cycle; and in response to determining that there are no requestors that have requested access in the current cycle and have priority in the current cycle, a highest ordered requestor is selected that has requested access in the current cycle.

Abstract: Methods and systems for generating common priority information for a plurality of requestors in a computing system that share a plurality of computing resources for use in a next cycle to arbitrate between the plurality of requestors, include generating, for each resource, priority information for the next cycle based on an arbitration scheme; generating, for each resource, relevant priority information for the next cycle based on the priority information for the next cycle for that resource, the relevant priority information for a resource being the priority information that relates to requestors that requested access to the resource in the current cycle and were not granted access to the resource in the current cycle; and combining the relevant priority information for the next cycle for each resource to generate the common priority information for the next cycle.

Abstract: Methods and arbiter systems for arbitrating between a plurality of ordered requestors and a shared resource based on priorities allocated to the requestors include determining whether there is at least one requestor that has requested access in the current cycle and has priority in the current cycle. In response to determining that there is at least one requestor that has requested access in the current cycle and has priority in the current cycle, a lowest ordered requestor is selected that has requested access in the current cycle and has priority in the current cycle; and in response to determining that there are no requestors that have requested access in the current cycle and have priority in the current cycle, a highest ordered requestor is selected that has requested access in the current cycle.