Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling
Reexamination Certificate
2005-05-13
2010-06-22
An, Meng-Ai (Department: 2195)
Electrical computers and digital processing systems: virtual mac
Task management or control
Process scheduling
C718S103000, C718S104000, C718S101000
Reexamination Certificate
active
07743378
ABSTRACT:
A method for scheduling computing jobs in a scheduling event includes calculating a static priority of each computing job ready for scheduling, and then selecting a first computing job having the highest static priority as compared to at least one other computing jobs ready for scheduling, the first computing job being associated with at least one required resource. Further, a subset of computing nodes able to satisfy the at least one required resource are identified, and predictions are made for each node of an earliest predicted completion time that the first computing job can be completed on each of those nodes, taking into account already scheduled jobs. Finally, execution of the first computing job is scheduled on the node having the earliest predicted completion time.
REFERENCES:
patent: 5894572 (1999-04-01), Martin
patent: 5995982 (1999-11-01), Mercer
patent: 6154769 (2000-11-01), Cherkasova et al.
patent: 6202080 (2001-03-01), Lu et al.
patent: 6370560 (2002-04-01), Robertazzi et al.
patent: 6430593 (2002-08-01), Lindsley
patent: 6480876 (2002-11-01), Rehg et al.
patent: 6539445 (2003-03-01), Krum
patent: 6584488 (2003-06-01), Brenner et al.
patent: 6986139 (2006-01-01), Kubo
patent: 7082606 (2006-07-01), Wood et al.
patent: 7159218 (2007-01-01), Abe et al.
patent: 7281004 (2007-10-01), Lightstone et al.
patent: 7448036 (2008-11-01), Brenner et al.
patent: 2002/0194248 (2002-12-01), Wood et al.
patent: 2003/0208521 (2003-11-01), Brenner et al.
patent: 2004/0215942 (2004-10-01), Hansen et al.
patent: 2005/0015766 (2005-01-01), Nash et al.
patent: 2005/0022187 (2005-01-01), Park
patent: 2005/0229184 (2005-10-01), Inoue et al.
patent: 2005/0234577 (2005-10-01), Loughran et al.
patent: 2007/0050603 (2007-03-01), Vorbach et al.
patent: 2008/0172667 (2008-07-01), Inoue et al.
Feitelson et al. “Theory and Practice in Parallel Job Scheduling”, Proceedings of the job scheduling strategies for parallel processing, 1997, pp. 1-34.
P. T. Bulhoes, C. Byun, R. Castrapel, O. Hassaine, “N1™ Grid Engine 6 Features and Capabilities”. 2004.
C. Ernemann, V. Hamscher, U. Schweigelshohn, R. Yahyapour, “On Advantages of Grid Computing for Parallel Job Scheduling”. In 2nd International Symposium on Cluster Computing and Grid, pp. 39-46, 2002.
J. Krallmann, U.Schweigelshohn, R. Yahyapour, “On the Design and Evaluation of Job Scheduling Algorithms”. In 5th Workshop on Job Scheduling Strategies for Parallel Processing, pp. 17-42, 1999.
D.G. Feitelson, L. Rudolph, U. Schweigelshohn, K.C. Sevick, P. Wong, “Theory and practice in Parallel Job Scheduling”. In Job Scheduling Strategies for Parallel Processing, pp. 1-34, 1997.
L. Markov; “Graph Optimization Algorithms for Sun Grid Engine”; 2ndGrid Engine Workshop; http://gridengine.sunsource.net/download/workshop22-24—09—03/SMI—LevMarkov—GraphOptimizationAlgorithms.pdf; pp. 18, Sep. 2003.
An Meng-Ai
Huaracha Willy W
Oracle America Inc.
Osha • Liang LLP
LandOfFree
Method and apparatus for multi-dimensional priority... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for multi-dimensional priority..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for multi-dimensional priority... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4169961