Task scheduling method and system
First Claim
1. A task scheduling method, comprising:
- partitioning tasks provided for scheduling, the partitioning includingreceiving at least one task including at least one type of data for schedulable tasks from users, wherein the at least one type of data includes a preferred task implementation time or a geographic location associated with a corresponding task of the tasks;
formatting the task data in a compliant form for schedulers,reviewing the task data to determine a user-configurable scheduling criteria of at least one data element in the task data, androuting the task to a queue of a plurality of queues, each queue having a characteristic, based on the determined user-configurable scheduling criteria being consistent with the characteristic of the queue, wherein the characteristic of each queue includes a task implementation time and a task geographic location; and
scheduling the partitioned tasks, the scheduling includingretrieving the at least one task from the queue in response to a trigger,determining the characteristics of the queues and characteristics of the schedulers, wherein the schedulers include a first scheduler configured to implement a first scheduling algorithm and a second scheduler configured to implement a second scheduling algorithm different from the first scheduling algorithm, the characteristics of the schedulers including speed and precision of scheduling performance of a respective scheduling algorithm implemented by the scheduler, androuting the at least one task to the first scheduler based upon the queue characteristic being consistent with the, scheduler characteristic of the first scheduler.
1 Assignment
0 Petitions
Accused Products
Abstract
Provided is a method for scheduling activities. The method includes partitioning tasks provided for scheduling. The partitioning is accomplished by receiving at least one task including at least one data type. The data type is reviewed to determine at least one scheduling criteria and the task is routed to a queue based on the determined scheduling criteria. Each queue also has at least one queue characteristic. The method also includes scheduling the partitioned tasks. The scheduling is accomplished by retrieving the at least one task from the queue in response to a trigger. The retrieved task is routed to at least one scheduler. In a first instance the routing is based on the queue characteristic. In a second instance the routing is based on at least one scheduler characteristic. A scheduling system for performing this method is also provided.
-
Citations
25 Claims
-
1. A task scheduling method, comprising:
-
partitioning tasks provided for scheduling, the partitioning including receiving at least one task including at least one type of data for schedulable tasks from users, wherein the at least one type of data includes a preferred task implementation time or a geographic location associated with a corresponding task of the tasks; formatting the task data in a compliant form for schedulers, reviewing the task data to determine a user-configurable scheduling criteria of at least one data element in the task data, and routing the task to a queue of a plurality of queues, each queue having a characteristic, based on the determined user-configurable scheduling criteria being consistent with the characteristic of the queue, wherein the characteristic of each queue includes a task implementation time and a task geographic location; and scheduling the partitioned tasks, the scheduling including retrieving the at least one task from the queue in response to a trigger, determining the characteristics of the queues and characteristics of the schedulers, wherein the schedulers include a first scheduler configured to implement a first scheduling algorithm and a second scheduler configured to implement a second scheduling algorithm different from the first scheduling algorithm, the characteristics of the schedulers including speed and precision of scheduling performance of a respective scheduling algorithm implemented by the scheduler, and routing the at least one task to the first scheduler based upon the queue characteristic being consistent with the, scheduler characteristic of the first scheduler. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A task scheduling system for conserving one or more resources comprising:
-
a plurality of schedulers for scheduling utilization of the one or more resources, each scheduler having at least one characteristic, wherein the schedulers include a first scheduler configured to implement a first scheduling algorithm and a second scheduler configured to implement a second scheduling algorithm different from the first scheduling algorithm the characteristic of a respective scheduler including speed and precision of scheduling performance of a respective scheduling algorithm implemented by the scheduler; a task manager operable to accept task data for schedulable tasks from users, the task manager being configured to format the task data in a compliant form for the schedulers, wherein the task data includes a preferred task implementation time or a geographic location associated with a corresponding task of the tasks; a queue router operable to receive the tasks from the task manager, the queue router reviewing the task data to determine a user-configurable scheduling criteria of at least one data element in the task data; a plurality of queues, each queue having a characteristic and operable to receive a task of the tasks from the queue router, wherein the characteristic of each queue includes a task implementation time and a task geographic location, the queue router being configured to route the task to a respective queue based upon the determined user-configurable scheduling criteria being consistent with the characteristic of the queue; a schedule manager operable to determine the characteristics of the queues and characteristics of the schedulers, receive the task from one of the queues and provide the task to one of the schedulers based on the characteristic of the queue being consistent with the characteristic of the scheduler; and a trigger operable to trigger the schedule manager to retrieve the task from the queue. - View Dependent Claims (9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A non-transitory computer-readable medium on which is stored a computer program for scheduling tasks, the computer program comprising instructions which, when executed by a computer, perform the steps of:
-
partitioning tasks provided for scheduling, the partitioning including receiving at least one task including at least one type of data for scheduling tasks from users, wherein the at least one type of data includes a preferred task implementation time or a geographic location associated with a corresponding task of the tasks; formatting the task data in a compliant form for schedulers, reviewing the task data to determine a user-configurable scheduling criteria of at least one data element in the task data, and routing the task to a queue of a plurality of queues, each queue having a characteristic, based on the determined user-configurable scheduling criteria being consistent with the characteristic of the queue, wherein the characteristic of each queue includes a task implementation time and a task geographic location; and scheduling the partitioned tasks, the scheduling including retrieving the at least one task from the queue in response to a trigger, determining the characteristics of the queues and characteristics of the schedulers, wherein the schedulers include a first scheduler configured to implement a first scheduling algorithm and a second scheduler configured to implement a second scheduling algorithm different from the first scheduling algorithm, the characteristics of the schedulers including speed and precision of scheduling performance of a respective scheduling algorithm implemented by the scheduler, and routing the at least one task to the first scheduler based upon the queue characteristic being consistent with the, scheduler characteristic of the first scheduler. - View Dependent Claims (18, 19, 20, 21)
-
-
22. A computer system for scheduling activities comprising:
-
a processing unit; a memory storage device coupled to the processing unit; an input device coupled to the processing unit; and an output device coupled to the processing unit; the processing unit being operative to; partition tasks provided for scheduling, the partitioning including receive at least one task including at least one type of data for schedulable tasks from users, wherein the at least one type of data includes a preferred task implementation time or a geographic location associated with a corresponding task of the tasks; format the task data in a compliant form for schedulers, review the task data to determine a user-configurable scheduling criteria of at least one data element in the task data, and route the task to a queue of a plurality of queues, each queue having a characteristic, based on the determined user-configurable scheduling criteria being consistent with the characteristic of the queue, wherein the characteristic of each queue includes a task implementation time and a task geographic location; and schedule the partitioned tasks, the scheduling including retrieve the at least one task from the queue in response to a trigger, determine the characteristics of the queues and characteristics of the schedulers, wherein the schedulers include a first scheduler configured to implement a first scheduling algorithm and a second scheduler configured to implement a second scheduling algorithm different from the first scheduling algorithm, the characteristics of the schedulers including speed and precision of scheduling performance of a respective scheduling algorithm implemented by the scheduler, and route the at least one task to the first scheduler based upon the queue characteristic being consistent with the, scheduler characteristic of the first scheduler. - View Dependent Claims (23, 24, 25)
-
Specification