Abstract: Embodiments relate to load queue entry reuse for operand store compare (OSC) history table update. An aspect includes allocating a load queue entry in a load queue to a load instruction that is issued into an instruction pipeline, the load queue entry comprising a valid tag that is set and a keep tag that is unset. Another aspect includes based on the flushing of the load instruction, unsetting the valid tag and setting the keep tag. Another aspect includes reissuing the load instruction into the instruction pipeline. Another aspect includes based on determining that the allocated load queue entry corresponds to the reissued load instruction, setting the valid tag and leaving the keep tag set. Another aspect includes based on completing the reissued load instruction, and based on the valid tag and the keep tag being set, updating the OSC history table corresponding to the load instruction.

Abstract: In an embodiment, a system includes a processor including one or more cores and a plurality of alias registers to store memory range information associated with a plurality of operations of a loop. The memory range information references one or more memory locations within a memory. The system also includes register assignment means for assigning each of the alias registers to a corresponding operation of the loop, where the assignments are made according to a rotation schedule, and one of the alias registers is assigned to a first operation in a first iteration of the loop and to a second operation in a subsequent iteration of the loop. The system also includes the memory coupled to the processor. Other embodiments are described and claimed.

Abstract: A program trace data compression mechanism in which execution of a variable length execution set (VLES) including multiple non-branch conditional instructions are traced in real-time in a manner that allows the instruction execution to be reconstructed completely by correlating the trace data with the traced binary code.

Abstract: During a pipeline stall in a processor, until a next to complete instruction group completes, a monitoring unit receives, from a completion unit of a processor, a next to finish indicator indicating the finish of an oldest previously unfinished instruction from among a plurality of instructions of a next to complete instruction group. The monitoring unit receives, from functional units of the processor, finish reports including completion reasons for separate instructions. The monitoring unit determines at least one stall reason from among multiple stall reasons for the oldest instruction from a selection of completion reasons from a selection of finish reports aligned with the next to finish indicator from among the finish reports. Once the monitoring unit receives a complete indicator from the completion unit, indicating the completion of the next to complete instruction group, the monitoring unit stores each determined stall reason aligned with each next to finish indicator in memory.

Abstract: A system for baseboard management controller (BMC) operation is provided. The system includes a computing system including hardware on which an operating system is operable and sensors disposed to sense various attributes of the hardware and a BMC. The BMC is disposed in signal communication with the computing system and is bootable and operative independent of an execution of the operating system. Upon boot initialization of the BMC, the BMC includes an empty reserved database, issues to the computing system a query for a list of the sensors and builds and populates in the reserved database a sensor attribute repository in accordance with sensor data received from the computing system in response to the query and sensor attribute data associated with the sensor data.

Abstract: A computer system with a plurality of processors having a hardware-assisted virtualization and a memory, the computer system including a first processor group of the processors having hardware-assisted virtualization set disabled, and a second processor group of the processors and having hardware-assisted virtualization set enabled, the method having: booting a first OS by assigning the first processor group to the first OS; booting a virtual machine monitor to boot a virtual machine by assigning the second processor group to the virtual machine monitor; performed by the virtual machine monitor, booting a second OS by assigning a certain area of the memory to the second OS; and performed by the virtual machine monitor, setting a data path through which the first OS and second OS communicate with each other, the data path being set in the memory.

Abstract: The present application is directed to systems and methods for managing data in a device for hibernation states. In one implementation, the device includes an interface and a processor. The interface is coupled with a first memory and a second memory. The processor is in communication with the first and second memories via the interface. The processor is configured to read first data from the first memory, generate image data of the data stored in the first memory based on the first data, and write to the second memory prior to the device entering an initial hibernation state the image data of the data stored in the first memory. The processor is further configured to, after the device awakes from the initial hibernation state, read the image data from the second memory, reconstruct the first data based on the image data, and write the first data to the first memory.

Abstract: Embodiments of the present invention provide a method, system and computer program product for agnostic processing of message queues and sequential files. In an embodiment of the invention, a method for agnostic processing of message queues and sequential files can be provided. The method can include receiving an access request for a resource that is uniform for both a message queue and a sequential file and identifying a resource type of the resource. In response to identifying the resource type as a message queue, a corresponding access request specific to a message queue can be invoked in the message queue. Otherwise a corresponding access request specific to a sequential file can be invoked responsive to identifying the resource type as a sequential file.

