Dynamic allocation of queue space using counters

• US 5,881,316 A
• Filed: 11/12/1996
• Issued: 03/09/1999
• Est. Priority Date: 11/12/1996
• Status: Expired due to Term

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett-Packard Company (HP Inc.)
• Inventors: Ruff, Michael T., Chaney, Kenneth
• Primary Examiner(s): Ray, Gopal C.
• Application Number:
  US08/748,226
• Time in Patent Office: 847 Days
• Field of Search: 395/876, 395/877, 395/873, 395/849, 395/200.56, 395/872, 395/200.3, 395/200.62, 370/229, 370/413, 370/463, 370/412-418, 370/429
• US Class Current: 710/56
• CPC Class Codes: G06F 9/5016 the resource being the memory

Abstract

The space of a buffer is logically partitioned into space reserved for requests only, space reserved for responses only, and space that can be used for either requests or responses, i.e., dynamically usable as needed by the system. An arbiter uses three registers to keep track of the request buffer space, the response buffer space and the dynamic space. The arbiter compares each of the registers with a corresponding limit to determine if a request packet or a response packet should be sent to the buffer. The limits are set by software and define the maximum number of request products, response packets, and total number of packets the buffer can hold. For example, the limit may be set to eight requests, eight responses and ten total. Thus two spaces are reserved for requests and two spaces are reserved for responses, and six are dynamically usable.

Claims

1. A computer system having a processor that creates request packets to access memory and creates response packets that satisfy queries made by the system, the system comprising:

a dynamically allocable buffer space for storing and routing the request packets and the response packets; and

an arbiter for receiving the request packets and the response packets from the processor, and for making determinations whether to send the request packets and the response packets to the buffer space;

wherein said determinations are made in part, under control of;

a request counter that stores a number value representing a total number of request packets currently stored in the buffer space;

a response counter that stores a number value representing a total number of response packets currently stored in the buffer space;

a total counter that stores a number value representing a total number of both request packets and response packets currently stored in the buffer space;

a request limit value representing a maximum number of request packets that is capable of being stored in the buffer space;

a response limit value representing a maximum number of response packets that is capable of being stored in the buffer space; and

a total limit value representing a maximum number of both request packets and response packets that is capable of being stored in the buffer space.

2. The computer system of claim 1, wherein:

the request limit, the response limit, and the total limit are alterable by software commands.

3. The computer system of claim 2, wherein:

the request limit, the response limit, and the total limit are each stored in a respective register.

4. The computer system of claim 1, wherein:

the arbiter compares the request limit with the request counter and compares the total limit with the total counter to determine whether to send the request packet to the buffer space;

if the request limit is greater than the request counter, and if the total limit is greater than the total counter, then the arbiter will send the request packet and increment both the request counter and the total counter;

if the request limit is not greater than the request counter, then the arbiter compares the response limit with the response counter and compares the total limit with the total counter to determine whether to send the response packet to the buffer space; and

if the total limit is not greater than the total counter, then the arbiter will send neither the request packet nor the response packet until the total limit is greater than the total counter.

5. The computer system of claim 4, wherein:

the buffer space transmits the request packet to a location in the system after receiving the request packet from the arbiter, and then relays transmission information to the arbiter; and

the arbiter receives the transmission information and decrements the request counter and the total counter.

6. The computer system of claim 1, wherein:

the arbiter compares the request limit with the request counter and compares the total limit with the total counter to determine whether to send the request packet to the buffer space;

if the request limit is greater than the request counter, and if the total limit is greater than the total counter, then the arbiter will send the request packet and increment both the request counter and the total counter;

if the request limit is not greater than the request counter, then the arbiter will not send the request packet; and

if the total limit is not greater than the total counter, then the arbiter will not send the request packet.

7. The computer system of claim 6, wherein:

the buffer space transmits the request packet to a location in the system after receiving the request packet from the arbiter, and then relays transmission information to the arbiter; and

the arbiter receives the transmission information and decrements the request counter and the total counter.

8. The computer system of claim 1, wherein:

the arbiter compares the response limit with the response counter and compares the total limit with the total counter to determine whether to send the response packet to the buffer space;

if the response limit is greater than the response counter, and if the total limit is greater than the total counter, then the arbiter will send the response packet and increment both the response counter and the total counter;

