Edge case handling in system with dynamic flow control

1. An apparatus comprising:

at least one processing device comprising a processor coupled to a memory, the at least one processing device being configured:

to dynamically reduce a flow control window size of a storage system from a first size to a second size;

to determine that an indicated size of an entry in a flow control queue of the storage system is greater than the second size;

to modify the indicated size of the entry based at least in part on the determination that the indicated size of the entry is greater than the second size, the modification comprising setting the indicated size to be less than or equal to the second size.

2. The apparatus of claim 1 , wherein setting the indicated size to be less than or equal to the second size comprises:

removing the entry from the flow control queue based at least in part on the determination that the indicated size of the entry is greater than the second size; and

adding the removed entry back to the flow control queue with an indicated size that is equal to or less than the second size.

3. The apparatus of claim 1 , wherein the at least one processing device is further configured:

to obtain a maximum input-output size of the storage system; and

to determine that the second size is less than the maximum input-output size, wherein the determination that the indicated size of the entry in the flow control queue of the storage system is greater than the second size is based at least in part on the determination that the second size is less than the maximum input-output size.

4. The apparatus of claim 3 , wherein the at least one processor is further configured:

to determine whether or not a total size of a received input-output request is greater than the maximum IO size of the storage system; and

in response to determining that the total size of the received input-output request is greater than the maximum IO size of the storage system, to split the received IO request into a plurality of chunks that are equal to or less than the maximum IO size of the storage system, the entry in the flow control queue corresponding to one of the chunks.

5. The apparatus of claim 4 , wherein each chunk is processed by a separate thread of the at least one processing device.

6. The apparatus of claim 3 , wherein the first size is equal to or greater than the maximum input-output size.

7. The apparatus of claim 1 , wherein setting the indicated size to be less than or equal to the second size comprises setting the indicated size of the entry in the flow control queue to be less than an actual size of the entry.

8. A method comprising:

dynamically reducing a flow control window size of a storage system from a first size to a second size;

determining that an indicated size of an entry in a flow control queue of the storage system is greater than the second size;

modifying the indicated size of the entry based at least in part on the determination that the indicated size of the entry is greater than the second size, the modification comprising setting the indicated size to be less than or equal to the second size;

wherein the method is implemented by at least one processing device comprising a processor coupled to a memory.

9. The method of claim 8 , wherein setting the indicated size to be less than or equal to the second size comprises:

removing the entry from the flow control queue based at least in part on the determination that the indicated size of the entry is greater than the second size; and

adding the removed entry back to the flow control queue with an indicated size that is equal to or less than the second size.

10. The method of claim 8 , wherein the method further comprises:

obtaining a maximum input-output size of the storage system; and

determining that the second size is less than the maximum input-output size, wherein the determination that the indicated size of the entry in the flow control queue of the storage system is greater than the second size is based at least in part on the determination that the second size is less than the maximum input-output size.

11. The method of claim 10 , wherein the method further comprises:

determining whether or not a total size of a received input-output request is greater than the maximum IO size of the storage system; and

in response to determining that the total size of the received input-output request is greater than the maximum IO size of the storage system, splitting the received IO request into a plurality of chunks that are equal to or less than the maximum IO size of the storage system, the entry in the flow control queue corresponding to one of the chunks.

12. The method of claim 11 , wherein each chunk is processed by a separate thread of the at least one processing device.

13. The method of claim 10 , wherein the first size is equal to or greater than the maximum input-output size.

14. The method of claim 8 , wherein setting the indicated size to be less than or equal to the second size comprises setting the indicated size of the entry in the flow control queue to be less than an actual size of the entry.

15. A computer program product comprising a non-transitory processor-readable storage medium having stored therein program code of one or more software programs, wherein the program code when executed by at least one processing device causes the at least one processing device to:

to dynamically reduce a flow control window size of a storage system from a first size to a second size;

to determine that an indicated size of an entry in a flow control queue of the storage system is greater than the second size;

to modify the indicated size of the entry based at least in part on the determination that the indicated size of the entry is greater than the second size, the modification comprising setting the indicated size to be less than or equal to the second size.

16. The computer program product of claim 15 , wherein setting the indicated size to be less than or equal to the second size comprises:

removing the entry from the flow control queue based at least in part on the determination that the indicated size of the entry is greater than the second size; and

adding the removed entry back to the flow control queue with an indicated size that is equal to or less than the second size.

17. The computer program product of claim 15 , wherein the program code further causes the at least one processing device:

to obtain a maximum input-output size of the storage system; and

to determine that the second size is less than the maximum input-output size, wherein the determination that the indicated size of the entry in the flow control queue of the storage system is greater than the second size is based at least in part on the determination that the second size is less than the maximum input-output size.

18. The computer program product of claim 17 , wherein the program code further causes the at least one processing device:

to determine whether or not a total size of a received input-output request is greater than the maximum IO size of the storage system; and

in response to determining that the total size of the received input-output request is greater than the maximum IO size of the storage system, to split the received IO request into a plurality of chunks that are equal to or less than the maximum IO size of the storage system, the entry in the flow control queue corresponding to one of the chunks.

19. The computer program product of claim 17 , wherein the first size is equal to or greater than the maximum input-output size.

20. The computer program product of claim 15 , wherein setting the indicated size to be less than or equal to the second size comprises setting the indicated size of the entry in the flow control queue to be less than an actual size of the entry.