Uploaded image for project: 'Flink'
  1. Flink
  2. FLINK-24898 Some further improvements of sort-shuffle
  3. FLINK-25960

Distribute the data read buffers more fairly among result partitions for sort-shuffle

    XMLWordPrintableJSON

Details

    Description

      Currently, the data read buffers for sort-shuffle are allocated in a random way and some result partitions may occupy too many buffers which leads to the starvation of other result partitions. This ticket aims to improve the scenario by not reading data for those result partitions which already occupy more than the average number of read buffers per result partition.

      Attachments

        Issue Links

          Activity

            People

              kevin.cyj Yingjie Cao
              kevin.cyj Yingjie Cao
              Votes:
              0 Vote for this issue
              Watchers:
              3 Start watching this issue

              Dates

                Created:
                Updated:
                Resolved: