Abstract: This technology relates to a device and method for determining co-locatability of a plurality of virtual machines on one or more physical infrastructures. The plurality of virtual machines hosts a plurality of workloads. This involves identifying workloads which have high variability from the time series data and determining the workload capacity threshold of the identified workloads. Thereafter, the candidate workloads are selected among the identified workloads to colocate on a virtual machine based on the workload variability. After that, the total capacity required by each candidate workload pair to meet the service requirement is determined based on the workload capacity threshold. Then, an optimal sharing point of each workload of the pair with respect to the other workload of the pair is identified. Further, percentage compatibility of each workload pair is determined and finally, the candidate workloads are colocated based on the optimal sharing point and percentage compatibility.

Abstract: Embodiments include dividing source code for an application into multiple program fragments by generating a control flow graph for the multiple program fragments. The control flow graph represents a graph structure with nodes representing the multiple program fragments and edges representing an execution order of the program fragments. Aspects include searching for a chosen assertion statement within a program fragment, wherein the chosen assertion statement must be satisfied for correct execution of the chosen program fragment. Aspects also include identifying an immediate parent program fragment for the chosen program fragment using the control flow graph and calculating an immediate parent assertion statement for the immediate parent program fragment using the chosen assertion logic statement. The immediate parent assertion statement is an over-approximate pre-condition of the chosen program fragment.

Abstract: A pre-initialized value of contents of a memory location is identified. A load value of contents loaded from the memory location by execution of a first instruction that loads from the memory location is also identified. A comparison is made between the load value and the pre-initialized value. Based on the comparison, a determination is made that the load value and the pre-initialized value are the same. In response to this determination, it is indicated that the first instruction contains an uninitialized memory reference.

Abstract: A compiler includes a vector instruction processing mechanism that generates instructions for vector instructions in a way that assures correct operation in a bi-endian environment, wherein the processor architecture contains instructions with an inherent endian bias, along with at least one memory access instruction with a contrary endian bias. The compiler uses a code generation endian preference that matches the inherent computer system endian bias. The compiler generates instructions for vector instructions by determining whether the vector instruction has an endian bias that matches the code generation endian preference. When the endian bias of the vector instruction matches the code generation endian preference, the compiler generates one or more instructions for the vector instruction as normal.

Abstract: A system and method are disclosed for controlling a restricted ecosystem of software applications. The method may include originating software applications from a vendor, associating a collection of the software applications with a user, controlling the distribution of the collection of software applications to the user, controlling access to the collection of software applications based on user credentials, and controlling the installing and updating of the collection of software applications. The method may additionally include executing a first software application from the collection of software applications, executing a second software application, and transferring data from the first software application to the second software application. The method may additionally include transferring data from the first software application to a web service.

Abstract: Heterogeneous thread scheduling techniques are described in which a processing workload is distributed to heterogeneous processing cores of a processing system. The heterogeneous thread scheduling may be implemented based upon a combination of periodic assessments of system-wide power management considerations used to control states of the processing cores and higher frequency thread-by-thread placement decisions that are made in accordance with thread specific policies. In one or more implementations, a system workload context is periodically analyzed for a processing system having heterogeneous cores including power efficient cores and performance oriented cores. Based on the periodic analysis, cores states are set for some of the heterogeneous cores to control activation of the power efficient cores and performance oriented cores for thread scheduling.

Abstract: A computer system includes one or more field programmable gate arrays as a coprocessor that can be shared among processes and programmed using hardware libraries. Given a set of hardware libraries, an update process periodically updates the libraries and/or adds new libraries. One or more update servers can provide information about libraries available for download, either in response to a request or by notifying systems using such libraries. New available libraries can be presented to a user for selection and download. Requests for updated libraries can arise in several ways, such as through polling for updates, exceptions from applications attempting to use libraries, and upon compilation of application code.

Abstract: Functional use-case generation may include determining whether a requirements context is available. In response to a determination that the requirements context is available, the requirements context may be determined as a task context and as a rule context for a requirements sentence of a requirements document. The task context and the rule context may be used to select a functional model from a plurality of functional models. A functional use-case that includes an entity that is to perform a task based on a rule may be generated. Further, in response to a determination that the requirements context is not available, a functional model may be selected from the plurality of functional models based on process context, where the functional model includes a process related to the process context, and the functional model that includes the process related to the process context may be used to generate the functional use-case.

Abstract: An application distribution server may be operable to select a plurality of data processing devices which are capable of receiving application updates. One or more experimental versions of an application may be communicated by the application distribution server to each of the selected plurality of data processing devices during an update process of the application. The application distribution server may cause collection of performance information associated with the one or more experimental versions. The application distribution server may then cause communication of the collected performance information to a developer of the application for analysis.

Abstract: Modeling an enterprise architecture includes associating a plurality of desired business capabilities with a plurality of requirements and associating each of a plurality of technology components with one or more of the plurality of requirements, based on a respective technology supporting the one or more requirements. Then a model may be constructed that includes linking each of the technology components with one or more of the desired business capabilities based on the associating of the plurality of desired business capabilities with the plurality of requirements and the associating of each of the plurality of technology components with one or more of the plurality of requirements.

