Event Scheduling

• Data structure used in event scheduling — priority queue, with the following key operations:

  • enqueue - Insert a time-tagged event into the data structure so that the structure maintains its ordered sequence (also known as insert).
  • dequeue - Delete the event in the data structure that has the minimum time (also known as delete_min).
  • cancel - Cancel the event in the data structure with a specified time or event identification (also known as delete).

• implementations of priority queue:

  • list
  • tree
  • table

Previous slide

Next slide

Back to first slide

View graphic version