Is your feature request related to a problem or challenge?

Assume a scenario where SPM (SortPreservingMergeExec) polls from 3 partitions, each of them gives the same value for the order expression for a very long time. Currently, we poll from the same partition until a new value comes from the other partitions. Continuously polling the same partition gets all upstream operator buffers and channels grow. However, we can execute a round-robin fashioned polling mechanism for the tied partitions.

Describe the solution you'd like

Loser tree can re-order the tied values of partitions.

Describe alternatives you've considered

No response

Additional context

This is the PR resolving a similar problem in the initialization phase: #12230