Specifying behavior among a group of computing tasks

Patent metadata

Field	Value
Publication number	US-9727379-B1
Application number	US-201414252415-A
Country	US
Kind code	B1
Filing date	Apr 14, 2014
Priority date	Apr 14, 2014
Publication date	Aug 8, 2017
Grant date	Aug 8, 2017

Abstract

A method of specifying behavior among a group of computing tasks included in a request to be performed in a domain of computing resources is disclosed. Method steps include receiving, at a scheduler operably coupled to the domain, a p/f request, the received p/f request including a first group and a first relationship, the first group comprising at least a first p/f group element and a second p/f group element, the first relationship defining a desired behavior of the first and second p/f group elements with respect to each other during performance of the p/f request; determining whether the domain includes available computing resources capable of satisfying the first relationship; and in response to a determination that the domain includes available computing resources capable of satisfying the first relationship, allocating, with the scheduler, at least one available computing resource to fulfill the p/f request.

First claim

The invention claimed is:

1. A method of specifying behavior among a group of computing tasks included in a request to be performed in a domain of computing resources, the method comprising:
receiving, at a scheduler operably coupled to the domain, a p/f request, the received p/f request including a first group and a first relationship, the first group comprising at least a first p/f group element and a second p/f group element, the first relationship defining a desired behavior of the first and second p/f group elements with respect to each other during performance of the p/f request, the relationship comprising information about a measurement representing the desired behavior to be defined, a target value representing a quantitative target associated with the measurement, and a comparison that determines how the measurement relates to the target value;
determining whether the domain includes available computing resources capable of satisfying the first relationship; and
in response to a determination that the domain includes available computing resources capable of satisfying the first relationship, allocating, with the scheduler, at least one available computing resource to fulfill the p/f request;
wherein the first relationship further includes a time specification that specifies an effective duration of the first relationship.

2. The method of claim 1 , where first p/f group element is a first computing task and the second p/f group element is a second computing task.

3. The method of claim 1 , where the first p/f group element is a second p/f group, the second p/f group comprising at least one p/f group element.

4. The method of claim 1 , the target value comprising information about a mean value and information about a value range such that the first relationship defines an acceptable measurement value range that can satisfy the target value.

5. The method of claim 4 , where the value range is specified by a percentage.

6. The method of claim 1 , the target value including information about an expected compliance level such that the first relationship defines a desired fraction of measurements that satisfy the target value, the desired fraction being less than all measurements.

7. The method of claim 1 , the measurement being a measure of time to failure of any group element.

8. The method of claim 1 , the first relationship being a hard constraint and the determining step including determining whether the domain includes available computing resources to satisfy the first relationship for a predetermined time period such that in response to a determination that the domain does not include available computing resources to satisfy the first relationship for the predetermined time period, the scheduler does not allocate any resources to fulfill the p/f request.

9. The method of claim 1 , the p/f request including a second relationship, the second relationship defining a desired behavior of the first and second group elements with respect to each other during performance of the p/f request.

10. The method of claim 1 , the method further comprising receiving a second p/f request, the second p/f request including a second group and a second relationship, the second group comprising at least a third p/f group element and a fourth p/f group element, the second relationship defining a desired behavior of the third and fourth p/f group elements with respect to each other during performance of the second p/f request.

11. The method of claim 10 , where the third group element is the first group.

12. The method of claim 10 , where the first relationship relates to an expected performance of the first group and the second relationship relates to an expected availability of the second group.

13. The method of claim 12 , where the third p/f group element is the same as the first p/f group element and the fourth p/f group element is the same as the second p/f group element.

14. The method of claim 1 , the measurement being a measure of performance between group elements.

15. The method of claim 1 , the measurement being a measure of availability of the group elements.

16. A method of specifying behavior among a group of computing tasks included in a request to be performed in a domain of computing resources, the method comprising:
receiving, at a scheduler operably coupled to the domain, a p/f request, the received p/f request including a first group and a first relationship, the first group comprising at least a first p/f group element and a second p/f group element, the first relationship defining a desired behavior of the first and second p/f group elements with respect to each other during performance of the p/f request, the relationship comprising information about a measurement representing the desired behavior to be defined, a target value representing a quantitative target associated with the measurement, and a comparison that determines how the measurement relates to the target value;
determining whether the domain includes available computing resources capable of satisfying the first relationship; and
in response to a determination that the domain includes available computing resources capable of satisfying the first relationship, allocating, with the scheduler, at least one available computing resource to fulfill the p/f request;
wherein the measurement is a measure of round-trip latency for data exchange between group elements.

17. A method of specifying behavior among a group of computing tasks included in a request to be performed in a domain of computing resources, the method comprising:
receiving, at a scheduler operably coupled to the domain, a p/f request, the received p/f request including a first group and a first relationship, the first relationship being a soft constraint, the first group comprising at least a first p/f group element and a second p/f group element, the first relationship defining a desired behavior of the first and second p/f group elements with respect to each other during performance of the p/f request, the relationship comprising information about a measurement representing the desired behavior to be defined, a target value representing a quantitative target associated with the measurement, and a comparison that determines how the measurement relates to the target value;
determining whether the domain includes available computing resources capable of satisfying the first relationship; and
in response to a determination that the domain includes available computing resources capable of satisfying the first relationship, allocating, with the scheduler, at least one available computing resource to fulfill the p/f request;
wherein determining whether the domain includes available computing resources capable of satisfying the first relationship includes step including determining whether the domain includes any computing resources capable of completely satisfying the first relationship such that in response to a determination that the domain includes any computing resources capable of satisfying the first relationship, the scheduler allocates available resources to fulfill the p/f request and at least partially satisfy the first relationship.

Assignees

• Google Inc

Inventors

• Wilkes John
• Oppenheimer David
• Cirne Walfredo
• Nicolaou Cosmos

Classifications

• G06F9/5044

  considering hardware capabilities · CPC title

• G06F2209/506

  Constraint · CPC title

• G06F9/5005 Primary

  to service a request · CPC title

• G06F9/5055

  considering software capabilities, i.e. software resources associated or available to the machine · CPC title

• G06F9/5038 Primary

  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 title