if the response limit is not greater than the response counter, then the arbiter compares the request limit with the request counter and compares the total limit with the total counter to determine whether to send the request packet to the buffer space; and

if the total limit is not greater than the total counter, then the arbiter will send neither the request packet nor the response packet until the total limit is greater than the total counter.

9. The computer system of claim 8, wherein:

the buffer space transmits the response packet to a location in the system after receiving the response packet from the arbiter, and then relays transmission information to the arbiter; and

the arbiter receives the transmission information and decrements the response counter and the total counter.

10. The computer system of claim 1, wherein:

the arbiter compares the response limit with the response counter and compares the total limit with the total counter to determine whether to send the response packet to the buffer space;

if the response limit is greater than the response counter, and if the total limit is greater than the total counter, then the arbiter will send the response packet and increment both the response counter and the total counter;

if the response limit is not greater than the response counter, then the arbiter will not send the response packet; and

if the total limit is not greater than the total counter, then the arbiter will not send the response packet.

11. The computer system of claim 10, wherein:

the buffer space transmits the response packet to a location in the system after receiving the response packet from the arbiter, and then relays transmission information to the arbiter; and

the arbiter receives the transmission information and decrements the response counter and the total counter.

12. The computer system of claim 1, wherein:

the request limit is 8;

the response limit is 8; and

the total limit is 10.

13. The computer system of claim 1, wherein:

a reserved request space of the buffer space is equal to the total limit minus the response limit;

a reserved response space of the buffer space is equal to the total limit minus the request limit; and

a dynamically allocable space of the buffer space is equal to the request limit plus the response limit minus the total limit.

14. The computer system of claim 13, wherein:

the request limit is 8;

the response limit is 8;

the total limit is 10;

the reserved request space is 2;

the reserved response space is 2; and

the dynamically allocable space is 6.

15. The computer system of claim 13, wherein:

the request limit is 9;

the response limit is 10;

the total limit is 10;

the reserved request space is 0;

the reserved response space is 1; and

the dynamically allocable space is 9.

16. The computer system of claim 13, wherein:

the request limit is 7;

the response limit is 7;

the total limit is 10;

the reserved request space is 3;

the reserved response space is 3; and

the dynamically allocable space is 4.

17. A multi-processor computer system having a dynamically allocable buffer space for handling request packets and response packets, the computer system comprising a plurality of nodes interconnected by a plurality of SCI rings, a node of the plurality of nodes comprising:

at least one processor that creates request packets to access memory and creates response packets that satisfy queries made by the system;

a memory for storing data;

at least one processor agent for dispatching packets, and comprising;

an arbiter that receives the request packets and the response packets from the processor and makes determinations whether to send the request packets and the response packets to the buffer space;

at least one memory agent for controlling access to the memory, that receives the packet from the processor agent and determines a target location for that packet; and

at least one crossbar for routing the response packets and the request packets between the processor agent and the memory agent, and comprises the buffer space; and

wherein when the memory agent determines that the target location is within the node, then the memory agent delivers the packet to the location; and

when the memory agent determines that the target location is located on a remote node, then the memory agent forwards the packet to the SCI controller, the SCI controller sends the packet to the remote node through the SCI ring, comprising;

a request counter that stores a number value representing a total number of request packets currently stored in the buffer space;

a response counter that stores a number value representing a total number of response packets currently stored in the buffer space;

a total counter that stores a number value representing a total number of both request packets and response packets currently stored in the buffer space;

a request limit is a number value representing a maximum number of request packets that is capable of being stored in the buffer space;

a response limit is a number value representing a maximum number of response packets that is capable of being stored in the buffer space; and

a total limit is a number value representing a maximum number of both request packets and response packets that is capable of being stored in the buffer space.

18. The computer system of claim 17, wherein:

the request limit, the response limit, and the total limit are alterable by software commands.

19. The computer system of claim 17, wherein:

the arbiter compares the request limit with the request counter and compares the total limit with the total counter to determine whether to send the request packet to the buffer space;

if the request limit is greater than the request counter, and if the total limit is greater than the total counter, then the arbiter will send the request packet and increment both the request counter and the total counter;

if the request limit is not greater than the request counter, then the arbiter compares the response limit with the response counter and compares the total limit with the total counter to determine whether to send the response packet to the buffer space; and

