FIG. 9A and 9B are a flow diagram illustrating an example of a program using the PLO Compare and Swap and Double Store instruction to insert a new element in a queue, which is shown in FIG. 9C, in which the new element is maintained in priority order with the lowest priority number value closest to the head of the queue.