Abstract: Various user interface components and features can be tested and simulated with the unified framework module, and the full application user experience can be tested, experienced and evaluated. This can assist the design process of an application in providing the ability to test and explore different user interface components. During this process the user components can be simulated to provide the user experience so it can be determined whether the user components are organized properly and the prototype can be validated before the full blown application is launched. Also user interface features can be further modified or added based on the user feedback. The unified framework module can be configured to package a program in a form that is suitable for any targeted device and/or channel to make deployment across various devices and channels more efficient and cost effective.

Abstract: A mobile terminal including a wireless communication unit configured to wirelessly communicate with at least one other terminal; a display unit configured to display screen information in a first region, and display an indicator area in a second region adjacent to the first region; and a controller configured to extract at least one keyword data included the displayed screen information, perform a search operation using the extracted keyword data, and display a result of the search operation in the second region.

Abstract: Methods and apparatus relating to pre-OS (pre Operating System) image rewriting to provide cross-architecture support, security introspection, and/or performance optimization are described. In an embodiment, logic rewrites a non-native firmware interface driver into a native firmware interface driver in response to a determination that sufficient space is available in an integrity cache storage device to store the native firmware interface driver. The logic rewrites the non-native firmware interface driver into the native firmware interface driver by performing one or more of its operations during operating system runtime. Other embodiments are also claimed and described.

Abstract: An electronic apparatus is disclosed, where the apparatus revises the micro-program thereof reliably. The apparatus provides a master and slave CPUs each having a memory. The micro-program to be revised is temporarily set in the memory of the slave CPU. Interrupting the master CPU, and connecting the slave CPU with the master CPU via an auxiliary interface independent of the inner interface (bus), the micro-program to be revised and stored in the memory of the slave CPU is transferred to the memory of the master CPU through the auxiliary interface. Auxiliary interface is cut during the normal operation of the master CPU.

Abstract: A method and related system is disclosed for emulation of a Mobile User Objective System (MUOS) ground base station. A Software Defined Radio (SDR) based architecture with interpreted scripting languages interfaces with open source software running in an embedded environment to emulate entire MUOS ground transportation segment. The ground base station emulation resides on a server remote from the MUOS enabled terminals or embedded within MUOS enabled terminals. It is transparent to the MUOS enabled terminal whether the terminal is in communication with the emulation of or the actual MUOS ground base station.

Abstract: According to one embodiment, a computerized method comprises operations of instantiating a first virtual machine instance and a second virtual machine instance to run concurrently with the first virtual machine instance. The first virtual machine instance provides a first virtual operating environment while the second virtual machine instance is adapted to share the resources allocated to the first virtual machine instance. The second virtual machine instance is further adapted to allocate additional resources upon conducting a Copy-On Write operation.

Abstract: A mechanism is provided for creating a virtual appliance. The mechanism receives input of an unmodified virtual appliance and a list of target models. The mechanism creates a modified virtual appliance with an ISO file, a conversion tool, and a list of validated target models based on the input. The modified virtual appliance is configured to boot on the ISO file containing a mini operating system working on all validated target models. Responsive to a deployment of the modified virtual appliance being triggered on a target model, the mini operating system is booted on the corresponding target model. The mini operating system determines the model of the current target model on which the mini operating system is running, and responsive to determining the current target model is a validated target model, applies modifications to an operating system of the virtual appliance in accordance with current target model to form a portable virtual appliance running on target model.

Abstract: A method and architecture of reconfiguring software mode management for a system. A prior status mode of a subsystem is identified. The primary controller includes a primary software algorithm for maintaining operations of the subsystem. A mode determination logic function is retrieved in a table for determining whether a mode change occurred. The mode determination logic function associated with the prior mode is executed. A current mode is determined from the table based on results from the execution of the mode determination logic function. An action list associated with the identified current mode in the table is identified. The action list identifies functions for transitioning the nodes from the prior mode to the current node. An action list associated with the current mode including a list of action functions for transitioning the previous mode to the current mode is executed. The table is independently modifiable from the primary software mode management algorithm.

Abstract: The described implementations relate to virtual computing techniques. One implementation provides a technique that can include receiving a request to execute an application. The application can include first application instructions from a guest instruction set architecture. The technique can also include loading an emulator and a guest operating system into an execution context with the application. The emulator can translate the first application instructions into second application instructions from a host instruction set architecture. The technique can also include running the application by executing the second application instructions.

