Abstract: Methods, systems, and computer-readable media for a client-side filesystem for a remote repository are disclosed. One or more files of a repository are sent from a storage service to a client device. The file(s) are obtained by the client using a credential sent by a repository manager. Local copies of the file(s) are accessible via a local filesystem mounted at the client device. One or more new files associated with the repository are generated at the client device. Using the credential, the one or more new files are obtained at the storage service from the client device. The one or more new files are added to the repository.

Abstract: Distributed system resources may be managed by applying user created policies to the resources. To ensure that valid policies are applied, remote validation for the policies may be implemented. A validation event for a policy may be detected. A remote validation agent may be identified for the policy and a validation request sent to the remote validation agent that includes information for validating the policy. The remote validation agent may return a validation result for the policy. If valid, a policy action that triggered the remote validation event for the policy may be allowed. If invalid, the policy action that triggered the remote validation event for the policy may be denied.

Abstract: Methods, systems, and computer-readable media for orchestration of computations using a remote repository are disclosed. A representation of one or more inputs to a computation is stored in a repository. The computation is assigned to one or more hosts of a plurality of hosts. A representation of program code executable to perform the computation is stored in the repository. A local copy of the one or more inputs is stored on the one or more hosts. The computation is initiated on the one or more hosts using the program code and the local copy of the one or more inputs. The computation is initiated for a plurality of keys. The computation succeeds for one or more keys after the computation has failed for one or more other keys. A representation of one or more outputs of the computation is stored in the repository.

Abstract: Methods, systems, and computer-readable media for a client-side filesystem for a remote repository are disclosed. One or more files of a repository are sent from a storage service to a client device. The file(s) are obtained by the client using a credential sent by a repository manager. Local copies of the file(s) are accessible via a local filesystem mounted at the client device. One or more new files associated with the repository are generated at the client device. Using the credential, the one or more new files are obtained at the storage service from the client device. The one or more new files are added to the repository.

Abstract: Methods, systems, and computer-readable media for orchestration of computations using a remote repository are disclosed. A representation of one or more inputs to a computation is stored in a repository. The computation is assigned to one or more hosts of a plurality of hosts. A representation of program code executable to perform the computation is stored in the repository. A local copy of the one or more inputs is stored on the one or more hosts. The computation is initiated on the one or more hosts using the program code and the local copy of the one or more inputs. The computation is initiated for a plurality of keys. The computation succeeds for one or more keys after the computation has failed for one or more other keys. A representation of one or more outputs of the computation is stored in the repository.

Abstract: An event detection system for detecting events related to vehicles based on sensor data from the vehicles. An event detection service on a network may receive streams of sensor data from vehicles and apply machine learning techniques to train models and to analyze the data to detect vehicle-related events. Supervised and unsupervised techniques may be used to train the models and to detect known as well as anomalous events. Events may be detected based on data from one or from multiple vehicles. The system may respond to events by alerting entities and/or signaling vehicle control systems to respond to the events. Trained models may be downloaded to vehicles; the vehicle computer systems can then locally detect events. The downloaded models can be further trained on the vehicles, uploaded to the network, and integrated into the network-based models to improve the performance of the models.

Abstract: Methods, systems, and computer-readable media for a client-side filesystem for a remote repository are disclosed. One or more files of a repository are sent from a storage service to a client device. The file(s) are obtained by the client using a credential sent by a repository manager. Local copies of the file(s) are accessible via a local filesystem mounted at the client device. One or more new files associated with the repository are generated at the client device. Using the credential, the one or more new files are obtained at the storage service from the client device. The one or more new files are added to the repository.

Abstract: Multiple edits to a hierarchical data structure may be atomically applied. A request to perform modifications with respect to a portion or the entire hierarchical data structure may be received. A copy of the requested portion of the hierarchical data structure may be created separate from the hierarchical data structure. The portion of the hierarchical data structure may remain available for read access. Modifications may be applied to the copy of the portion of the hierarchical data structure. In response to a request to commit the modifications to the portion of the hierarchical data structure, the copy of the portion of the hierarchical data structure may atomically replace the portion of the hierarchical data structure.

Abstract: Resource data objects describing resources in a system may be maintained in multiple different hierarchies for applying policies to manage the resources. Lookup requests may access the different hierarchies to determine which policies are applicable to a given resource based on the policies identified in each of the hierarchies. Modifications to hierarchies may be performed in isolation so that the application of policies in other hierarchies is unchanged by modifications to a different hierarchy. Access restrictions may be enforced with respect to hierarchies so that different users may be permitted access to different hierarchies for system resource management.

Abstract: A distributed data store may maintain versioned hierarchical data structures. Different versions of a hierarchical data structure may be maintained consistent with a transaction log for the hierarchical data structure. When access requests directed to the hierarchical data structure are received, a version of the hierarchical data structure may be identified for processing an access request. For access requests with snapshot isolation, the identified version alone may be sufficient to consistently process the access request. For access requests with higher isolation requirements, such as serializable isolation, transactions based on the access request may be submitted to the transaction log so that access requests resulting in committed transactions may be allowed, whereas access requests resulting in conflicting transactions may be denied.

