Uploaded image for project: 'Flink'
  1. Flink
  2. FLINK-9423

Implement efficient deletes for heap based timer service

    XMLWordPrintableJSON

Details

    • Improvement
    • Status: Closed
    • Major
    • Resolution: Fixed
    • 1.5.0
    • 1.6.0
    • None
    • None

    Description

      The current data structures in the `HeapInternalTimerService` are not able to support efficient timer deletes, the complexity is currently O(n), where n is the number of registered timers.

       

      We can keep track of timer's positions in the priority queue and (in combination with the already existing set/map) have a more efficient algorithm for deletes.

      Attachments

        Issue Links

          Activity

            People

              srichter Stefan Richter
              srichter Stefan Richter
              Votes:
              0 Vote for this issue
              Watchers:
              6 Start watching this issue

              Dates

                Created:
                Updated:
                Resolved: