Grid non-deterministic job scheduling

Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C718S104000, C718S105000, C709S201000, C709S203000, C709S223000, C709S226000

Reexamination Certificate

active

07441241

ABSTRACT:
The present invention is method for scheduling jobs in a grid computing environment without having to monitor the state of the resource on the gird comprising a Global Scheduling Program (GSP) and a Local Scheduling Program (LSP). The GSP receives jobs submitted to the grid and distributes the job to the closest resource. The resource then runs the LSP to determine if the resource can execute the job under the conditions specified in the job. The LSP either rejects or accepts the job based on the current state of the resource properties and informs the GSP of the acceptance or rejection. If the job is rejected, the GSP randomly selects another resource to send the job to using a resource table. The resource table contains the state-independent properties of every resource on the grid.

REFERENCES:
patent: 5093794 (1992-03-01), Howie et al.
patent: 5524077 (1996-06-01), Faaland et al.
patent: 6014760 (2000-01-01), Silva et al.
patent: 6035278 (2000-03-01), Mansour
patent: 6101508 (2000-08-01), Wolff
patent: 6128642 (2000-10-01), Doraswamy et al.
patent: 6289296 (2001-09-01), Umeno
patent: 6381586 (2002-04-01), Glasserman et al.
patent: 6480470 (2002-11-01), Breivik
patent: 6502062 (2002-12-01), Acharya et al.
patent: 6571391 (2003-05-01), Acharya et al.
patent: 6578005 (2003-06-01), Lesaint et al.
patent: 6775687 (2004-08-01), Binding et al.
patent: 6886035 (2005-04-01), Wolff
patent: 7010596 (2006-03-01), Bantz et al.
patent: 7293092 (2007-11-01), Sukegawa
patent: 7340522 (2008-03-01), Basu et al.
patent: 2003/0065774 (2003-04-01), Steiner et al.
patent: 2004/0215780 (2004-10-01), Kawato
patent: 2005/0071843 (2005-03-01), Guo et al.
patent: 2005/0081208 (2005-04-01), Gargya et al.
patent: 2005/0283782 (2005-12-01), Lu et al.
patent: 2007/0294696 (2007-12-01), Papakipos et al.
Zhang, “Schedulingalgorithm for Real-Time Applications in Grid Environment”, IEEE, 2002, pp. 1-6.
Ferreira et al., “Introduction to Grid Computing With Globus”, IBM Redbooks, 2002, pp. 1-310.
Walker, “A Framework for Effective Scheduling of Data-Parallel Applications in Grid Systems”, Thesis Document, University of Virginia, 2001, pp. 1-59.
Shan et al., “Job Superscheduler Architecture and Performance in Computational Grid Environments”, ACM, 2003, pp. 1-15.
Kidd et al., “Smartnet: A Scheduling Framework for Heterogenous Computing”, pp. 514-521.
Cao et al., “Agent-Based Grid Load Balancing Using Performance-Driven Task Scheduling”, IEEE, 2003, pp. 1-10.
Buyya et al., “Architecture Models for Resource Management in the Grid”, Grid 2000, pp. 18-35.
Buyya, “Economic-Based Distributed Resoruce Management and Scheduling for Grid Computing”, Doctor Philosophy, Monash University, 2002, Apges 1-180.
IBM Redbooks Paper, “Fundamentals of Grid Computing”, Berstis, Viktors, 2002.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Grid non-deterministic job scheduling does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Grid non-deterministic job scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Grid non-deterministic job scheduling will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3992602

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.