Google Inc.

David Oppenheimer

John Wilkes

Walfredo Cirne

Joseph L Hellerstein

Cosmos Nicolaou

Brian K Grant

David P Bort

Todd Pu-Tse Wang

Kai-Peter Backman

Jason Hickey

Rafal Sokolowski

Monika H Henzinger

Robin A Radez

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.

Specifying behavior among a group of computing tasks

Techniques and systems are disclosed for allocating resources between two or more resource pools in a computing resource environment. Allocation may be realized by identifying a first resource in the first resource pool; creating a second resource based on at least a portion of the identified first resource; adding the created second resource to the second resource pool; identifying at least a portion of the added second resource as unused with respect to the second resource pool; creating a third resource based on the identified portion of the second resource; and adding the created third resource to a resource pool other than the second resource pool.

Omega resource model: returned-resources

Multiple scheduler verticals can allocate tasks to resources that are shared by the scheduler verticals. Information regarding a state of each resource may be stored in memory accessible by the multiple scheduler verticals, and a processor updates the information. The scheduler verticals schedule events to be performed by any of the resources, and submit updates to reflect the scheduled events in the information. In the event of conflicting events, an update corresponding to only one of the conflicting events is committed. Moreover, disruptions may be preplanned and scheduled so as to minimize impact on scheduled tasks.

Systems and methods for performing scheduling for a cluster

A computer-implemented method for assigning computing tasks to computers in a group is disclosed. The method includes determining, for each computer in a group of computers, an ability of the computer to execute tasks expected to be received by the group of computers; generating an ability indicator for each computer based on the ability determination for the computer; and assigning an incoming computing task to one of the computers using the ability indicator.

Scheduling in computer clusters

Growing community of inventors

San Francisco, CA, United States of America

David Oppenheimer