Hi folks. I wander how O(1) sheduling works in ULE. In ule.pdf Jeff wrote: Threads are picked from the current queue in priority order until the current queue is empty. As far as I understand the algorithm is O(n) where n - number of READY TO RUN processes, not all processes isn't it? thanks, Andriy.