×

Method and apparatus for scheduling tasks

  • US 7,500,241 B1
  • Filed: 10/10/2003
  • Issued: 03/03/2009
  • Est. Priority Date: 10/10/2003
  • Status: Active Grant
First Claim
Patent Images

1. A computerized method for queuing tasks, comprising:

  • providing a first primary scheduler queue;

    selecting a non-zero threshold time for said first primary scheduler queue;

    providing a first secondary scheduler queue;

    selecting a threshold time for said first secondary scheduler queue, wherein said threshold time for said first secondary scheduler queue is greater than said threshold time for said first primary scheduler queue;

    receiving a first task;

    determining a scheduled time for said first task, wherein said scheduled time is a time interval;

    in response to said scheduled time for said first task not exceeding said threshold time for said first primary scheduler queue, placing said first task in said first primary scheduler queue;

    determining whether said scheduled time associated with said first task or a scheduled time associated with another task in said first primary scheduler queue has expired;

    in response to said scheduled time associated with said first task or said another task expiring, delivering said first task or said another task to a resource;

    receiving a second task;

    determining a scheduled time for said second task, wherein said scheduled time is a time interval;

    in response to said scheduled time for said second task exceeding said threshold time for said first primary scheduler queue, placing said second task in said first secondary scheduler queue;

    storing a record of a time to a next scheduled task stored in said first secondary scheduler queue;

    decrementing said scheduled time associated with each of said scheduled tasks stored in said first secondary scheduler queue;

    in response to said time to a next scheduled task stored in said first secondary scheduler queue being one of less than or equal to said threshold time for said first primary scheduler queue, scanning said first secondary scheduler queue for at least one task having a scheduled time at least one of less than said threshold time for said first primary scheduler queue and equal to said threshold time for said first primary scheduler queue; and

    moving said at least one task having a scheduled time at least one of less than said threshold time for said first primary scheduler queue and equal to said threshold time for said first primary scheduler queue from said first secondary scheduler queue to said first primary scheduler queue.

View all claims
  • 24 Assignments
Timeline View
Assignment View
    ×
    ×