Abstract: The present disclosure relates to flexible processor association for virtual machine instances. One example method includes initializing a virtual machine instance on a particular computing device, the particular computing device including a plurality of physical processors, determining a maximum number of the physical processors available to be associated with the virtual machine instance; initializing a number of virtual processors for use by the virtual machine instance, the same as the maximum number of the physical processors; associating the virtual machine instance with a number of the physical processors less than the maximum number of the physical processors; during execution of the virtual machine instance: identifying a change in a demand metric associated with the virtual machine instance; and adjusting the number of the physical processors associated with the virtual machine instance based on the identified change in the demand metric while maintaining the number of virtual processors.

Abstract: Methods, systems, and computer program products for providing fair unidirectional multi-queue virtual machine migration are disclosed. A computer-implemented method may include maintaining a current scan identifier for each of a plurality of streams used to migrate a virtual machine from a first hypervisor to a second hypervisor, determining when a current scan identifier of a first stream and a current scan identifier of a second stream are associated with different memory states of the virtual machine, and adjusting processing of memory updates when the current scan identifiers are associated with different memory states of the virtual machine. The adjusting may be performed, for example, by pausing processing on each stream having a current scan identifier subsequent to the earliest current scan identifier determined for the streams, and processing memory updates on each stream having a current scan identifier matching the earliest current scan identifier.

Abstract: The present invention comprises systems and methods, and computer readable media comprising the methods, for updating software applications. The systems and methods of the present invention provide automation and flexibility to the updating process. Processor usage and network usage are monitored and software updates are initiated and/or continued during periods where processor and/or network usage are low. The update process may be halted when the processor and/or network connection are called upon for other uses. Processor and/or network usage may also be throttled, for example limiting the bandwidth available for the download to maintain sufficient processor share and/or bandwidth for other tasks. Adverse impact on a computer user is minimized.

Abstract: When queuing work items for asynchronous execution, the approaches set forth herein enable a debugger to provide more meaningful and complete stack trace information for enqueued work items. An example system identifies a work item to be enqueued for asynchronous execution as a separate thread during runtime of a program. Upon enqueuing the work item in an execution queue, the system captures pre-queue stack trace information associated with the work item, and associates the pre-queue stack trace information with the work item. The system removes the work item from the execution queue for execution, wherein the execution is associated with current stack trace information separate from the pre-queue stack trace information. Upon detecting an event associated with executing the work item, the system merges the pre-queue stack trace information with the current stack trace information to yield a merged stack trace.

Abstract: Systems and methods generate a modified application data structure that provides a customized modeling of physical systems in response to customized user inputs received via application feature(s) for new window form(s). The modified application data structure is generated from guided user inputs received through application builder wizard graphical user interface(s). The systems and methods include embedding a multiphysics model data structure in an initial application data structure and defining new window form(s). Window form data representing the defined new window forms is added to the initial application data structure. User-selectable application feature options are displayed in the application builder wizard graphical user interface(s) and application feature data is added to the initial application data structure to create a modified application data structure. The added application features can include data representing widget(s), form feature(s), and command sequence(s).

Abstract: Systems and methods for a device connected to a private network to efficiently retrieve a software/firmware update. The device may retrieve an update scheme that defines an external Uniform Resource Identifier (URI) for a resource external to the private network and a primary URI for a primary resource connected to the private network. The device may compare own Internet Protocol address and the primary URI to determine whether or not the device is the primary resource. When the device is the primary resource, the device may retrieve the software/firmware update from the external URI.

Abstract: A software update system includes an administration server, a wireless communication terminal, and a wireless-communication key station. The wireless communication terminal is configured to be connected to the administration server through a communication network. The a wireless-communication key station is configured to be positioned between the administration server and the wireless communication terminal, and to perform processing of distributing software of an update object transmitted from the administration server to the wireless communication terminal.

Abstract: A mechanism is provided for managing one or more virtual appliances on a computing system. For a specific virtual appliance, profile information indicative of a set of profiles of the specific virtual appliance is retrieved, status information indicative of a status of the computing system is retrieved, and constraint information indicative of one or more constraints applicable to one or more software programs of the specific virtual appliance on the computing system is retrieved. A determination is made of a configuration scheme of the specific virtual appliance according to the profile information, the status information, and the constraint information. The configuration scheme a specific profile of the set of profiles of the specific virtual appliance having the one or more software programs thereof compliant with the applicable constraints. The specific virtual appliance is configured according to the configuration scheme.

Abstract: A method for determining and then abstracting the requirements for the interface between virtual network entity or element (VNE) and Network Hypervisor (NHV) is described. The abstraction helps creation of an open and interoperable VNE-NHV environment because suitable interworking Apps for interface can now be easily invoked on the basis of instantaneous demands from the services. Automation of configuration together with assignment of VNEs mitigates the impact of limitation of resources in any network. Once an NHV is created and the VNEs—irrespective of their domains—are attached to it, the VNEs can be utilized by the services seamlessly.

Abstract: A self-describing function object may be dynamically created based on a set of user provided parameters. In an implementation, a device may receive a request to create the function object based on one or more parameters and determine a number of ordered and hierarchical operations that correspond to the function object. The device may determine textual descriptions corresponding to what is performed by at least one of the ordered and hierarchical operations. The device may output documentation of the ordered and hierarchical operations included in the function object, the documentation including the textual descriptions arranged based on the determined order of the plurality of ordered and hierarchical operations.