Method and apparatus for calendaring reminders
View Patent ↗An electronic calendar includes such features as recurring reminders, dividing unpredictable work loads into equal pieces, template free parsing, a reminders scheduling algorithm to reduce spikes, dynamic delivery and recovery algorithms, methods for splitting the work load between controllers and workers and for monitoring progress, all within the context of a calendar architecture for a large enterprise.
1. A reminders scheduling method for reducing spikes in delivery volume, comprising the steps of:
spreading a load of reminder deliveries across time without delivering said reminders too late or too early to satisfy a user's intent by weighing one or more factors in deciding when to schedule a reminder for delivery, where said factors comprise any of said user's intent and a destination device;
inferring said intent of said user by examining a lead time of said reminder, where lead time is a difference between a time an event occurs and a time for which a reminder for said event occurs; and
delivering said reminders according to one or more priorities determined from any of said user intent and said destination device.
2. The method of claim 1 , wherein the shorter a lead time for a reminder, the more accuracy is required for its delivery.
3. The method of claim 2 , further comprising the step of:
assigning each reminder to a priority class based on the lead time of said reminder;
wherein each priority class has a delivery window during which reminders of that class are delivered; and
wherein size of a window varies according to urgency of a priority class, measured backwards from an ideal delivery time.
4. The method of claim 1 , further comprising the step of:
clustering reminders into different priority classes based upon any of lead time and destination device.
5. The method of claim 1 , further comprising the steps of:
providing a dynamic priority queue; and
using a dynamic prioritization scheme to determine which reminders to deliver;
wherein reminders with similar delivery properties are grouped into units of work referred to as jobs.
6. The method of claim 5 , wherein jobs in said dynamic priority queue are prioritized by their delivery urgency as follows:
jobs that are not yet late are always preferred over jobs that are late;
for jobs that are not late, the closer to late they are, the more urgent they are;
for jobs that are already late, the less late a job is, the more urgent the job is; and
in the event of a tie, prefer a job with the smallest delivery window.
7. The method of claim 5 , further comprising the step of: delivering jobs which have less accurate delivery requirements earlier.