Abstract: In an approach for removing tenant initialization check per tenant for compiled code, a processor receives a request to create a tenant. A processor creates the tenant. A processor marks a current thread of the tenant as not eligible to run just-in-time (JIT) code, wherein the marking indicates that when a method is invoked, a non-JIT version of the method is executed. A processor executes initialization of a first class from an optimization list, wherein the optimization list is a configurable list of classes to be initialized prior to running JIT code. A processor determines that class initialization has been executed for all classes on the optimization list. A processor adjusts the marking to indicate that the current thread is eligible to run JIT code and that the tenant may run JIT code that assumes, without checking, that classes on the optimization list are initialized.

Abstract: In an approach for removing tenant initialization check per tenant for compiled code, a processor receives a request to create a tenant. A processor creates the tenant. A processor marks a current thread of the tenant as not eligible to run just-in-time (JIT) code, wherein the marking indicates that when a method is invoked, a non-JIT version of the method is executed. A processor executes initialization of a first class from an optimization list, wherein the optimization list is a configurable list of classes to be initialized prior to running JIT code. A processor determines that class initialization has been executed for all classes on the optimization list. A processor adjusts the marking to indicate that the current thread is eligible to run JIT code and that the tenant may run JIT code that assumes, without checking, that classes on the optimization list are initialized.

Abstract: An approach to creating a canonical representation of a JavaScript API. Objects associated with the JavaScript API are instantiated, creating entry points for analysis. A list of discovered objects is created based on parsing a document object model associated with the JavaScript API. The objects are instrumented and statically analyzed, creating an infrastructure associated with the JavaScript API. The infrastructure is updated based on analyzing the objects while the interface is being used and the objects are executing. A canonical representation, based on the updated infrastructure, is generated for further operations.

Abstract: Techniques promote monitoring of hypervisor systems by presenting dynamic representations of hypervisor architectures that include performance indicators. A reviewer can interact with the representation to progressively view select lower-level performance indicators. Higher level performance indicators can be determined based on tower level state assessments. A reviewer can also view historical performance metrics and indicators, which can aid in understanding which configuration changes or system usages may have led to sub-optimal performance.

Abstract: Techniques for synchronizing a honey network configuration to reflect a target network environment are disclosed. In some embodiments, a system for synchronizing a honey network configuration to reflect a target network environment includes a device profile data store that includes a plurality of attributes of each of a plurality of devices in the target network environment; a virtual machine (VM) image library that includes one or more VM images; and a virtual clone manager executed on a processor that instantiates a virtual clone of one or more devices in the target enterprise network using a VM image selected from the VM image library that is customized based on one or more attributes for a target device in the device profile data store.

Abstract: Exemplary methods, apparatuses, and systems receive a request to initiate replication of a virtual machine (VM). In response to the request, a copy of the VM disk is exported to a locally attached portable storage device while the VM continues running. In response to receiving indication of the VM disk being imported from the portable storage device locally within a destination data center, the host computer determines VM data within the source data center is different from or not included within the exported copy of the VM disk and transmits the VM data to the destination data center via a network connection while the VM continues running. An indication that the virtual machine data within the destination data center is within a threshold of similarity with virtual machine data within the source data center is transmitted to the destination data center via the network connection.

Abstract: In the host operating system of a computing device, entropy data is collected based at least in part on each of one or more hardware components of the computing device. An entropy pool is updated based at least in part on the collected entropy data, and data from the entropy pool is provided to a guest operating system running as a virtual machine of the computing device. The guest operating system maintains a guest operating system entropy pool based on the data from the entropy pool provided by the host operating system. The guest operating system accesses the guest operating system entropy pool and uses the guest operating system entropy pool as a basis for generating values including random numbers.

Abstract: Systems and methods for implementing lazy disk I/O in virtual machine live migration. An example method may comprise: determining, by a first computer system, that contents of a memory page mapped into an address space of a virtual machine undergoing live migration from a second computer system to the first computer system is stored on a network-accessible virtual disk; storing, in a memory data structure, a mapping of an address of the memory page to an identifier of a location of the memory page on the virtual disk; and responsive to detecting an access to the memory page by the virtual machine, storing in a memory mapped into the address space of the virtual machine the memory page retrieved from the location of the memory page on the virtual disk.

Abstract: Systems and methods for preferentially assigning virtual machines (VMs) on a particular NUMA node with network queues on the same NUMA node are described. A load balancer process on a host assigns multiple VMs to network queues. The assignment of the VMs to a network queues is performed with a bias toward assigning VMs using a particular NUMA node to network queues on the same NUMA node. A scheduler on the host assigns VMs to NUMA nodes. The scheduler is biased toward assigning VMs to the same NUMA node as the PNIC and/or the same NUMA node as a network queue assigned to the VM.

