Abstract: A system and method for adaptive determination of computing resources is presented. Sometimes, computing jobs are to be allocated among a set of computers. Historical information regarding input data size and output data size is retrieved. Capacity information about each machine is retrieved. A weighted function is used to calculate a desired allocation of computing resources based on historical input data size and output data size. Computing resources are allocated based on the calculated allocation. The computing job can be performed on the allocated computing resources. Other embodiments also are disclosed.

Abstract: A technique for controlling the distribution of compute task processing in a multi-threaded system encodes each processing task as task metadata (TMD) stored in memory. The TMD includes work distribution parameters specifying how the processing task should be distributed for processing. Scheduling circuitry selects a task for execution when entries of a work queue for the task have been written. The work distribution parameters may define a number of work queue entries needed before a cooperative thread array” (“CTA”) may be launched to process the work queue entries according to the compute task. The work distribution parameters may define a number of CTAs that are launched to process the same work queue entries. Finally, the work distribution parameters may define a step size that is used to update pointers to the work queue entries.

Abstract: Provided is a method and apparatus of selecting a preemption technique for a computation unit included in a processor to execute a second task before the at least one computation unit finishes executing a first task. The method includes receiving a preemption request, predicting a cost of preemption techniques based on a progress of the first task until receipt of the preemption request, and selecting one of the preemption techniques based on the predicted cost.

Abstract: Systems and method for forecasting release times in a multisystem software development environment are disclosed. A forecast engine may analyze the system specific data for multiple systems in a particular transport chain of systems in the development environment to determine when object code should be released from a source system to reach a target system in time to be included in an event, such as a software build or quality assurance test. The system specific data may include event schedules for each system in the transport chain. By analyzing the system specific data and the transport chain, the forecast engine can generate a time by which object code needs to be released to traverse the transport chain so that it is available to the target system for a particular scheduled event.

Abstract: Novel tools and techniques might provide for implementing applications management, based at least in part on operations, administration, and management (“OAM”) information. A host computing system might comprise a dedicated OAM management agent. While normal application frame flow might be sent or received by VMs running on the host computing system, OAM frame flow might be sent or received by the OAM management agent, which might also serve as an OAM frame generator. Alternatively, or additionally, based on a determination that at least one OAM frame has changed (in response to a change in address of far-end and/or near-end OAM server functions), the OAM management agent might update a list associating the at least one OAM frame that has changed with corresponding at least one VM of the one or more VMs, without restarting any of the at least one VM, the OAM management agent, and/or the host computing system.

Abstract: A method for dynamically configuring multiple processors based on needs of applications includes receiving, from an application, an acceleration request message including a task to be accelerated. The method further includes determining a type of the task and searching a database of available accelerators to dynamically select a first accelerator based on the type of the task. The method further includes sending the acceleration request message to a first acceleration interface located at a configurable processing circuit. The first acceleration interface sends the acceleration request message to a first accelerator, and the first accelerator accelerates the task upon receipt of the acceleration request message.

Abstract: Various systems, processes, and products may be used to manage a processor. In particular implementations, managing a processor may include the ability to determine whether a thread is pausing for a short period of time and place a wait event for the thread in a queue based on a short thread pause occurring. Managing a processor may also include the ability to activate a delay thread that determines whether a wait time associated with the pause has expired and remove the wait event from the queue based on the wait time having expired.

Abstract: Generally described, aspects of the present disclosure relate to loading an updated virtual machine monitor on the physical computing device during a boot process. The updated virtual machine monitor may be loaded from an update manager external to the virtual machine monitor, such as the offload device or a server connected with the physical computing device over a network. In certain embodiments, the updated virtual machine monitor may be loaded in a tiered process by first loading a startup virtual machine monitor, which automatically updates by loading the updated virtual machine monitor. The startup virtual machine monitor may be a virtual machine monitor with less functionality than the updated machine manager, such as where the startup virtual machine monitor may be a “lite” or simple virtual machine monitor while the updated virtual machine monitor may be a fully functional virtual machine monitor of the most recent update or version.

Abstract: Described herein is a transcompiling framework. In accordance with one aspect, the framework generates a source abstract syntax representation corresponding to source code written in a source language. The framework may determine validity of constraints of a common denominator language by parsing the source abstract syntax representation, wherein the common denominator language is a set of intersects provided by the source language and reachable by a target language. In response to determining the constraints are valid, the source abstract syntax representation may be transformed to a target syntax representation associated with the target language. The target syntax representation is then printed as transcompiled source code in the target language.

Abstract: A method, system and computer readable medium for joining multiple virtual machines (VMs). The method includes identifying a first VM executing a first operating system (OS) for joining with a second VM executing a second OS, wherein the first OS and the second OS are incompatible. A new VM having a first new disk and a second new disk is created. The method includes creating a first image of a first disk associated with the first VM and a second image of a second disk associated with the second VM, installing the first image into the first new disk and the second image into the second new disk, and configuring the new VM to include a dual boot function enabling boot up of the new VM with either the first OS or the second OS.

