Abstract: A method and apparatus for cooperative scheduling of virtual machines. An exemplary method includes maintaining a CPU mask by a virtual machine manager, wherein the CPU mask comprises a real-time availability of each of a plurality of physical CPUs (PCPUs). A virtual machine (VM) is allowed to read the CPU mask.

Abstract: The computer system includes one or more storage devices and a management computer, the management computer includes an information collection unit, an event detection unit, a plan generation unit, and a plan execution unit. The plan generation unit determines a target volume of a change process of a right of control in a plan, a processor of a change source of the right of control, and a processor of a change destination of the right of control, estimates an influence by a change process of the right of control in the plan, and the plan execution unit determines execution time of the plan based on the estimation of the influence and the operation information of the storage devices. As a result, in consideration of the influence by an ownership change process, while the influence applied to usage of a computer system is suppressed, the ownership change process is executed.

Abstract: Embodiments of the present disclosure relate to a method and apparatus for assigning a computing task. The method includes: segmenting, based on a computing resource required for a computing task of a graph, the graph into a subgraph set; determining, based on a computing resource required for a computing task of a subgraph in the subgraph set, whether a node in a node cluster is adapted to the subgraph in the subgraph set; assigning, in response to determining the node in the node cluster being adapted to the subgraph in the subgraph set, the computing task of the subgraph in the subgraph set to the node adapted to the subgraph in the subgraph set, to compute the subgraph; and synthesizing a computing result of the graph based on a computing result of each subgraph in the subgraph set.

Abstract: Computational methods and systems that estimate time remaining and right size for usable capacities of resources used to run virtual objects of a distributed computing system are described. For each stream of metric data that represents usage of a resource of a distributed computing system, a model for forecasting metric data is determined and used to compute forecasted metric data in a forecast interval. A resource utilization metric is computed from the forecasted metric data and may be used to estimate a time remaining before the usable capacity of the resource is expected to be insufficient and the resource usable capacity is adjusted. The resource utilization metric may be used to determine the capacity remaining is insufficient. A right-size usable capacity for the resource is computed based on the resource utilization metric and the usable capacity of the resource is adjusted to at least the right-size usable capacity.

Abstract: In order to achieve a packet processing device which make it possible to process a packet at high speed, a bus that transfers a communication packet, and a plurality of processors and executes at least one task including either of a first task and a second task are included, wherein the first task performs processing when a first task identifier given to the first task and a second task identifier added to the communication packet received from the bus coincide with each other, the second task performs the processing for the communication packet that is not added with the second task identifier, and the processing executes first processing, based on the packet identifier, and thereafter, adds, to the communication packet, the second task identifier indicating the different first task that executes second processing subsequent to the first processing, and transmits the communication packet to the bus.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for tracking memory usage. One of the methods includes implementing an instance of a memory usage tracker (MUT) in each process running in a node of a computer system. The MUT initiates a free process for a memory chunk. A current generation of the memory chunk is determined. The MUT determines whether the mapping element's generation precedes the current generation. If the mapping element's generation is old, the MUT treats the long-living rollover account as the owner of the memory chunk to be freed and if the current generation and the mapping element's generation match, then the MUT considers the owner associated with the mapping element as the owner of the chunk. The MUT then adjusts the balance of the determined memory account and/or sub-account and the balance of the mapping element by the freed memory amount.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to control processing of telemetry data at an edge platform. An example apparatus includes an orchestrator interface to, responsive to an amount of resources allocated to an orchestrator to orchestrate a workload at the edge platform meeting a first threshold, transmit telemetry data associated with the orchestrator to a computer to obtain a first orchestration result at a first granularity; a resource management controller to determine a second orchestration result at a second granularity to orchestrate the workload at the edge platform, the second granularity finer than the first granularity; and a scheduler to schedule a workload assigned to the edge platform based on the second orchestration result.

Abstract: A method includes determining whether an application instance has properly used computing resources to process a workload request, wherein the determination is based on one or more characteristics of the workload request to be processed. The method determines whether the application instance is operating properly, based on the determining of whether the application instance has properly used computing resources based on whether the computing resources have been accessed by the application instance a sufficient number of times; and based on the determination that the application instance is not operating properly, initiates an action to prevent the application instance from improperly processing workload.

Abstract: A method for process management in an electronic device is disclosed. The method includes: acquiring a set of association processes corresponding to an application in the electronic device and priority levels of association processes, wherein the set of association processes includes a primary process of the application and at least one secondary process bound to the primary process; acquiring an operation state of the primary process and an operation state of each of the at least one secondary process, respectively; and adjusting a binding state between the primary process and each of the at least one secondary process and performing a priority adjustment for the primary process and each of the at least one secondary process between which are in the adjusted binding state according to the operation state of the primary process and the operation state of each of the at least one secondary process.

Abstract: 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.

Abstract: The embodiment of the disclosure discloses a method, a device, and a terminal for accelerating the startup of an application. The method includes the steps of: creating a process of a preset application; suspending the process of the preset application after creating the process of the preset application; monitoring a start signal of the preset application; and activating the process of the preset application when the start signal is detected.

