TLDR: Israeli Queues
Date: 2020-11-22 Source: https://arpitbhayani.me/blogs/israeli-queues
Overview
Explore Israeli Queues, a unique priority queue variation where elements join friends already waiting! Learn how they optimize batch processing. A queue is a data structure that holds up elements for a brief period of time until a peripheral processing system is ready to process them.
Key Points
- A queue is a data structure that holds up elements for a brief period of time until a peripheral processing system is ready to process them.
- How could this help?: Every Data Structures is designed to solve a niche use case efficiently and Israeli Queues are no different as they prove to be super-efficient where one could batch and process similar elements or where the set-up cost for a task is high.
- Issue of starvation: By enqueuing elements in between Israeli Queues reduces redundant processing, but by doing that it makes itself vulnerable to the classical case of starvation.