Abstract: A method for configuring and maintaining external monitoring of one or more instances of a virtual machine within a virtualized computing environment. The method includes a computer processor monitoring a hypervisor. The method further includes a computer processor identifying a first list, wherein the first list is comprised of one or more monitoring templates respectively associated with one or more virtual machine types, and maintaining a second list comprised plurality of provisioned instances of virtual machines, wherein the second list also includes a first information respectively associated with the plurality of provisioned instances of virtual machines. The method further includes a computer processor compiling a third list and transmitting the third list to the monitoring system. The method further includes a computer processor receiving the third list and in response, a computer processor executing one or more monitoring functions based, at least in part, on the third list.

Abstract: A method for storing data from an electronic device at a plurality of storage devices of a dispersive storage area network includes communicating, from the electronic device via a virtual network connection, one or more packets to a splitting server. The method further includes splitting, at the splitting server, the data for storage on the dispersive storage area network, and communicating, from the splitting server to each of a plurality of storage servers over each of a plurality of virtual network connections, portions of the split data. The method further includes storing, at each of the storage servers, the received portions of the split data for later retrieval.

Abstract: The integrated resource management unit 202 manages some of the resources 311a, 311b, 311c and prepares a plurality of containers 310 provided as virtual resources, with respect to the application programs. In response to a predetermined request that is issued with respect to a tenant 300a or 300b that is configured to divide a resource to be used, the integrated resource management unit provides a request-source tenant with a container selected from among the plurality of containers. In the container that is provided to the request-source tenant by the integrated resource management unit, a resource, which is allocated beforehand to an application program designated by the predetermined request, is occasionally configured to have usage lower than a designated usage.

Abstract: Virtual machines are allocated among servers in a virtual environment, whereby each virtual machine has a current placement. A current fitness score is calculated for each virtual machine based on its current placement. Proposed placement plans are then generated, each plan including a proposed placement of each virtual machine. For each plan, a plan score is created. Each plan score is created by calculating a proposed fitness score for each virtual machine based on a proposed placement of that virtual machine in accordance with that plan, generating a virtual machine score for each virtual machine based on a comparison of that virtual machine's current fitness score and proposed fitness score, and then combining the virtual machine scores. The plan scores are then compared, and a target plan is selected from among the plans. The virtual machines are then reallocated among the servers in accordance with the target proposed placement plan.

Abstract: A system and method for efficiently transferring virtual machine images across nodes in a cloud computing environment, includes analyzing each image on each node to create hash code clusters and a similarity matrix. An instruction to transfer an image from a source node to a target node is received. The clusters and the similarity matrix are used to determine to what extent the data from the image is already on the source node, or on any other node, and further determines the cost and speed of transferring such data to the target node. An optimal transfer plan is generated, and data that is not already on the target node is transferred to the target node from the most efficient node on which it is available, according to the optimal transfer plan.

Abstract: A system, apparatus, and method for thread synchronization is provided. In one embodiment, a network system receives a signal from a first computing machine, and determines whether one or more processes are waiting for the signal. The network system also transmits the signal to one of the one or more processes on the first computing machine or a second computing machine to execute a thread of the process.

Abstract: Management is provided for threads of a database system that is subject to a plurality of disparate bottleneck conditions for resources. A monitor thread retrieves, from a first thread, first monitor data for first bottleneck condition of a first type. The monitor thread compares the first monitor data to a trigger level for the first bottleneck condition and then determines, in response to the comparison of the first monitor data to the trigger level, a potential source of the first bottleneck condition. A potential blocker thread is identified based upon the potential source of the first bottleneck condition. The monitor thread retrieves, from the potential blocker thread, second monitor data for a second type of bottleneck condition that is different from the first type of bottleneck condition. Based upon monitor data, a blocking thread is identified, and a particular blocking solution is applied to the blocking thread.

Abstract: A system for processing a batch job comprises a processor and a memory. The processor is configured to receive a job name for a job submitted to execute, to receive one or more job parameters, and to determine one or more nodes to run the job. The processor is configured to determine one or steps, where for each step: a step is executed on a node using a state of data associated with a start state of the step; and upon completion of executing the step, a result is stored to a durable storage. The durable storage stores the state of data associated with the start state of the step and the completion state of the step and are accessible by other execution processes as associated with either the start state of the step or the completion state of the step. The memory of the system is coupled to the processor and configured to provide processor with instructions.