Abstract: A method may include obtaining a specification for a resource that includes a description of how the resource operates and interacts with another resource. The method may include generating a diagram that includes each word in the description in an order of word types. The method may include generating a second specification that includes the description and the diagram. The method may include generating tasks for the resource. Each task may include a description based on the description of the resource and diagram. The method may include generating hierarchy descriptions for each task based on the task descriptions. The method may include creating a model for each task that includes the hierarchy descriptions for the corresponding task. The hierarchy descriptions may be arranged according to the diagram in the second specification. The method may include presenting one of the hierarchy descriptions for the tasks according to the models.

Abstract: A non-repudiable transaction protocol system includes a memory, at least one processor in communication with the memory, an operating system executing on the at least one processor, a resource manager configured to manage a storage system, and a transaction manager. The transaction manager is configured to provide NRO-W evidence of a work request from a client to the resource manager and provide NRR-W evidence to the client that the resource manager has completed initial work for the work request. Additionally, the transaction manager is configured to provide NRO-C evidence to the resource manager that the client requested completion of the initial work and NRR-C evidence to the client that the resource manager promised to execute the completion. Each of the NRO-W evidence, the NRR-W evidence, the NRO-C evidence, and the NRR-C evidence are exchanged to prevent either one of the client and the resource manager from gaining an advantage.

Abstract: An algorithm program loading method and a related apparatus are provided. The method includes: determining basic storage capacity of a second storage resource; obtaining an algorithm program, determining whether the algorithm capacity of the algorithm program is greater than the basic storage capacity, and if the algorithm capacity of the algorithm program is greater than the basic storage capacity, segmenting the algorithm program by taking the basic storage capacity as a unit to obtain algorithm subprograms; controlling a direct memory access module to load a master control program of a neural network processor to a first storage resource and executing the master control program; and controlling the direct memory access module to load the first algorithm subprogram in the algorithm subprograms to the second storage resource, confirming that the loading of the first algorithm subprogram is completed, executing the first algorithm subprogram, and loading in parallel a second algorithm subprogram.

Abstract: The disclosed embodiments provide a system for coordinating distributed task execution. During operation, the system retrieves a first batch of tasks from multiple message queues in a distributed messaging system. Next, the system assigns the first batch of tasks to multiple task executors in a thread pool based on availabilities of the multiple task executors. The system also tracks statuses associated with processing the first batch of tasks based on communications from the multiple task executors. The system further periodically commits, based on the tracked statuses, offsets of completed tasks in the multiple message queues to the distributed messaging system.

Abstract: Example systems and methods allow for use of a graphical interface to cause one or more robotic devices to construct an output product. One example method includes causing a graphical interface to be displayed on a display device, receiving input data corresponding to one or more interactions with the graphical interface indicating at least one motion path and at least one sequence of tool actions to execute at one or more points within the at least one motion path for use in construction of an output product, generating a plurality of digital nodes including at least one robot node, at least one motion command node, and at least one tool command node, and providing instructions for the at least one robot actor to move according to the sequence of robot motion commands determined by the at least one motion command node and execute the sequence of tool commands determined by the at least one tool command node to construct the output product.

Abstract: Systems and methods herein can provide virtual resource management for hyper-converged infrastructures. In an example, a method can include identifying an overloaded cluster requesting at least one resource, the overloaded cluster including a hypervisor on a virtual machine. The method can further include identifying an additional cluster having a free resource corresponding to the requested resource. The method can include instantiating a nested host on the additional cluster, the nested host being configured to provide the free resource and the nested hosted comprising an additional hypervisor that manages an additional virtual machine. Further, the method can include registering the nested host with the overloaded cluster such that the overloaded cluster is authorized to use the free resource.

Abstract: One embodiment provides a computer implemented method of dynamically allocating compression jobs including monitoring compression performance at a plurality of compression levels within a hardware accelerator; comparing compression performance between the plurality of compression levels; and dynamically allocating compression jobs between the plurality of compression levels to achieve a guaranteed average performance.

Abstract: A system and method that includes receiving an API request to a type of API resource; retrieving an API concurrency value for the API request; determining a comparison status associated with a comparison of the API concurrency value to a concurrency threshold; if the comparison status is within the concurrency threshold, transmitting the API request to an API processing resource; if the comparison status indicates the concurrency threshold is not satisfied, impeding processing of the API request; accounting for an increase in the API concurrency value if the API request is transmitted to an API processing resource; and accounting for a decrease in the API concurrency value at a time associated with the API processing resource completing processing of the API request.

Abstract: Computational methods and systems to reclaim capacity of a virtual infrastructure of distributed computing system are described. Methods and systems are directed to forecasting usage of resources that form a virtual infrastructure of a distributed computing system. Streams of metric data that represent usage of resources of the virtual infrastructure assigned to a virtual object are collected. A binary sequence of active status metric data is computed for the virtual object based on the streams of metric data. Forecasted active status metric data are computed in a forecast interval based on the sequence of active status metric data. Expected active or inactive status of virtual object over the forecast interval is determined from the forecasted active status metric data. If the virtual object is expected to inactive status over the forecast interval, resources assigned to the virtual object are reclaimed for use by active virtual objects.