Abstract: A cooling-power-consumption-based workload allocation system includes a workload allocation system coupled to at least one client device and a plurality of server devices. The workload allocation system receives a first workload request that identifies a first workload from the at least one client device, and determines a first workload priority of the first workload relative to a second workload priority of each second workload being performed by the plurality of server devices. Based on the first workload priority of the first workload relative to the second workload priority of each second workload and a cooling-power-utilization-efficiency ranking of each of the plurality of server devices, the workload allocation system identifies a first server device included in the plurality of server devices for performing the first workload, and causes the first server device to perform the first workload.

Abstract: A computer implemented method implemented on an allocation computing unit for distributing a pre-defined workflow comprising a nonempty set of workflow components, the workflow components being ordered in a directed acyclic precedence graph, onto a set of general purpose computing units comprising at least two general purpose computing units.

Abstract: Methods for performing efficient receive interrupt signaling and associated apparatus, computing platform, software, and firmware. Receive (RX) queues in which descriptors associated with packets are enqueued are implemented in host memory and logically partitioned into pools, with each RX queue pool associated with a respective interrupt vector. Receive event queues (REQs) associated with respective RX queue pools and interrupt vectors are also implemented in host memory. Event generation is selectively enabled for some RX queues, while event generation is masked for others. In response to event causes for RX queues that are event generation-enabled, associated events are generated and enqueued in the REQs and interrupts on associated interrupt vectors are asserted. The events are serviced by accessing the events in the REQs, which identify the RX queue for the event and a next activity location at which a next descriptor to be processed is located.

Abstract: Embodiments of the present disclosure provide a resource utilization method, an electronic device, and a computer program product. A resource utilization method comprises: at a first node of a storage system, determining whether a local processing delay of a first accelerator resource of the first node exceeds a first threshold delay or not; if it is determined that the local processing delay exceeds the first threshold delay, determining at least one remote processing delay respectively corresponding to at least one second node of the storage system, wherein each remote processing delay comprises a processing delay of a second accelerator resource of a corresponding second node and a round-trip time between the first node and the corresponding second node; and at least based on the at least one remote processing delay, selecting a second accelerator resource, from the second accelerator resources of the at least one second node, to execute a target job of the first node.

Abstract: A system for creating surrogate models is provided. The system includes a user computing device including a user interface, a database, and a processor. The processor is configured to receive, from the user computing device, a workflow request, determine at least one application in the database required to complete the workflow request, retrieve, from the database, the at least one application and meta-data associated with the at least one application, and determine that a user has proper tenancies to use the at least one application. The processor is further configured to execute, using the at least one application on an external computing device, a workflow associated with the workflow request based at least in part on the meta-data, generate, based on execution of the workflow request, new meta-data associated with the at least one application, and transmit the new meta-data to the database.

Abstract: The present disclosure relates to a method, a device, and a program product for managing a computing system. In a method, a current state and a plurality of historical states of a computing device in a computing system are acquired, the plurality of historical states respectively describing historical states of the computing device in the computing system at a plurality of historical time points. In response to determining that the current state matches a scheduling type for scheduling the computing device, the plurality of historical states are searched for a historical state matching the current state. A historical scheduling policy associated with the historical state is determined. Based on the historical scheduling policy, a computing task to be executed by the computing device is allocated to at least one other computing device in the computing system.

Abstract: Methods and apparatus are disclosed that deploy a hybrid workload domain. An example apparatus includes a resource discoverer to determine whether a first bare metal server is available and a resource allocator to allocate virtual servers for a virtual server pool based on an availability of the virtual servers and, when the first bare metal server is available, allocate the first bare metal server for a bare metal server pool. The example apparatus further includes a hybrid workload domain generator to generate, for display in a user interface, a combination of the virtual server pool and the bare metal server pool and generate a hybrid workload domain used to run a user application based on a user selection in a user interface, the hybrid workload domain including virtual servers from the virtual server pool and bare metal servers from the bare metal server pool.

Abstract: A first feature (e.g., chart or table) includes a reference to a dynamic pointer. Independently, the pointer is defined to point to a second feature (e.g., a query). The first feature is automatically updated to reflect a current value of the second feature. The reference to the pointer and pointer definition are recorded in a central registry, and changes to the pointer or second feature automatically cause the first feature to be updated to reflect the change. A mapping between features can be generated using the registry and can identify interrelationships to a developer. Further, changes in the registry can be tracked, such that a developer can view changes pertaining to a particular time period and/or feature of interest (e.g., corresponding to an operation problem).

Abstract: A set of computing nodes may receive a corresponding set of heartbeat messages that originated at the set of computing nodes. The set of heartbeat messages may relate to selecting, among the set of computing nodes, a leader computing node to process a set of jobs. State information included in the heartbeat messages may be provided to a leader election algorithm that outputs information indicating one or more computing nodes that are most qualified to process the set of jobs based on processing capabilities of the computing nodes and processing constraints associated with the set of jobs. The computing node may select itself as the leader computing node to process the set of jobs based on determining, from the information output by the leader election algorithm, that the computing node is most qualified to process the set of jobs and no other computing nodes are processing the set of jobs.

Abstract: Systems and method are provided for receiving, at a virtualized management operation engine (VMOE) of a distributed system, a management task request from a client for one or more services. The management task request may be to an orchestrator of a first application server of one or more application servers of the distributed system. The first application server having the orchestrator may determine whether the management task request is valid. The first application server having the orchestrator may generate a request message based on the valid management task request. A message bus may broadcast the generated request message to one or more agents of the one or more application servers of the distributed system. The one or more agents may execute an operation based on the request message when the request message is intended for the one or more agents.