Abstract: Management is provided for threads of a database system that is subject to a plurality of disparate bottleneck conditions for resources. A monitor thread retrieves, from a first thread, first monitor data for first bottleneck condition of a first type. The monitor thread compares the first monitor data to a trigger level for the first bottleneck condition and then determines, in response to the comparison of the first monitor data to the trigger level, a potential source of the first bottleneck condition. A potential blocker thread is identified based upon the potential source of the first bottleneck condition. The monitor thread retrieves, from the potential blocker thread, second monitor data for a second type of bottleneck condition that is different from the first type of bottleneck condition. Based upon monitor data, a blocking thread is identified, and a particular blocking solution is applied to the blocking thread.

Abstract: Generating a digest in a transactional memory environment for performing transactional executions, the transactional memory environment supporting transaction nesting is provided. Included is generating for a transaction, by a computer system, a computed digest based on the execution of at least one of a plurality of instructions of the transaction; based on beginning a nested transaction, executed within the transactional region of the transaction, saving a snapshot of the computed digest as a nesting level snapshot; beginning execution of the nested transaction: updating, by the computer system, the computed digest based on the execution of at least one of a plurality of instructions of the nested transaction; and based on an abort of the nested transaction, restoring the computed digest from the nesting level snapshot and restarting the nested transaction.

Abstract: An information processing apparatus includes an inclusion relation memory, a correspondence relation memory, a data type identifying unit, a software application identifying unit, and a display controller. The inclusion relation memory stores inclusion relation between multiple data types. The correspondence relation memory stores correspondence relation between the data types and software applications used in input of data. The data type identifying unit analyzes acquired information to identify a data type corresponding to an input area of the acquired information. The software application identifying unit identifies a software application corresponding to each data type included in the identified data type in accordance with the inclusion relation and the correspondence relation. The display controller displays a display part in which the identified software application is used in a display.

Abstract: Constructing a logical tree topology in a parallel computer that includes compute nodes, where each compute node includes a hardware acceleration unit and executes an identical number of tasks and the tasks of each node have a rank, includes: creating hardware acceleration groups, with each hardware acceleration group including one task from each node, where the one task from each node has the same rank; assigning one task of a root compute node as a global root of the logical tree topology; assigning tasks of the root compute node other than the global root as local children of the global root; and assigning each of the global root and local children of the root compute node as a root of a subtree of tasks, wherein each subtree comprises the tasks of a hardware acceleration group.

Abstract: Constructing a logical tree topology in a parallel computer that includes compute nodes, where each compute node includes a hardware acceleration unit and executes an identical number of tasks and the tasks of each node have a rank, includes: creating hardware acceleration groups, with each hardware acceleration group including one task from each node, where the one task from each node has the same rank; assigning one task of a root compute node as a global root of the logical tree topology; assigning tasks of the root compute node other than the global root as local children of the global root; and assigning each of the global root and local children of the root compute node as a root of a subtree of tasks, wherein each subtree comprises the tasks of a hardware acceleration group.

Abstract: An apparatus for scheduling includes a receiving unit, configured to receive a task of a job; a configuration unit, configured to configure resource amounts for the task in at least two resource dimensions respectively, wherein each of the resource dimensions represents a resource available for configuring; and an interface unit, configured to distribute the task along with information about the resource amounts configured for the task in the resource dimensions.

Abstract: The present disclosure relates to cataloging data sets for reuse in pipeline applications. One example method includes identifying a data set produced by a particular pipeline object included in a first pipeline instance, the first pipeline instance including a plurality of pipeline objects, each pipeline object configured to perform a computation, and the particular pipeline object configured to perform a particular computation; determining a set of metadata for the data set, the set of metadata including identifying information for the data set to identify the data set to pipeline instances separate from the first pipeline instance; and allowing pipeline instances separate from the first pipeline instance to retrieve the data set based at least in part on the set of metadata, wherein the pipeline instances avoid performing the particular computation by using the retrieved data set.

Abstract: A multitask workflow is proactively identified based upon user context information. For discrete tasks of the multitask workflow, modules directed to such tasks are identified from among other modules also directed to the same task, and are proactively presented to the user. Modules are selected based upon predetermined values associated with such modules, which can be indicative of capabilities, relationships, incentives associated with presentation of the modules to the user, and other like valuations. The modules offer visually enticing experiences to aid the user in performing a task, of the multitask workflow, and thereby increasing the user's interaction performance. Additionally, the modules exchange information to increase user efficiency in performing the multitask workflow.

