SCHEDULING AND EXECUTION OF TASKS

• US 20150286504A1
• Filed: 06/17/2015
• Published: 10/08/2015
• Est. Priority Date: 01/10/2014
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Cao, Zhao, Shi, Ju Wei, Wang, Chen, Wang, Lan Jun, Wang, Yu, Zou, Jia
• Granted Patent: US 9,501,318 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 9/4843 by program, e.g. task dispatcher, supervisor, operating system
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals
• CPC Class Codes: G06F 9/5061 Partitioning or combining of resources

Abstract

An apparatus for scheduling includes a receiving unit, configured to receive a task of a job; a configuration unit, configured to configure resource amounts for the task in at least two resource dimensions respectively, wherein each of the resource dimensions represents a resource available for configuring; and an interface unit, configured to distribute the task along with information about the resource amounts configured for the task in the resource dimensions.

Claims

1. A method of scheduling, comprising:

receiving a task of job;

configuring resource amounts for the task in at least two resource dimensions respectively, wherein each of the resource dimensions represents a resource available for configuring; and

distributing the task along with information about the resource amounts configured for the task in the resource dimensions.

2. The method according to claim 1, further comprising:

estimating the resources amounts to be consumed by the task in the at least two resource dimensions;

wherein configuring resource amounts for the task in at least two resource dimensions respectively comprises configuring the resource amounts for the task in at least two resource dimensions respectively according to result of the estimating.

3. The method according to claim 2, wherein estimating the resources amounts to be consumed by the task in the at least two resource dimensions comprises:

estimating the resources amounts to be consumed by the task in the at least two resource dimensions according to historical information.

4. The method according to claim 2, wherein estimating the resources amounts to be consumed by the task in the at least two resource dimensions comprises:

estimating the resources amounts to be consumed by the task in the at least two resource dimensions according to sampled information.

5. The method according to claims 1, further comprising:

selecting tasks respectively from a plurality of jobs as candidate tasks to be distributed.

6. The method according to claim 5, further comprising:

generating a scheme for distributing the candidate tasks according to the resource amounts configured for each of the candidate tasks in the resource dimensions.

7. The method according to claim 6, further comprising:

estimating a gain of a scheme assumed to be generated after a predetermined lag with respect to a scheme currently generated, and not generating a scheme until the predetermined lag elapses in the case that the gain estimated is superior to the cost of the predetermined lag.

8. The method according to claim 1, wherein the method of scheduling is included in a Map process of a MapReduce process.

9. The method according to claim 1, wherein the method of scheduling is included in a Reduce process of a MapReduce process.

10. A method for execution, comprising:

receiving a task along with information about resource amounts configured for the task in at least two resource dimensions respectively;

assigning resources to the task in the at least two resource dimensions according to the information respectively; and

executing the task by using the assigned resources.