Good read. I don't think you were controversial :-) Spotted a wee typo about 1/2 way down: >> LRU works by evicting less commonly used data in preference of m

Good read. I don't think you were controversial :-) Spotted a wee typo about 1/2 way down: >> LRU works by evicting less commonly used data in preference of more frequently used data For this question: >> Does anyone know of recognized tools which solve this problem? BMC's Control-M product manages this fairly easily, although it is easy to let the workflow become unweildy with that product in my experience. AutoSys fairs a little better for this use case. Open source wise I guess you could use PBS or something of that ilk to replicate. I think though an ideal architecture for this problem wouldn't be what's currently available. I think a hot-hot message queue with deduplication would be a better approach. You can afford then to have multiple hosts submit an appropriately named job and the first node on the other side of the queue to successfully lease the message wins the right to run the task contained within. If it fails to complete the next node leases the task. It would require some consideration about ensuring integrity of the message and authentication requirements for publishers.