A circular queue is created with N Fixed Timer Entries associated with a
specific address pointer for each entry. An association is developed to
relate each fixed entry pointer to its just previous pointer and to its
just next occurring pointer. A selected transient New Timer Entry can be
inserted between any two selected adjacent Fixed Timer Entries without
need to sequence serially through the entire set of fixed entries.
