METHOD AND MEANS FOR CO-SCHEDULING JOB ASSIGNMENTS AND DATA REPLICATION IN WIDE-AREA DISTRIBUTED SYSTEMS

• US 20080049254A1
• Filed: 08/24/2006
• Published: 02/28/2008
• Est. Priority Date: 08/24/2006
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Phan, Thomas, Sion, Radu, Ranganathan, Kavitha
• Application Number:
  US11/466,778
• Publication Number:
  US 20080049254A1
• Time in Patent Office: Days
• US Class Current: 358/1.16
• CPC Class Codes: G06F 9/5033 considering data affinity
• CPC Class Codes: G06F 9/5038 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration scheduling strategies G06F9/4881 and subgroups
• CPC Class Codes: G06F 9/5072 Grid computing

Abstract

The embodiments of the invention provide a method, service, computer program product, etc. of co-scheduling job assignments and data replication in wide-area systems using a genetic method. A method begins by co-scheduling assignment of jobs and replication of data objects based on job ordering within a scheduler queue, job-to-compute node assignments, and object-to-local data store assignments. More specifically, the job ordering is determined according to an order in which the jobs are assigned from the scheduler to the compute nodes. Further, the job-to-compute node assignments are determined according to which of the jobs are assigned to which of the compute nodes; and, the object-to-local data store assignments are determined according to which of the data objects are replicated to which of the local data stores.

Claims

1. A method, comprising:

co-scheduling an assignment of jobs and a replication of data objects based on job ordering within a scheduler queue, job-to-compute node assignments, and object-to-local data store assignments;

assigning said jobs to compute nodes based on results of said co-scheduling; and

simultaneously replicating said data objects to local data stores based said results of said co-scheduling.

2. The method according to claim 1, further comprising determining said job ordering according to an order in which said jobs are assigned from said scheduler to said compute nodes.

3. The method according to claim 1, further comprising determining said job-to-compute node assignments according to which of said jobs are assigned to which of said compute nodes.

4. The method according to claim 1, further comprising determining said object-to-local data store assignments according to which of said data objects are replicated to which of said local data stores.

5. The method according to claim 1, wherein said co-scheduling comprises:

creating chromosomes comprising first strings, second strings, and third strings,

such that said first strings comprise possible arrays of said job ordering,

such that said second strings comprise possible arrays of said job-to-compute node assignments, and

such that said third strings comprise possible arrays of said object-to-local data store assignments.

6. The method according to claim 5, wherein said co-scheduling further comprises:

at least one of recombining and mutating said first strings, said second strings, and said third strings to create new arrays of said job ordering, said job-to-compute node assignments, and said object-to-local data store assignments.

7. The method according to claim 6, wherein said co-scheduling further comprises determining an execution time of at least one of said new arrays.

8. A method, comprising:

co-scheduling an assignment of jobs and a replication of data objects based on job ordering within a scheduler queue, job-to-compute node assignments, and object-to-local data store assignments, wherein said co-scheduling comprises;

creating chromosomes comprising first strings, second strings, and third strings,

such that said first strings comprise possible arrays of said job ordering,

such that said second strings comprise possible arrays of said job-to-compute node assignments, and

such that said third strings comprise possible arrays of said object-to-local data store assignments;

assigning said jobs to compute nodes based on results of said co-scheduling; and

simultaneously replicating said data objects to local data stores based said results of said co-scheduling.

9. The method according to claim 8, further comprising:

determining said job ordering according to an order in which said jobs are assigned from said scheduler to said compute nodes;

determining said job-to-compute node assignments according to which of said jobs are assigned to which of said compute nodes; and

determining said object-to-local data store assignments according to which of said data objects are replicated to which of said local data stores.

10. The method according to claim 8, wherein said co-scheduling further comprises:

at least one of recombining and mutating said first strings, said second strings, and said third strings to create new arrays of said job ordering, said job-to-compute node assignments, and said object-to-local data store assignments; and

determining an execution time of at least one of said new arrays.

11. A service, comprising:

co-scheduling an assignment of jobs and a replication of data objects based on job ordering within a scheduler queue, job-to-compute node assignments, and object-to-local data store assignments;

assigning said jobs to compute nodes based on results of said co-scheduling; and

simultaneously replicating said data objects to local data stores based said results of said co-scheduling.

12. The service according to claim 11, further comprising:

determining said job ordering according to an order in which said jobs are assigned from said scheduler to said compute nodes;

determining said job-to-compute node assignments according to which of said jobs are assigned to which of said compute nodes; and

determining said object-to-local data store assignments according to which of said data objects are replicated to which of said local data stores.

13. The service according to claim 11, wherein said co-scheduling comprises:

creating chromosomes comprising first strings, second strings, and third strings,

such that said first strings comprise possible arrays of said job ordering,

such that said second strings comprise possible arrays of said job-to-compute node assignments, and

such that said third strings comprise possible arrays of said object-to-local data store assignments.

14. The service according to claim 13, wherein said co-scheduling further comprises:

at least one of recombining and mutating said first strings, said second strings, and said third strings to create new arrays of said job ordering, said job-to-compute node assignments, and said object-to-local data store assignments.

15. The service according to claim 14, wherein said co-scheduling further comprises determining an execution time of at least one of said new arrays.

16. A computer program product comprising a computer usable medium tangibly embodying a computer readable program, wherein the computer readable program, when executed on a computer, causes the computer to perform a method comprising:

co-scheduling an assignment of jobs and a replication of data objects based on job ordering within a scheduler queue, job-to-compute node assignments, and object-to-local data store assignments;

assigning said jobs to compute nodes based on results of said co-scheduling; and

simultaneously replicating said data objects to local data stores based said results of said co-scheduling.

17. The computer program product according to claim 16, wherein said method further comprises:

determining said job ordering according to an order in which said jobs are assigned from said scheduler to said compute nodes;

determining said job-to-compute node assignments according to which of said jobs are assigned to which of said compute nodes; and

determining said object-to-local data store assignments according to which of said data objects are replicated to which of said local data stores.

18. The computer program product according to claim 16, wherein said co-scheduling comprises:

creating chromosomes comprising first strings, second strings, and third strings,

such that said first strings comprise possible arrays of said job ordering,

such that said second strings comprise possible arrays of said job-to-compute node assignments, and

such that said third strings comprise possible arrays of said object-to-local data store assignments.

19. The computer program product according to claim 18, wherein said co-scheduling further comprises:

at least one of recombining and mutating said first strings, said second strings, and said third strings to create new arrays of said job ordering, said job-to-compute node assignments, and said object-to-local data store assignments.

20. The computer program product according to claim 19, wherein said co-scheduling further comprises determining an execution time of at least one of said new arrays.