> In that scenario I employed an earliest-deadline-first scheduler... I did something that sounds similar with the skip locked technique for a request queueing

> In that scenario I employed an earliest-deadline-first scheduler... I did something that sounds similar with the skip locked technique for a request queueing system supporting conveyor routing in a DC. Priority alone wouldn't work because requests in different areas of the conveyor had different lead times until the response was required, sometimes 5 feet and sometimes 300 feet. If I made the shorter lead times all higher priority then they could all supersede an older request for longer sections that is now nearing the divert. So the requests get submitted with a deadline datetime, and that is the index used to select the next request (top 1, order by deadline), worked pretty well.