Submitting operations to a shared resource based on busy-to-success ratios

A computer-readable non-transitory storage medium encoded with instructions, wherein the instructions when executed comprise:

• calculating a first busy-to-success ratio for a first partition of a plurality of partitions during a first time period;
• calculating an average busy-to-success ratio for the plurality of partitions that submitted a plurality of operations to a shared resource during the first time period;
• if the first busy-to-success ratio for the first partition is greater than the average busy-to-success ratio for the plurality of partitions and a difference between the first busy-to-success ratio for the first partition and the average busy-to-success ratio for the plurality of partitions is greater than a threshold amount, increasing a throttle amount for the first partition, wherein all the plurality of partitions have different throttle amounts;
• receiving a first operation from the first partition during a first time subdivision of a second time period, wherein the second time period is after the first time period;
• if a number of successful operations received from the first partition up to the receiving during the first time subdivision of the second time period is greater than the throttle amount for the first partition during the first time subdivision of the second time period, returning a busy indication to the first partition and refraining from submitting the first operation to the shared resource;
• and
• if a number of successful operations received from the first partition up to the receiving during the first time subdivision of the second time period is less than the throttle amount for the first partition during the first time subdivision of the second time period, submitting the first operation to the shared resource.

A computer system comprising:

• a processor;
• and
• memory communicatively coupled to the processor, wherein the memory is encoded with instructions, wherein the instructions when executed by the processor comprise
• calculating a first busy-to-success ratio for a first partition of a plurality of partitions during a first time period,
• calculating an average busy-to-success ratio for the plurality of partitions that submitted a plurality of operations to a shared resource during the first time period,
• if the first busy-to-success ratio for the first partition is greater than the average busy-to-success ratio for the plurality of partitions and a difference between the first busy-to-success ratio for the first partition and the average busy-to-success ratio for the plurality of partitions is greater than a threshold amount, increasing a throttle amount for the first partition, wherein all the plurality of partitions have different throttle amounts,
• receiving a first operation from the first partition during a first time subdivision of a second time period, wherein the second time period is after the first time period,
• if a number of successful operations received from the first partition up to the receiving during the first time subdivision of the second time period is greater than the throttle amount for the first partition during the first time subdivision of the second time period, returning a busy indication to the first partition and refraining from submitting the first operation to the shared resource,
• if a number of successful operations received from the first partition up to the receiving during the first time subdivision of the second time period is less than the throttle amount for the first partition during the first time subdivision of the second time period, submitting the first operation to the shared resource, and if the first partition did not submit any operation to the shared resource during the first time period, decreasing the throttle amount for the first partition.