Queue Data Structure
A queue is a basic data structure in computer science that is affected by big data. It works according to the principle of ‘first in first out (fifo). That means that new elements are inserted at the tail of this data structure while elements are removed from the head of it. Depending on the number of elements in a large data set each element will stay for a very long time in such a data structure. Since it is an ordered list of elements it is not trivial to parallelize this data structure for big data. Also the insertion and removal can occur concurrently that is somewhat different to other data structures such as stacks. In other words one can remove an element from the head while at the same time inserting another item at the tail.
Applications
Applications of this basic data structure can be found significantly often. One application example in the context of big data are scheduling queues. These enable different end users of large computing systems to use computing systems in a fair manner. End users submit their computing job to a queue and depending on the scheduling policy will see their job soon on the computing system. But the job is queued while jobs of other end users are processed or when there are not enough free processors in the computing system at the moment. In other words the computing job of the end user was inserted in the tail and is within the scheduling queue until the scheduler is removing the job from the head. Removing means to take the computing job out of the queue and place it on free processors in order to start the processing.
More Information about a Queue
Please check the following video about this topic:
Follow us on Facebook:
