Electrical computers and digital processing systems: virtual mac – Task management or control
Reexamination Certificate
2005-10-18
2005-10-18
An, Meng-Al T. (Department: 2195)
Electrical computers and digital processing systems: virtual mac
Task management or control
C718S102000, C718S104000, C718S107000, C718S108000
Reexamination Certificate
active
06957431
ABSTRACT:
The present invention provides a method, system, and computer program product for improving scheduling of tasks in systems that accumulate execution time. An upper bound is computed on the amount of additional time each schedulable task in the system may continue to execute after exceeding its predetermined cost, without adversely affecting overall operation of the system (that is, ensuring that the continued execution will not cause invocations of subsequent tasks to fail to meet their execution deadlines). By allowing tasks to run longer, the potential that the task will successfully end is increased, thereby yielding a more efficient overall system. In the preferred embodiment, the extensions are iteratively computed as a fixed percentage of the cost of each task until reaching an amount of time where the system is no longer feasible. The extension values resulting from the iteration before the cost-extended system becomes infeasible are then used at run-time when a particular task encounters an overrun condition. This technique is advantageous in systems where execution of non-schedulable entities (such as occurrence of hardware interrupts) occurs during execution of one or more of the scheduled tasks.
REFERENCES:
patent: 5210872 (1993-05-01), Ferguson et al.
patent: 5325525 (1994-06-01), Shan et al.
patent: 5408663 (1995-04-01), Miller
patent: 5640563 (1997-06-01), Carmon
patent: 6117180 (2000-09-01), Dave et al.
patent: 6321133 (2001-11-01), Smirnov et al.
patent: 6430593 (2002-08-01), Lindsley
patent: 6463457 (2002-10-01), Armentrout et al.
patent: 6502062 (2002-12-01), Acharya et al.
patent: 6578005 (2003-06-01), Lesaint et al.
patent: 6601035 (2003-07-01), Panagos et al.
patent: 6687257 (2004-02-01), Balasubramanian
patent: 6711129 (2004-03-01), Bauer et al.
patent: 6721778 (2004-04-01), Smith et al.
patent: 2002/0002578 (2002-01-01), Yamashita
patent: 2002/0012332 (2002-01-01), Tiedemann et al.
patent: 2002/0110112 (2002-08-01), Tuomi
patent: 11184717 (1997-12-01), None
Bollella Gregory
Haggar Peter F.
Mickelson James A.
Wendt David M.
Doubet Marcia L.
Vo Lilian
LandOfFree
System for incrementally computing the maximum cost... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System for incrementally computing the maximum cost..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for incrementally computing the maximum cost... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3462584