Abstract: A liquid ingesting management system is provided. The liquid ingesting management system includes a fluid container, a database and a wireless transmit/receive unit. The wireless transmit/receive unit communicates with the fluid container and the database through a wireless technique to access the database and control the fluid container to perform a liquid ingesting management process.

Abstract: Methods, apparatus, systems, and computer-readable media are provided for allowing an automated assistant routine to be interrupted during performance of the routine. A routine can correspond to a set of actions to be performed at the direction of the automated assistant. When the routine is initialized and a user subsequently issues a command to interrupt the routine, the automated assistant can modify a status identifier for the routine. That status identifier can be stored at a database and allow other applications and/or devices that are operating to complete the routine to be put on notice that the user has requested the routine be interrupted. The database can be accessible to one or more devices and/or applications, such as third party applications, in order to provide a medium through which the devices and/or applications can check the statuses of various automated assistant routines.

Abstract: Programmable controller technology, in which data is received that identifies a particular type of irrigation system component that is to be controlled by a programmable controller. Based on receiving the data identifying the particular type of irrigation system component, configuration information is accessed for the particular type of irrigation system component. Based on the configuration information, a configuration is determined for one or more interface ports of the programmable controller. The one or more interface ports of the programmable controller are configured according to the determined configuration. A connection between the particular type of irrigation system component and the programmable controller that satisfies the determined configuration is detected.

Abstract: A memory slot allocation request specifying a requested number of memory slots is received from a requestor assigned to a particular class among a plurality of classes. It is determined whether allocation of the requested number of memory slots to the requestor results in satisfaction of resource allocation constraints for the plurality of classes. The resource allocation constraints include a first and second threshold for each class that determine how many memory slots can be allocated to each class. Based on determining that allocation of the requested number of memory slots to the requestor results in satisfaction of the resource allocation constraints, the memory slot allocation request is granted. The granting of the memory slot allocation request includes allocating the requested number of memory slots to the requestor.

Abstract: A multi-core architecture including: a plurality of processing devices, each processing device including a single processor or a cluster of processors; and a lock manager associated with each processing device, each lock manager being configured to: store a first data value indicating of whether or not it currently owns a first lock, the first lock authorizing access to a resource; and permit an owner of the first lock to be determined by one or more lock managers by broadcasting, over an interconnection network to each of the other lock managers, at least one message.

Abstract: A method, computer program product, and computer system for receiving an indication about an amount of background IOs a background scheduler is capable of performing on a plurality of applications, wherein the indication may be based upon, at least in part, one of host IO latency and a rate of the host IO latency being at one of a plurality of levels. One or more applications of the plurality of applications on which to perform the background IOs may be determined. The background IO applications to be performed on the one or more applications of the plurality of applications may be scheduled based upon, at least in part, one of the host IO latency and the rate of the host IO latency being at one of the plurality of levels.

Abstract: A new timer object that is associated with a timer event may be identified. A virtual processor that is to be provided the timer event that is associated with the new timer object may be determined. One or more current timer objects that are associated with one or more timer events provided to the virtual processor may also be identified. A new element for the new timer object may be created in a list identifying the one or more current timer objects that are associated with the one or more timer events that are provided to the virtual processor.

Abstract: Systems and methods are provided for managing dynamically allocated storage and processing units. The systems and methods include operations for determining, a usage pattern having a peak usage portion and a low usage portion; reserving a first collection of units on a dynamic unit allocation system during the peak usage portion; detecting a transition from the peak usage portion to the low usage portion; in response to detecting the transition, instructing the dynamic unit allocation system to reduce the first collection of units to reserve a second collection of units corresponding to a second amount of the low usage portion; selecting asynchronous tasks that consume a set of units greater than the second collection of units; and during a period of time that the dynamic unit allocation system is reducing the first collection of units, causing the asynchronous tasks to be executed by the dynamic allocation system.

Abstract: A method of processing data for a deep learning system driven by a plurality of heterogeneous resources is provided. The method includes, when a first task including at least one of a plurality of operations is to be performed, receiving first path information indicating a first computing path for the first task. The first computing path includes a sequence of operations included in the first task and a driving sequence of resources for performing the operations included in the first task. The method further includes setting data representation formats of the resources for performing the operations included in the first task based on data representation information and the first path information. The data representation information indicates an optimized data representation format for each of the plurality of heterogeneous resources.

Abstract: Among other things, one or more techniques and/or systems for facilitating task completion through inter-application communication and/or for registering a target application for contextually aware task execution are provided. That is, a current application may display content comprising an entity (e.g., a mapping application may display a restaurant entity). One or more actions capable of being performed on the entity may be exposed (e.g., a reserve table action). Responsive to selection of an action, one or more target applications capable of performing the action on the entity may be presented. Responsive to selection of a target application, contextual information for the entity and/or the action may be passed to the target application so that the target application may be launched in a contextually relevant state to facilitate completion of a task. For example, a dinning application may be launched to a table reservation form for the restaurant entity.