if the total limit is not greater than the total counter, then the arbiter will send neither the request packet nor the response packet until the total limit is greater than the total counter.

20. The computer system of claim 19, wherein:

the buffer space transmits the request packet to a location in the system after receiving the request packet from the arbiter, and then relays transmission information to the arbiter; and

the arbiter receives the transmission information and decrements the request counter and the total counter.

21. The computer system of claim 17, wherein:

the arbiter compares the response limit with the response counter and compares the total limit with the total counter to determine whether to send the response packet to the buffer space;

if the response limit is greater than the response counter, and if the total limit is greater than the total counter, then the arbiter will send the response packet and increment both the response counter and the total counter;

if the response limit is not greater than the response counter, then the arbiter compares the request limit with the request counter and compares the total limit with the total counter to determine whether to send the request packet to the buffer space; and

if the total limit is not greater than the total counter, then the arbiter will send neither the request packet nor the response packet until the total limit is greater than the total counter.

22. The computer system of claim 21, wherein:

the buffer space transmits the response packet to a location in the system after receiving the response packet from the arbiter, and then relays transmission information to the arbiter; and

the arbiter receives the transmission information and decrements the response counter and the total counter.

23. The computer system of claim 17, wherein:

a reserved request space of the buffer space is equal to the total limit minus the response limit;

a reserved response space of the buffer space is equal to the total limit minus the request limit; and

a dynamically allocable space of the buffer space is equal to the request limit plus the response limit minus the total limit.

24. The computer system of claim 23, wherein:

the request limit is 8;

the response limit is 8;

the total limit is 10;

the reserved request space is 2;

the reserved response space is 2; and

the dynamically allocable space is 6.

25. The computer system of claim 23, wherein:

the request limit is 9;

the response limit is 10;

the total limit is 10;

the reserved request space is 0;

the reserved response space is 1; and

the dynamically allocable space is 9.

26. A method for dynamically allocating buffer space in a computer system, the method comprising the steps of:

accepting request packets to access a memory;

accepting response packets that satisfy queries made by the system;

determining whether to send the request packets and the response packets to the buffer space;

dynamically allocating the buffer space so as to accommodate a maximum number of both request packets and response packets;

storing the request packets and the response packets in the buffer space;

storing a request count representing a total number of request packets currently stored in the buffer space;

storing a response count representing a total number of response packets currently stored in the buffer space;

storing a total count representing a total number of both request packets and response packets currently stored in the buffer space;

storing a request limit representing a maximum number of request packets that is capable of being stored in the buffer space;

storing a response limit representing a maximum number of response packets that is capable of being stored in the buffer space; and

storing a total limit representing a maximum number of both request packets and response packets that is capable of being stored in the buffer space.

27. The method of claim 26, further comprising the step of:

sending the request packets to a location in the system.

28. The method of claim 26, further comprising the step of:

altering the request limit, the response limit, and the total limit, to re-configure the system.

29. The method of claim 26, wherein the step of determining whether to send the request packets and the response packets to the buffer space, further comprises the steps of:

determining whether to send the request packet to the buffer space, comprising the steps of;

comparing the request limit with the request count;

comparing the total limit with the total count;

sending the request packet to the buffer space if the request limit is greater than the request count, and if the total limit is greater than the total count;

incrementing both the request count and the total count;

holding the request packet if the request limit is not greater than the request count; and

holding the request packet if the total limit is not greater than the total count.

30. The method of claim 29, further comprising the steps of:

transmitting the request packet out of the buffer space and to a location in the system; and

decrementing both the request count and the total count.

31. The method of claim 26, wherein the step of determining whether to send the request packets and the response packets to the buffer space, further comprises the steps of:

determining whether to send the response packet to the buffer space, comprising the steps of;

comparing the response limit with the response count;

comparing the total limit with the total count;

sending the response packet to the buffer space if the response limit is greater than the response count, and if the total limit is greater than the total count;

incrementing both the response count and the total count;

holding the response packet if the response limit is not greater than the response count; and

holding the response packet if the total limit is not greater than the total count.

32. The method of claim 31, further comprising the steps of:

transmitting the response packet out of the buffer space and to a location in the system; and

decrementing both the response count and the total count.