Abstract: This disclosure relates to a graph-data-based task scheduling method, which includes: obtaining subgraph data divided from graph data to be processed by a computing node, performing a unit computing task for a graph node in the subgraph data, obtaining a first quantized value corresponding to a completed unit computing task in response to data corresponding to the completed unit computing task being formed into blockchain data, obtaining a second quantized value corresponding to the completed unit computing task in response to the data corresponding to the completed unit computing task being not formed into blockchain data, determining a third quantized value corresponding to an uncompleted unit computing task in the subgraph data, and exchanging the graph node and the first quantized value with another computing node in response to the second quantized value and the third quantized value failing to meet an equilibrium condition.

Abstract: The disclosed embodiments relate to a system that facilitates developing applications in a component-based software development environment. This system provides an execution environment comprising instances of application components and a registry that maps names to instances of application components. Upon receiving a call to register a mapping between a name and an instance of an application component, the system updates the registry to include an entry for the mapping. Moreover, upon receiving a call to be notified about registry changes for a name, the system updates the registry to send a notification to a caller when a registry change occurs for the name.

Abstract: Systems and methods for presenting an in-application message to a user of a software application make use of trigger conditions that occur on remote servers. When a remote server notes the occurrence of activity relating to a user that comprises a trigger condition, the remote server sends information about the activity to a customer engagement service. The customer engagement service causes a push notification to be sent to a user's computing device that is running a software application. Receipt of the push notification causes a campaign within the software application to log a trigger condition as satisfied, which in turn causes the campaign to present the user with an in-application message.

Abstract: Methods and apparatus to execute a workload in an edge environment are disclosed. An example apparatus includes a node scheduler to accept a task from a workload scheduler, the task including a description of a workload and tokens, a workload executor to execute the workload, the node scheduler to access a result of execution of the workload and provide the result to the workload scheduler, and a controller to access the tokens and distribute at least one of the tokens to at least one provider, the provider to provide a resource to the apparatus to execute the workload.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for precisely tracking memory usage in a multi-process computing environment. 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. A MUT can maintain an account of memory usage for each of multiple logical owners running on a process on which the MUT is running. The MUT can determine an actual memory quota for each owner, and enforce the actual memory quota of the owner. Enforcing the actual memory quota of the owner can include receiving each memory allocation request, checking each allocation request and a current state of the account against the actual quota, approving or rejecting each allocation request, communicating the approval or rejection to an underlying memory manager, and updating the owner account for each approved allocation request.

Abstract: Activities related to data analyses are managed in part using task objects representing tasks that need to be performed. In one embodiment, a method comprises: receiving a first request to generate a task object that describes a task; responsive to the first request, generating the task object, the task object being a data structure that comprises values for task object fields that represent attributes of the task; identifying, in a repository of data objects, a particular data object to associate with the task object; determining that a first field of the task object fields corresponds to a second field of the particular data object, the second field of the particular data object having a particular value; and assigning the first field of the task object to the particular value of the corresponding second field. In another embodiment, task objects are associated with geolocation data, and mapped or otherwise presented accordingly.

Abstract: A method, system and computer program product, the method comprising: determining properties of a set of containers that are deployed over a computer infrastructure, wherein the computer infrastructure is provisioned via an infrastructure management service; determining properties of one or more headroom containers, wherein the one or more headroom containers are not deployed over the computer infrastructure; simulating the container orchestrator using the properties of the set of container and the properties of the headroom containers, for obtaining an expected deployment of the set of containers together with the one or more headroom containers; based on the expected deployment, determining whether the computer infrastructure is sufficient for deploying the set of containers together with the one or more headroom containers; and subject to the computer infrastructure being insufficient, issuing a request to the infrastructure management service to allocate additional computer infrastructure.

Abstract: An apparatus is configured to collect information related to a first activity and analyze the collected information to determine decision data. The information is stored in a first list of the source processing core for scheduling execution of the activity by a destination processing core to avoid cache misses. The source processing core is configured to transmit information related to the decision data using an interrupt, to a second list associated with a scheduler of the destination processing core, if the destination processing core is currently executing a second activity having a lower priority than the first activity.

Abstract: System and method for facilitating management of a time-varying resource pool. The system includes a processor and a memory coupled to the processor. The memory stores processor-executable instructions that, when executed, configure the processor to: obtain a time-series data set including data entries associated with one or more consumed resources; identify one or more recurring resource allocations based on recurring data entries of the time-series data set; identify additional resource allocations based on irregularly-timed data entries of the time-series data set; determine a forecasted resource pool value based on a combination of the identified recurring resource allocations and the additional resource allocations; and upon detection of a trigger condition, generate data for display, via a user interface, a scaled resource allocation value based on the forecasted resource pool value, the scaled resource allocation value corresponding to at least one time-based reference.

Abstract: An electronic device is provided. The electronic device includes at least one processor and a memory storing instructions executed to enable the at least one processor to identify a plurality of processes associated with an application, identify at least one process to be operation-restricted during at least partial time of a time of running the application among the plurality of processes, restrict an operation of the at least one identified process during the at least partial time of the time of running the application, and release the operation restriction on at least some of the at least one identified process in response to meeting a preset condition.