Abstract: Systems and methods for managing processor overcommit for virtual machines are disclosed. In one implementation, a processing device may identify, by a hypervisor running on a host computer system, an over-committed physical processor, the physical processor is executing a thread implementing a first virtual processor (vCPU) of a virtual machine (VM). The processing device may further queue, by the hypervisor, a message notifying the VM of hot-unplugging of the first vCPU. Responsive to receiving, by the hypervisor, a notification of a second vCPU of the VM transitioning into an idle state, the processing device may also transmitting the message to the VM.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for registering subscribable sub-states in blockchain are provided. One of the methods includes: obtaining a request for registering one or more sub-states of a state, wherein a registered workflow comprises the state; generating a blockchain contract comprising the one or more sub-states; and deploying the blockchain contract in a blockchain. The deployed blockchain contract is executable to update a current sub-state of the state corresponding to the workflow among the one or more sub-states.

Abstract: Systems, apparatuses, and methods for enforcing processor quality of service guarantees when servicing system service requests (SSRs) are disclosed. A system includes a first processor executing an operating system and a second processor executing an application which generates SSRs for the first processor to service. The first processor monitors the number of cycles spent servicing SSRs over a previous time interval, and if this number of cycles is above a threshold, the first processor starts delaying the servicing of subsequent SSRs. In one implementation, if the previous delay was non-zero, the first processor increases the delay used in the servicing of subsequent SSRs. If the number of cycles is less than or equal to the threshold, then the first processor services SSRs without delay. As the delay is increased, the second processor begins to stall and its SSR generation rate falls, reducing the load on the first processor.

Abstract: A system and method for efficiently allocating resources of destinations to sources conveying requests to the destinations. In various embodiments, a computing system includes multiple sources that generate requests and multiple destinations that service the requests. One or more transaction tables store requests received from the multiple sources. Arbitration logic selects requests and stores them in a processing table. When the logic selects a given request from the processing table, and determines resources for the corresponding destination is unavailable, the logic removes the given request from the processing table and allocates the request in a retry handling queue. When the retry handling queue has no data storage for the request, logic updates a transaction table entry and maintains a count of such occurrences. When the count exceeds a threshold, the logic stalls requests for that source. Requests in the retry handling queue have priority over requests in the transaction tables.

Abstract: Disclosed are various embodiments for the controlling the amount of active updates that can occur during a given time on devices that are associated with tenants (e.g., organizations) and subtenants (e.g., sub-organizations) in a multi-tenant environment. In particular, each tenant and subtenant is assigned throttle corresponding to different update parameters (e.g., an amount of devices executing an active update, an amount of data to be downloaded during a campaign, a time for completing the update campaign, etc.). When an update campaign is established, the update campaign can define the different devices that are to be updated. In some situations, the number of active updates required may exceed the allotted resources for a given subtenant. When a subtenant requires additional resources than what is assigned to complete the update, the subtenant can borrow resources defined by the update parameters from a subtenant peer that has a surplus.

Abstract: A gateway for interfacing a host with a subsystem for acting as a work accelerator to the host. The gateway enables the transfer of batches of data to the subsystem at precompiled data exchange synchronisation points. The gateway comprises a streaming engine having a data mover engine and a memory management engine, the data mover engine and memory management engine being configured to execute instructions in coordination from work descriptors. The memory management engine is configured to execute instructions from the work descriptor to transfer data between external storage and the local memory associated with the gateway. The data mover engine is configured to execute instructions from the work descriptor to transfer data between the local memory associated with the gateway and the subsystem.

Abstract: A method of the invention manages data stream processing tasks of an application topology in a stream processing system, the stream processing system having one or more data producers, one or more compute nodes, and one or more result consumers, includes: assigning geographic scope granularities to the data stream processing tasks of the application topology; receiving, by a task manager from a result consumer of the one or more result consumers, a subscription in order to trigger data processing for computing a result, the subscription including geographic scope related information concerning the triggered data processing]; generating, by the task manager based on the geographic scope related information of the subscription, an execution plan including task instances for performing the triggered data processing; and generating, by the task manager from the execution plan, a deployment plan for deploying the task instances of the execution plan on the compute nodes.

Abstract: Systems and methods are described for dynamically adjusting quantities of computing resources allocated to virtual machine instances in an on-demand code execution system. An on-demand code execution system may execute user-submitted code on virtual machine instances, which may be provisioned with quantities of various computing resources (memory, storage, processor time, etc.). Users may request that code be executed on virtual machine instances having a particular quantity of a particular computing resource, and a previously provisioned virtual machine instance have a different quantity of the resource than the quantity requested. A resource reclamation system may thus be used to dynamically adjust the quantity of computing resources without reprovisioning the virtual machine instance.

Abstract: An efficient state-machine-based pattern matching technique processes tokens in an input queue and identifies patterns in the sequence of tokens that match one or more predetermined input patterns without backtracking. Tokens can include data or no data and a time component. The tokens can be a stream of data generated by a sensor, which transforms a physical property into a digital quantity. The pattern matching technique processes the input queue in a single direction, and does not examine any previously examined token. In an implementation, specific patterns to be matched are specified using a state machine, where the state machine is specified in a state table and operates using a state stack.

Abstract: Techniques for refreshing application instances periodically based on a refresh rate parameter, providing enhanced health and stability for instances actively executing workloads. When a workload is received requesting one or more application instance(s), a refresh rate is determined, and the instance(s) are monitored. Periodically, based on the refresh rate, the monitored application instance(s) are refreshed. One or more instance(s) are identified for refreshing, one or more new replacement instance(s) are generated, and the identified instances are removed from active service and decommissioned. Workloads continue execution upon the newly generated instances, which are in turn monitored and refreshed as dictated by the refresh rate.