Shared Queue

Effective implementation of many parallel algorithms requires a queue that is to be shared among

UEs. The most common situation is the need for a task queue in programs implementing the

Master/Worker pattern.

Generally, parallel algorithms require a queue shared among UEs. The big challenges for using this
pattern are load balancing, effective memory management and clarity of abstraction which can be
achieved by implementing shared queue as the instance of shared data pattern. 1 Thus, shared queue
pattern models queue data types implemented in such a way the

queues may be accessed concurrently. They queues have abstract data types (enque, deque).