A non-deterministic drum scheduler reads a file of drum pages in unpredictable order because it selects, at each step, to read the first not previously read page after the reading heads. In this paper bounds are derived for the average latency time of such a scheduler when reading a file uniformly distributed over the drum circumference under the assumption that read requests are issued at uniformly and independently distributed points of the drum circumference.