This IScheduler implementation is built using a revolving wheel of buckets with each bucket belonging to a specific time resolution. As the "clock" of the scheduler ticks it advances to the next bucket in the circle and processes the items in it, and optionally reschedules recurring tasks into the future into the next relevant bucket. There are `akka.scheduler.ticks-per-wheel` initial buckets (we round up to the nearest power of 2) with 512 being the initial default value. The timings are approximated and are still limited by the ceiling of the operating system's clock resolution. Further reading: http://www.cs.columbia.edu/~nahum/w6998/papers/sosp87-timing-wheels.pdf Presentation: http://www.cse.wustl.edu/~cdgill/courses/cs6874/TimingWheels.ppt

public class HashedWheelTimerScheduler : SchedulerBase, 
	IDateTimeOffsetNowTimeProvider, ITimeProvider, IDisposable

type HashedWheelTimerScheduler =  
    class
        inherit SchedulerBase
        interface IDateTimeOffsetNowTimeProvider
        interface ITimeProvider
        interface IDisposable
    end