Abstract: A virtual server includes at least one processor to create a single composited layered image comprising an operating system layer and an application shortcut that includes a representation of an application while not including the application. The single composited layered image is provided as a virtual session to a client computing device. An application layer is mounted to the single composited layered image in response to a user of the client computing device interacting with the application shortcut, with the application layer including the application.

Abstract: A system for storing and extracting elements according to their priority takes into account not only the priorities of the elements but also three additional parameters, namely, a priority resolution p? and two priority limits pmin and pmax. By allowing an ordering error if the difference in the priorities of elements are within the priority resolution, an improvement in performance is achieved.

Abstract: A method for machine learning-informed surfacing and automated execution of digital activity-accelerating actions includes identifying a target digital artifact; and based on identifying the target digital artifact: searching a digital activity-accelerator registry based on the target digital artifact; and in accordance with a determination that the digital activity-accelerator registry includes a composite activity sequence corresponding to the target digital artifact, displaying, via a graphical user interface, one or more selectable representations of one or more tasks included in the composite activity sequence.

Abstract: A foundation framework resource of a first service function is loaded in a software application. A service request for starting the first service function in the software application is received. A page resource required by the first service function is loaded. The first service function is implemented based on the foundation framework resource of the first service function and the page resource.

Abstract: This disclosure is directed to systems and methods for determining target allocation parameters for initiating targeted communications in complex computing networks, which may be associated with the allocation of allocatables in execution events over a period of time. The systems and methods may include receiving a desired allocation; determining a first available allocation at a first time; generating allocation information for a second period comprising the first time; determining a second available allocation at a second time; determining a remaining available allocation, based on the allocation information and the second available allocation; and determining one or more target allocation parameters for initiating a targeted communication to a computing device after the second time.

Abstract: One example method includes intercepting an IO issued by an application of a VM, the IO including IO data and IO metadata, storing the IO data in an IO buffer, writing the IO metadata and a pointer, but not the IO data, to a splitter journal in memory, wherein the pointer points to the IO data in the IO buffer, forwarding the IO to storage, and asynchronous with operations occurring along an IO path between the application and storage, evacuating the splitter journal by sending the IO data and the IO metadata from the splitter journal to a replication site.

Abstract: A method to migrate a cluster's hosts and virtual machines from virtual standard switches to a virtual distributed switch includes creating distributed port groups on the virtual distributed switch, where properties of the distributed port groups are automatically replicated to host proxy switches on the hosts. The method further includes configuring the distributed port group with ephemeral binding so port binding of the distributed port group is configurable through a host in the cluster even when an infrastructure virtual machine that manages the cluster is down, determining (or receiving user input indicating) the infrastructure virtual machine is on the host, and issuing a call to the host to migrate (1) the infrastructure virtual machine to the distributed port group and (2) one or more physical network interface cards of the host to the virtual distributed switch.

Abstract: Methods and systems are provided for automatically determining a need to invoke functionality of a feature of an application while using a primary application and for automatically invoking that functionality without user action. When input information is input into the primary application via a user interface of a user system, it can be received by an application server from a sender process at the user system, and a pre-fix that occurs before a text string can be identified. The text string that follows the pre-fix can be extracted by performing a matching analysis against a library of keywords and extracting a matching keyword. The text string comprises extracted text from the input information. The matching keyword can be matched to an entry that is mapped to a command that can be executed to generate an action that automatically invokes the functionality of the feature of the application without user action.

Abstract: Logic includes a task builder for building tasks comprising data items, a task scheduler for scheduling tasks for processing by a parallel processor, a data store arranged to map content of each data item to an item ID, and a linked-list RAM comprising an entry for each item ID. For each new data item, the task builder creates a new task by starting a new linked list, or adds the data item to an existing linked list. In each linked list, the entry for each data item records a pointer to a next item ID in the list. The task builder indicates when any of the tasks is ready for scheduling. The task scheduler identifies a ready task based on the indication from the task builder, and in response follows the pointers in the respective linked list in order to schedule the data items of the task for processing.

Abstract: The failure modes of mechanical components may be determined based on text analysis. For example, a word embedding may be determined based on a plurality of text documents that include a plurality of maintenance records characterizing failure of mechanical components. A vector representation for a particular maintenance record may then be determined based on the word embedding. Based on the vector representation, the particular maintenance record may then be identified as belonging to a particular failure mode out of a set of possible failure modes.

Abstract: A computing device determines an optimal number of threads for a computer task. Execution of a computing task is controlled in a computing environment based on each task configuration included in a plurality of task configurations to determine an execution runtime value for each task configuration. An optimal number of threads value is determined for each set of task configurations having common values for a task parameter value, a dataset indicator, and a hardware indicator. The optimal number of threads value is an extremum value of an execution parameter value as a function of a number of threads value. A dataset parameter value is determined for a dataset. A hardware parameter value is determined as a characteristic of each distinct executing computing device in the computing environment. The optimal number of threads value for each set of task configurations is stored in a performance dataset in association with the common values.

