A first request to reserve a quantity of resources that comply with a constraint specified in the first request is obtained. A set of available resources that fulfills the constraint is determined based on current capacity usage. A token is associated with the set of available resources, with the token being associated with an expiration. The quantity of resources from the set of available resources is reserved, where the quantity allocated is unavailable, until the expiration, to fulfill resource requests that lack the token. The token is provided in response to the first request.

A computer-implemented method at a data management system comprises: generating, with one or more processors, a containerized runtime in a memory in communication with the one or more processors; instantiating, with the one or more processors, an app in the runtime; receiving, with the one or more processors, a request from the app for data; retrieving, with the one or more processors, a copy of the requested data from a data source; and transmitting, with the one or more processors, the data to the containerized runtime for the app to operate on.

A system for providing low-latency compute capacity is provided. The system may be configured to route incoming code execution requests based on user indications to use specific containers running on a plurality of virtual machine instances. The system may be configured to process a code execution request, identify, based on the user indication that a specific container previously used to handle a request of similar type is to be used for handling the code execution request, and cause the code execution request to be handled using the specific container.

Methods, nontransitory computer readable media, and systems are disclosed for servicing a job queue. Each job has node resource requirements. Composite job memory and processor requirements is determined from these requirements. Nodes that satisfy these requirements are identified by obtaining, for each class of a plurality of node classes: an availability score, a number of processers, and a memory capability. A request for nodes of a class is made when a demand score for the class satisfies the class availability score. An acknowledgement and updated availability score is received upon request acceptance. A declination is received upon request rejection. The submitting and receiving is performing multiple times, if needed, until each class has been considered for a request or sufficient acknowledgements are received to satisfy the composite requirements of the jobs. Each node in the cluster draws jobs from the queue subject to the collective requirements of the drawn jobs.

Systems and methods are provided for managing dynamic controls over access to computer resources and, even more particularly, for evaluating and re-evaluating dynamic conditions and changes associated with user sessions. The systems and methods are configured to automatically make a determination as to whether new or additional authentication credentials are required for a user that is already authorized for accessing resources in a user session, in response to triggering events such as the identification of a new or changed condition associated with the user session.

Technologies are disclosed for real-time workload tracking and throttling within a multi-tenant service. Multi-tenant services receive requests from computing devices associated with different tenants. While processing requests, the multi-tenant service itself sends requests to an underlying resource, such as a database. Requests from computing device associated with an overactive tenant may cause the multi-tenant service to overwhelm the underlying resource. The overwhelmed underlying resource may not know which tenant a request received by the underlying resource is associated with, and so the underlying resource is unable to only throttle requests originating from computing devices associated with the overactive tenant. Instead, the underlying resource throttles all requests from the multi-tenant service. To avoid this result, the multi-tenant service tracks utilization of the underling resource associated with each tenant, and throttles requests received from overactive tenants before the underlying resource becomes overwhelmed and throttles all requests from the multi-tenant service.

Systems and methods for allocating resources are disclosed. Resources as processing time, writes or reads are allocated. Credits are issued to the clients in a manner that ensure the system is operating in a safe allocation state. The credits can be used not only to allocate resources but also to throttle clients where necessary. Credits can be granted fully, partially, and in a number greater than requested. Zero or negative credits can also be issued to throttle clients. Segment credits are associated with identifying unique fingerprints or segments and may be allocated by determining how many credits a CPU/cores can support. This maximum number may be divided amongst clients connected with the server.

A node management protocol is disclosed herein. The protocol can be used for task distribution in multi-node systems. The node management protocol can implement a cooperation-based task distribution algorithm that does not rely on consensus. When a task is ingested into a cluster of nodes, the nodes can compete to handle the task. A transport layer helps coordinate among nodes and facilitates the handling of work. A session expiry protocol handles node failures with the remaining nodes reassigning work.

These methods, systems, and other aspects can provide for adaptive distribution/re-distribution of data processing tasks. An example method may create, by a processor in a first node, a status object for a data processing task and assign, by the processor in the first node, the data processing task to a worker of a second node. Further, after a first period of time, the method may query, by the processor in the first node, the status object for a task status of the assigned data processing task reported by the second node. The task status reflects a status of execution of the assigned data processing task by the second node. The method determines, by the processor in the first node, to reassign the assigned data processing task based on a received task status reported by the second node, and reassign, by the processor in the first node, the assigned task.

Systems and methods are provided for fail-safe loading of information on a user interface, comprising receiving, via a modular platform, requests for access to a mobile application platform from a plurality of mobile devices, opening and directing the requests for access to the mobile application platform to a sequential processor of an application programming interface (API) gateway when a parallel processor of the API gateway is unresponsive to requests for access to the mobile application platform for a predetermined period of time, periodically checking a status of the parallel processor, and redirecting the requests for access to the mobile application platform to the parallel processor when the parallel processor is capable of processing requests for access to the mobile application platform.