Google Inc.

Brian K Grant

John Wilkes

Matthew Nicholas Papakipos

Christopher G Demetriou

Walfredo Cirne

Morgan S McGuire

Todd Pu-Tse Wang

Joseph L Hellerstein

David P Bort

David Oppenheimer

Jason Hickey

Kai-Peter Backman

Todd Pu-tse Wang

Indranil Gupta

Nathan Daniel Tuck

Justin Santa Barbara

William Y Crutchfield

Martin Maly

Jan Civlin

Luc Mercier

Operations of a method include receiving a configuration request requesting configuration management of a base configuration package that describes infrastructure of an application. The operations include determining, for the base configuration package, a plurality of package functions. Each package function of the plurality of package functions extends functionality of the base configuration package. The operations include determining, for the base configuration package and the plurality of package functions, a change-proposal function. The change-proposal function proposes one or more of the plurality of package functions to extend the functionality of the base configuration package. The operations include transmitting, to a user device, the change-proposal function and receiving, from the user device, approval of the change-proposal function. In response to receiving approval of the change-proposal function, the operations include configuring the base configuration package using the one or more of the plurality of package functions proposed by the change-proposal function.

Change-proposal functions in configuration management systems

In a computing resource environment including at least one resource capable of being allocated to at least one of a plurality of tasks, techniques are disclosed for applying a taint to a resource in a computing resource environment, the taint being configured to prevent the resource from being claimed for a resource request without a toleration to that taint. Variations include receiving, at a resource scheduler in the resource environment, a request to allocate the resource to perform a particular task and determining whether the resource is subject to a taint. If the resource is subject to a taint, analyzing the request to determine if it includes a toleration for the taint. If the request includes a toleration for the taint, allocating the resource to the task. If the request does not include a toleration for the taint, not allocating the resource due to the taint.

Resource tolerations and taints

In a computing resource environment including at least two different resource name spaces, a method for generating a fully-qualified name for a resource based on a context-based name of that resource and a usage context is disclosed. Method steps include receiving the resource's name schema, its context-based name, and usage context; comparing an entry in the schema and an entry in the context-based name and identifying schema monikers missing from the context-based name. For a missing moniker, determining whether it is an attribute space (aspace) moniker. If it is an aspace moniker, adding it to a full name that includes the context-based name. If it is not an aspace moniker, determining the aspace associated with the missing moniker; searching the usage context for an association between the missing moniker, its aspace, and a value assigned to the missing moniker; and appending the searched-for items to the full name.

Omega names: name generation and derivation utilizing nested three or more attributes

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 system and method with the following features is disclosed: receiving a partial name of a resource having an attribute moniker and attribute value; receiving a context associated with an attribute space moniker, an attribute moniker and an attribute value; receiving a schema associated with a set that includes an attribute space moniker and an attribute moniker; identifying a missing moniker that is present in the set but not the partial name; adding a missing moniker that is an attribute space moniker to the partial name; when a missing moniker is not an attribute space moniker, identifying a context where the attribute moniker is associated with the missing moniker and an attribute space moniker is present in the partial name or set; adding the context's attribute moniker and attribute value to the partial name; and returning the partial name with the added monikers and attribute values as the full name.

Resource name generation and derivation utilizing attribute space monikers and their associated context

A system is provided that includes a memory and one or more processors in communication with the memory. The one or more processors are configured to identify a set of targets and select a first value corresponding to a number of targets from the set of targets that can be concurrently disrupted. A second value is determined that is related to a number of disruptions actually occurring. A disruption request is received for a target of the set of targets. Thereafter, the first value is compared to the second value. Based on the comparison of the first and second values, it is determined whether to resist a requested disruption. If it is determined that the disruption is to be resisted, the requested disruption is resisted. If it is determined that the disruption is not to be resisted, at least one of the first value and the second value are adjusted.

Disruption counters

A method of verifying the validity of a fully-qualified resource name within an environment including at least two different resource name spaces. The method includes receiving a fully qualified resource name having two or more tokens; and reading a token from the name. If the token represents the start of a name space, adding the name space onto a stack; and reading another token from the name. If read token doesn't represent the start of a name space, determining if it represents an end of the name space. If it does represent the end of the name space, popping the top of the stack as the subsequent token from the name. If it doesn't represent the start or end of the name space, checking if the token is a valid moniker for the name space. If it is valid, reading another token from the name, and otherwise returning an error.

Omega names: name generation and derivation

A system for executing tasks in a computing resource environment is disclosed. Variations of a system may include two or more scheduler partitions associated with respective schedulers, scheduler state information, and respective plurality of computing resources. Variations of a system may include a task distributor that distributes tasks to the scheduler partitions. In some variations, one scheduler is configured such that, responsive to the scheduler partition receiving a task from the distributor, that scheduler allocates a computing resource for execution of that task and updates its scheduler state information accordingly. In some variations, the task distributor is configured such that, if one scheduler is in a failed or corrupted state, the task distributor stops distributing tasks to that scheduler partition and prevents that scheduler state information from propagation to, or access by, other scheduler partitions.

Growing community of inventors

Cupertino, CA, United States of America

Brian K Grant