In an example embodiment, a new solution is provided for an in-memory database provided in a cloud as a service that enables “job cross running” instead of “parallel job running.” Specifically, job scripts are clustered based on a shared service. A primary job script in the cluster is compiled and executed, but secondary job scripts in the cluster are not compiled until after the execution of the primary job script has begun. A mock library is inserted into each of the secondary job scripts to cause service calls for the shared service in the secondary job scripts to be replaced with mock service calls. The secondary job scripts are then scheduled and executed, and upon completion the primary job script is permitted to delete the shared service.

A method of scheduling tasks within a GPU or other highly parallel processing unit is described which is both age-aware and wakeup event driven. Tasks which are received are added to an age-based task queue. Wakeup event bits for task types, or combinations of task types and data groups, are set in response to completion of a task dependency and these wakeup event bits are used to select an oldest task from the queue that satisfies predefined criteria.

Various embodiments of the present technology may comprise a method and apparatus for a temporal synchronization circuit. The temporal synchronization circuit may be configured to operate in conjunction other integrated circuits to align data received from a plurality of sensors. The temporal synchronization circuit generates time stamps for generated data that are used to correct for any temporal deviation in the data received from the sensors to mitigate fault conditions that may be generated by misaligned data. The temporal synchronization circuit may also generate a power management scheme based on the particular characteristics of a SRAM to adjust power requirements according to any temporal deviation in the received sensor data.

The technology describes scanning tree data structures (trees) for multiple processes, at least partly in parallel. A service scans a tree from a beginning tree element to an ending tree element on behalf of a process; while scanning, another process can join in the scan at an intermediate tree element location (e.g., a key). For the subsequent process, the service scans the tree based on the intermediate location to the tree end, thereby visiting tree elements in parallel until the tree end, then continuing from the tree beginning element to the intermediate location for the subsequent process. The service basically completes a full carousel-type revolution for each process. One or more other processes can join an ongoing scan at any time, facilitating further parallel tree element visits, while still obtaining a full scan of the entire set of tree elements. The service handles changing tree versions during the scanning.

Embodiments of the present disclosure provide a method, and apparatus and a computer readable medium for controlling a storage system. For example, a method for controlling a storage system is provided. The method comprises: determining a control factor related to a background operation in the storage system, the control factor including a usage state of a storage resource pool in the storage system; setting a priority level for the background operation based on the determined control factor; and controlling execution of the background operation based on the set priority level. Embodiments of the present disclosure may accelerate execution of background operations, improve resource utilization efficiency, and ensure good I/O performance.

Examples include a computer-implemented method for determining one or more observations about a computing system, determining a plurality of sets of one or more actions based at least in part on a plurality of policies and the one or more observations; reducing the plurality of sets of one or more actions to generate a reduced set of actions, the reduced set of actions including scheduling a computing system to execute the reduced set of actions by requesting one or more idempotent tickets to be created in a ticketing system; and performing, or causing to be performed, the reduced set of actions.

A method, apparatus, computer-readable medium, and/or system may comprise a user device configured to receive, from a user, a selection of a plurality of dependent computing tasks for a first computing task. The user device may transmit, to a computing device, the selection of the plurality of dependent computing tasks for the first computing task. The system may comprise a computing device comprising a processor and memory storing computer-executable instructions that, when executed by the processor, cause the computing device to receive, from the user device, the selection of the plurality of dependent computing tasks for the first computing task. The computing device may store, at a task registry and in association with the first computing task, an indication of the plurality of dependent computing tasks. The computing device may cause transmission of the first computing task from the task registry to a task queue. In some aspects, a dependent task queue may comprise the plurality of dependent computing tasks. The computing device may determine whether the plurality of dependent computing tasks has been executed. If the plurality of dependent computing tasks has been executed, the computing device may determine one or more nodes for executing the first computing task and cause transmission of the first computing task from the task queue to the one or more nodes for executing the first computing task. The one or more nodes may be configured to execute the first computing task in response to receiving the first computing task from the task queue.

Embodiments of an activities-defined software object execution management platform include instantiation of a program based on a program configuration, including customizable scheduling configurations and execution steps of program stages. A current state of the program is received from a state persistence storage. A stage configuration of the current stage is configured. A program execution readiness is determined to identify when to execute the current stage of the program based on an execution configuration and program-specific parameterized values. The current stage is instantiated based on the program execution readiness. An execution status of the stage is determined based on a validation configuration. A previous stage is determined to rollback before the current stage based on the execution status and a rollback configuration. The current state is updated in the persistent storage based on the execution of the state step to form a subsequent state of the program.

In general, the invention relates to a method for performing backing operations. The method includes receiving a user instruction to perform a backup operation on a user asset on a client device, determining that a prior backup operation on the user asset was interrupted, in response to the determination, generating a data file difference subset using a control file and a recovery catalog, wherein the control file is associated with the user asset and the recovery catalog is associated with at least the prior backup operation, and initiating the backup operation using the data file difference subset.

A method, which may be performed by a computing system, involves determining that a plurality of notifications, including a first notification, is to be sent to a first client device, the first notification indicating a first task that is to be performed with respect to a resource accessible to the computing system; determining that a second task has a dependency relationship with the first task; determining at least one first parameter relating to the first task and at least one second parameter relating to the second task; determining, based at least in part on the at least one first parameter and the at least one second parameter, a first priority score corresponding to the first notification; and causing the plurality of notifications to be presented by the first client device in an order that is determined based at least in part on the first priority score.