Abstract: A method for distributed processing involves receiving a graph (G) of targets and of influencers, with each influencer related to at least one target, receiving an action graph of actions performed by one or more of the influencers, and key partitioning G across shards. The method further involves transposing the first graph (G) to obtain a first transposed graph (GT), valuing partitioning GT across the shards, storing the action graph on multiple shards, issuing, to a shard, a request specifying an influencer, to perform an intersection, receiving a response to the request of a set of influencers each of which is related to a target, and determining whether to send a recommendation to the target based on the response.

Abstract: A computer network implemented system is provided that provides a development platform for streamlining the creation of graphical user interface having natural user interface (NUI) attributes (the “platform”). The platform is based on a novel and innovative development framework and workflow that enables the creation of executable GUI elements. A display utility provides a series of screens that provide access to functions that capture a designer's user interface design intent. A user interface is provided that allows a designer to capture the various elements and information indicative of their intent relative to the UI design, to enable creation of a series of UI assets that are encoded with sufficient information to enable their rendering with significantly reduced development effort than in prior art solutions. In one aspect, the assets referred to herein incorporate coding elements corresponding to relevant effects such as position, animation, and “look”.

Abstract: Virtualization of a physical telephone number mapping service is provided. An amount of memory needed for handling requests from users of a physical telephone number mapping service provided by a communication network is determined. A listing of different virtual machine flavors available for instantiation is searched. Each virtual machine flavor has a different respective memory capacity. A determination is made whether there is a virtual machine flavor available for instantiation that has a memory capacity adequate to handle the requests. Responsive to determining that there is a virtual machine flavor available for instantiation that has the memory capacity adequate to handle the requests, instantiation of the virtual machine flavor is initiated for handling the requests.

Abstract: A method, system and program product for providing virtual configuration management for applications running in a virtual environment. A method is described that includes: receiving a request for application configuration information from a virtual machine for an application; retrieving a versioned configuration image for the application, wherein the versioned configuration image comprises formatted configuration information captured from a previously configured application; creating a configuration runtime instance from the versioned configuration image; and attaching the configuration runtime image to the virtual machine for the application.

Abstract: A method for supporting in-flight packet processing is provided. Packet processing devices (microengines) can send a request for packet processing to a packet engine before a packet comes in. The request offers a twofold benefit. First, the microengines add themselves to a work queue to request for processing. Once the packet becomes available, the header portion is automatically provided to the corresponding microengine for packet processing. Only one bus transaction is involved in order for the microengines to start packet processing. Second, the microengines can process packets before the entire packet is written into the memory. This is especially useful for large sized packets because the packets do not have to be written into the memory completely when processed by the microengines.

Abstract: Multiple lock assemblies are distributed on a chip, each lock assembly manage a lock application message for applying for a lock and a lock release message for releasing a lock that are sent by one small core. Specifically, embodiments include receiving a lock message sent by a small core, where the lock message carries a memory address corresponding to a lock requested by a first thread in the small core; calculating, using the memory address of the requested lock, a code number of a lock assembly to which the requested lock belongs; and sending the lock message to the lock assembly corresponding to the code number, to request the lock assembly to process the lock message.

Abstract: A device includes a storage which has stored therein setting information that specifies, for each virtual machine to be created, the number of arithmetic processing unit cores that have to be allocated to a virtual machine, and group information that represents a plurality of virtual machines operating in cooperation as a group, from among the virtual machines represented by the setting information, and a virtual machine monitor, when a first virtual machine has been created, from among the virtual machines represented by the setting information, which refers to the setting information and the group information so as to allocate as many arithmetic processing unit cores as the setting information specifies to the first virtual machine, according to a rule that takes account of a decrease in operation performance of all the operable virtual machines that is associated with a failure occurring in any of the arithmetic processing units.

Abstract: Technologies for multithreaded synchronization including a computing device having a many-core processor. Each processor core includes multiple hardware threads. A hardware thread executed by a processor core enters a synchronization barrier and synchronizes with other hardware threads executed by the same processor core. After synchronization, the hardware thread synchronizes with a source hardware thread that may be executed by a different processor core. The source hardware thread may be assigned using an n-way shuffle of all hardware threads, where n is the number of hardware threads per processor core. The hardware thread resynchronizes with the other hardware threads executed by the same processor core. The hardware thread alternately synchronizes with the source hardware thread and the other hardware threads executed by the same processor core until all hardware threads have synchronized. The computing device may reduce a Boolean value over the synchronization barrier.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for assigning levels of priority to selected source code functions. One of the methods includes for each selected function, a respective associated first set of functions reachable from the selected function by at most N steps, and a respective associated second set of functions that are each reachable from the selected function by more than N steps and less than M steps are computed. A first partition having all selected functions whose respective associated first set of functions has at least one of the subject functions is computed. A second partition having selected functions not in the first partition and whose respective associated second set of functions has at least one of the subject functions is computed. Selected functions belonging to the first partition are assigned a higher priority than selected functions belonging to the second partition.

Abstract: A method for user interface (UI) automation area coverage is presented. The method extracts document information from a unit test class, the unit test class being code used to test a user interface (UI). The method searches for a keyword within the extracted document information to find a keyword match. The method receives a weight factor from a user the weight factor giving more importance to certain keywords over the other keywords. The method weights specified keywords based on a weight factor, the weight factor increasing or decreasing an importance to the specified keywords. The method assigns a weight score to each keyword match based on the number of keyword matches and the weight factor. Furthermore, the method generates a user interface report, the UI report comprising the weight score.