Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling
Reexamination Certificate
2011-04-12
2011-04-12
Ho, Andy (Department: 2194)
Electrical computers and digital processing systems: virtual mac
Task management or control
Process scheduling
Reexamination Certificate
active
07926057
ABSTRACT:
A facility is presented for scheduling computer jobs of a computing environment having a plurality of computing nodes. The facility includes scheduling N sequential computer jobs of a job queue until achieving a top job party, wherein N≧2, and the number of jobs in the top job party is dynamically determined by monitoring backfill window coverage of the computing nodes by the N scheduled jobs and automatically closing membership in the top job party once (i) all computing nodes are covered by at least one backfill window, or (ii) a backfill end time of at least one computing node is greater than or equal to a maximum wallclock limit of a set of job classes having the N scheduled jobs. Responsive to determining the top job party, the facility then backfill schedules jobs of the job queue around the top job party for execution.
REFERENCES:
patent: 5392430 (1995-02-01), Chen et al.
patent: 5671361 (1997-09-01), Brown et al.
patent: 6070144 (2000-05-01), Ginsberg et al.
patent: 6625646 (2003-09-01), Skovira
patent: 6694345 (2004-02-01), Brelsford et al.
patent: 6738893 (2004-05-01), Rozas
patent: 7076781 (2006-07-01), Skovira
patent: 2002/0194248 (2002-12-01), Wood et al.
patent: 2003/0135621 (2003-07-01), Romagnoli
patent: 2003/0149717 (2003-08-01), Heinzman
patent: 2004/0015973 (2004-01-01), Skovira
patent: 2004/0199918 (2004-10-01), Skovira
patent: 2005/0081208 (2005-04-01), Gargya et al.
patent: 2005/0235286 (2005-10-01), Ballew et al.
patent: 2007/0127527 (2007-06-01), Dan et al.
patent: 59180716 (1984-10-01), None
patent: 8305671 (1996-11-01), None
patent: 8315028 (1996-11-01), None
patent: 2002007143 (2002-01-01), None
patent: WO0029943 (2000-05-01), None
Jackson et al., Core Algorithms of the Maui Scheduler, 2001, pp. 1-16.
Mounie et al., Efficient Approximation Algorithms for Scheduling Malleable Tasks, 1999, pp. 1-10.
Zotkin et al., Attacking the Bottlenecks of Backfilling Schedulers, 2000, pp. 1-21.
Y. Zhang et al., “Improving Parallel Job Scheduling by Combining Gang Scheduling and Backfilling Techniques,” 14thInternational Parallel and Distributed Processing Symposium, IPDPS 2000, IEEE Computer Society Technical Committee on Parallel Processing, pp. 1-10 (May 1, 2000).
P. Jones et al., “Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization”, Job Scheduling Strategies for Parallel Processing, IPPS/SPDP'99 Workcshop, JSSPP'99 Proceedings, Lecture Notes in Computer Science, vol. 1659, (Apr. 16, 1999), Abstract Only.
Cynthia B. Lee, “Parallel Job Scheduling Algorithms and Interfaces”, Department of Computer Science & Engineering, University of California, San Diego (clbailey@uscd.edu), pp. 1-16 (May 13, 2004).
Chan Waiman
Skovira Joseph F.
Baca Matthew W.
Heslin Rothenberg Farley & & Mesiti P.C.
Ho Andy
International Business Machines - Corporation
Mudrick Timothy A
LandOfFree
Scheduling of computer jobs employing dynamically determined... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Scheduling of computer jobs employing dynamically determined..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling of computer jobs employing dynamically determined... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2738469