A.2.6. Concurrency/Locking Notes

The underlying store must provide for some way to allow a node to uniquely claim a task, e.g. optimistic concurrency to check that the "claim" update succeeded rather than conflicted with another node already claiming the task.

There is no guaranteed ordering amongst the distributed tasks; they can happen in any order and concurrently.