Abstract: Dynamic pool reallocation performed by the following steps: (i) defining a plurality of resource pools including a first pool and a second pool, where each resource pool has a plurality of assigned resources; (ii) receiving a plurality of jobs to be executed; (iii) for each job of the plurality of jobs, assigning a respective resource pool, of the plurality of resource pools, to be used in completing the job; (iv) determining a preliminary schedule for executing the jobs on their respective resource pools; (v) determining whether the preliminary schedule will cause any jobs to miss service level agreement (SLA) deadlines corresponding to the job; (vi) executing the plurality of jobs on their respectively assigned resource pools; and (vii) re-assigning first resource from the second pool to the first pool during at least some of the time of the execution of the first job by the first resource pool.

Abstract: Described are techniques for providing a logical device model. In one embodiment, a a method for providing a logical device model includes providing a plurality of logical devices, at least one of said plurality of logical devices being provided by a first provider executing in kernel space and at least one of said plurality of logical devices being provided by a second provider executing in user space, and establishing a relationship between the first provider and the second provider wherein the first provider is a consumer of a logical device provided by the second provider, said logical device model including said relationship.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for allocating computing resources. In one aspect, a method includes receiving intent data specifying one or more computing services to be hosted by a computing network, requested characteristics of computing resources for use in hosting the computing service, and a priority value for each requested characteristic. A budget constraint is identified for each computing service. Available resources data is identified that specifies a set of available computing resources. A resource allocation problem for allocating computing resources for the one or more computing resources is generated based on the intent data, each budget constraint, and the available resources data. At least a portion of the set of computing resources is allocated for the one or more computing services based on results of evaluating the resource allocation problem to meet a particular resource allocation objective.

Abstract: The disclosed network resource management system employs a hardware configuration management (HCM) information handling system (IHS) that may couple to a single administered IHS or to multiple administered IHSs via an administrative network. An HCM tool in the HCM IHS may generate, modify and store hardware configuration information, including physical network identifications (PNet IDs), in an HCM database and share the HCM database with the administered IHSs. The administered IHS may be a remote direct memory access (RDMA) enabled network interface controller (RNIC) converging IHS. An RNIC converging tool may extract hardware configuration information, including PNet IDs, from the HCM database. The RNIC converging tool may utilize the hardware configuration information, including PNet IDs, to enable the RNIC converging IHS to communicate over a network with RDMA protocols.

Abstract: When executing a first kernel and a second kernel related to each other by the arithmetic unit, if an allocation attribute of a continuous write block of the first kernel and an allocation attribute of a continuous read block corresponding to the continuous write block of the second kernel are the same, a scenario determination unit executes the first kernel and the second kernel in a pipeline by using the continuous write block for execution of the second kernel through the private memory or the local memory without transferring it to the global memory. At this time, the scenario determination unit logically adds a margin attribute and a dependence attribute of the continuous read block of the second kernel respectively to a margin attribute and a dependence attribute set for the read block for each of the read block of the first kernel.

Abstract: A dynamic resource allocation method and system. The method includes the steps of preparing a plurality of instances in different preparation states; receiving a request on a dynamic scheduling condition from the client computer; and launching some of the plurality of instances in the different preparation states in such a combination that the dynamic scheduling condition is satisfied. The method includes computer apparatus for accomplishing the above method. A tangible storage medium includes program steps which, when executed by computer apparatus, causes the computer apparatus to perform the above method.

Abstract: Placement of instances of virtual machine (VM) images in a cloud computing environment is optimized. A request is received to deploy a new VM image instance. User-specific and generic VM resource usage profiles are read that include resource consumption data. Resource pool profiles for multiple resource pools are read that include resource consumption data for the resource pools. For each of the resource pool profiles, a selected VM resource usage profile is analyzed and aligned with the resource pool profiles. An aggregated resource consumption profile is calculated. A determination is made of one of multiple resource pools with the least aggregated resource consumption.

Abstract: Optimizing job scheduling in a data processing system includes determining a time factor associated with a report, determining one or more jobs that contribute to the report, and narrowing execution frequency of the one or more jobs based on the time factor of the report. The time factor provides information about timing details for data included in the report. The jobs are executed in a computing environment according to a time schedule.