Abstract: Methods and systems for resource usage metric grading are disclosed. In one embodiment, an exemplary method comprises receiving a request to assign a first role to at least one virtual server; configuring the virtual server to associate the first role with a first resource of the virtual server; modifying a database to include an identifier associated with the virtual server and an identifier of the first role assigned to the virtual server; receiving, from the virtual server, indications of resource usage for a plurality of roles; calculating an efficiency metric associated with the first role, the efficiency based on resource usage associated with the first role and resource usage associated with the plurality of roles; modifying a user interface element for presentation on a web page to include the calculated efficiency metric for the first role; receiving a request from a user; and delivering the web page.

Abstract: A great deal of time and computational resources may be used when developing a machine learning or other data processing workflow. This can be related to the need to re-compute the workflow in response to adjustments to the workflow parameters, in order to assess the benefit of such adjustments so as to develop a workflow that satisfies accuracy or other constraints. Embodiments herein provide time and computational savings by selectively storing and re-loading intermediate results of steps of a data processing workflow. For each step of the workflow, during execution, a decision is made whether to store the intermediate results of the step. Thus, these embodiments can offer storage savings as well as processing speedups when repeatedly re-executing machine learning or other data processing workflows during workflow development.

Abstract: A manager agent access a grain hierarchy that represents a state for a computation that is to performed by a distributed processing system, wherein the grain hierarchy includes manager agent grains including metadata for manager agent processes that manage the performance of the computation by the distributed processing system, and worker agent grains including, for tasks to be performed by the distributed processing system, metadata for worker agents that each correspond to a subset of the plurality of data processors for performing the task. A manager agent performs processes defined by a manager agent grain to manage the computation by worker agents and storing, within the grain, metadata describing the manager agent process performed by the manager agent, and worker agents perform tasks assigned to the worker agents based on an assignment of a respective worker agent grain to the worker agent.

Abstract: An image processing method is provided, which is applied to a deep learning model. A cache queue is provided in front of each layer of the deep learning model; a plurality of computation tasks are preset for each layer of the deep learning model in advance, and are configured for computing weight parameters and corresponding to-be-processed data in a plurality of channels in each corresponding layer in parallel, and storing a computation result into a cache queue behind the corresponding layer thereof; in addition, as long as the cache queue in front of the layer includes the computation result stored in the previous layer, the layer can obtain the to-be-processed data from the computation result, subsequent computation is performed, and a parallel pipeline computation mode is also formed between the layers.

Abstract: Systems and methods are provided for efficiently configuring an execution environment for an on-demand code execution system to handle a single request (or session) for a single user. Once the session or request is complete, the execution environment is reset, such as by having the hardware processor state, memory, and storage reset. In particular, prior to the execution of code, state of the execution environment of the host computing device is retrieved, such as hardware processor(s), memory, and/or storage state. Moreover, during execution of the code instructions, intermediate state can be gathered. Following the execution of the code, the execution environment is reset based on the saved state related to the hardware processor(s), memory, and/or storage. A subsequent code execution securely occurs in the execution environment and the execution environment is reset again, and so forth.

Abstract: The deployment of content and computing resources for implementing a distributed software application can be optimized based upon customer location. The volume and geographic origin of incoming requests for a distributed software application are determined. Based upon the volume and geographic origin of the incoming requests, content and/or one or more instances of the distributed software application may be deployed to a geographic region generating a significant volume of requests for the distributed software application. Content and/or instances of a distributed software application might also be speculatively deployed to a geographic region in an attempt to optimize the performance, cost, or other attribute of a distributed software application.

Abstract: According to one aspect, there is provided an apparatus comprising at least one processing unit and at least one memory. The at least one memory stores program instructions that, when executed by the at least one processing unit, cause the apparatus to cause display of executed task instances relating to at least one application on a graphical user interface on a display, detect a storing command associated with the executed task instances, and store task information relating to the executed task instances in a task file in the at least one memory for later resumption of execution of the task instances.

Abstract: The present disclosure describes a technique for honoring virtual machine placement constraints established on a first host implemented on a virtualized computing environment by receiving a request to migrate one or more virtual machines from the first host to a second host and without violating the virtual machine placement constraints, identifying an architecture of the first host, provisioning a second host with an architecture compatible with that of the first host, adding the second host to the cluster of hosts, and migrating the one or more virtual machines from the first host to the second host.

Abstract: Computing node identifiers can be used to encode information regarding the distance between requesting and available computing nodes. Computing node identifiers can be computed based on proximity values for respective computing nodes. Requests can be directed from one computing node to an available computing node based on information encoded by both the computing node identifiers of the requesting node and the receiving node. Using these computing node identifiers to direct request traffic among VMs can more efficiently leverages network resources.