Abstract: A distributed data store may maintain versioned hierarchical data structures. Different versions of a hierarchical data structure may be maintained consistent with a transaction log for the hierarchical data structure. When access requests directed to the hierarchical data structure are received, a version of the hierarchical data structure may be identified for processing an access request. For access requests with snapshot isolation, the identified version alone may be sufficient to consistently process the access request. For access requests with higher isolation requirements, such as serializable isolation, transactions based on the access request may be submitted to the transaction log so that access requests resulting in committed transactions may be allowed, whereas access requests resulting in conflicting transactions may be denied.

Abstract: Methods, systems, and computer-readable media for parameter variations for computations using a remote repository are disclosed. A first computation is assigned to a first set of one or more hosts. The first computation is associated with first parameters including one or more inputs and program code. A second computation is assigned to a second set of one or more hosts and is associated with a second set of parameters. Execution of the first computation is initiated using the first set of hosts and the first set of parameters. Local copies of the input(s) and program code are obtained from a storage service using a TO credential supplied by a repository manager. Execution of the second computation is initiated using the second set of hosts and the second set of parameters as obtained using a credential supplied by the repository manager.

Abstract: A collection of fault categories, including faults associated with internal resources at a provider network, is presented via an interface of a fault injection service. A fault injection mode, selected from a set which comprises a non-randomized mode, to be used to inject faults into a target environment is determined. Fault injection agents introduce faults into the target environment in accordance with the fault injection mode.

Abstract: A distributed key-value database management system may provide transactions having a high degree of conformance to ACID properties. A data element may be maintained as a versioned list, where each entry may comprise a timestamp and a value indicative of a corresponding version of the data element. The timestamp may be based at least in part on a vended time value. Timestamps may be monotonically increasing and unique across all entries in a distributed system. Conflicting updates to a data element may be detected directly, prior to the completion of involved transactions.

Abstract: A programmatic interface is implemented, enabling a client of a stream management service to select a data ingestion policy for a data stream. A client request selecting an at-least-once ingestion policy is received. In accordance with the at-least-once policy, a client may transmit an indication of a data record one or more times to the service until a positive acknowledgement is received. In response to receiving a plurality of transmissions indicating a particular data record, respective positive acknowledgements are sent to the client. Based on a persistence policy selected for the stream, copies of the data record are stored at one or more storage locations in response to one particular transmission of the plurality of transmissions.

Abstract: A partitioning policy, comprising an indication of an initial mapping of data records of a stream to a plurality of partitions, is selected to distribute data records of a data stream among a plurality of nodes of a stream management service. Data ingestion nodes and storage nodes are configured according to the initial mapping. In response to a determination that a triggering criterion for dynamically repartitioning the data stream has been met, a modified mapping is generated, and a different set of ingestion and storage nodes are configured. For at least some time during which arriving data records are stored in accordance with the modified mapping, data records stored at the first set of storage nodes in accordance with the initial mapping are retained.

Abstract: Multiple edits to a hierarchical data structure may be atomically applied. A request to perform modifications with respect to a portion or the entire hierarchical data structure may be received. A copy of the requested portion of the hierarchical data structure may be created separate from the hierarchical data structure. The portion of the hierarchical data structure may remain available for read access. Modifications may be applied to the copy of the portion of the hierarchical data structure.

Abstract: A control node of a multi-tenant stream processing service receives a request indicating an operation to be performed on data records of a particular data stream. Based on a stream partitioning policy, the control node determines an initial number of worker nodes to be used. The control node configures a worker node to perform the operation on received records. In response to a determination that the worker node is in an unhealthy state, the control node configures a replacement worker node.

Abstract: Methods, systems, and computer-readable media for parameter variations for computations using a remote repository are disclosed. A first computation to a first set of one or more hosts. The first computation is associated with first parameters including one or more inputs and program code. A second computation is assigned to a second set of one or more hosts and is associated with a second set of parameters. Execution of the first computation is initiated using the first set of hosts and the first set of parameters. Local copies of the input(s) and program code are obtained from a storage service using a credential supplied by a repository manager. Execution of the second computation is initiated using the second set of hosts and the second set of parameters as obtained using a credential supplied by the repository manager.

Abstract: Methods, systems, and computer-readable media for orchestration of computations using a remote repository are disclosed. A representation of one or more inputs to a computation is stored in a repository. The computation is assigned to one or more hosts of a plurality of hosts. A representation of program code executable to perform the computation is stored in the repository. A local copy of the one or more inputs is stored on the one or more hosts. The computation is initiated on the one or more hosts using the program code and the local copy of the one or more inputs. The computation is initiated for a plurality of keys. The computation succeeds for one or more keys after the computation has failed for one or more other keys. A representation of one or more outputs of the computation is stored in the repository.