Abstract: One or more of the classes is defined using an attribute or keyword that indicates that the one or more classes may be defined as singleton classes or non-singleton classes (a class that may be instantiated more than once). A compiler system converts the class to a singleton class when the compiler system receives a command or request indicating that the class is to be defined as a singleton class. Various optimizations may be performed when one or more of the classes in the source code are defined as singleton classes. The compiler system may not convert the class to a singleton class when the compiler system receives a command or request indicating that the class is to be defined as a non-singleton class.

Abstract: When launching a virtual machine on a network of server computers, a user has little ability to influence which server computer is used. The embodiments described herein allow a user to specify a parameter that can influence placement on a particular server meeting user-specified criteria. For example, the user can influence placement based on price, a manufacturer, a year that the infrastructure platform was manufactured, a chipset, a hardware card, a processor type, etc. An example API call can allow users to provide guidance on placement preference policy for selecting different generations and/or editions.

Abstract: Systems and methods are described for analyzing and verifying distributed applications. In one embodiment, an application program is executed as independently executable components. During execution, redundant portions of application program data are aggregated. A property of the application program is verified using the aggregated application program data to represent code execution paths.

Abstract: The present document discloses a method and system for realizing virtual machine mobility, comprising: in a process of establishing communication with a second virtual machine, a first virtual machine subscribing to a media access control (MAC) address change notification of the second virtual machine from an address resolution server (ARS) through a first virtual switch in a physical server where the first virtual machine is located; after the second virtual machine migrates, a second virtual switch in a physical server, to which the second virtual machine migrates, registering a corresponding relationship between an IP address of the second virtual machine and a MAC address of the second virtual switch itself to the ARS; and the ARS updating the MAC address corresponding to the IP address of the second virtual machine, and notifying the first virtual machine of the updated MAC address according to the subscription of the first virtual machine.

Abstract: A system and method for providing an abstraction of the VM environment for management and control of one or more VMs without being tied to a particular hardware platform or construct.

Abstract: Disclosed are machine processors and methods performed thereby. The processor has access to processing units for performing data processing and to libraries. Functions in the libraries are implementable to perform parallel processing and graphics processing. The processor may be configured to acquire (e.g., to download from a web server) a download script, possibly with extensions specifying bindings to library functions. Running the script may cause the processor to create, for each processing unit, contexts in which functions may be run, and to run, on the processing units and within a respective context, a portion of the download script. Running the script may also cause the processor to create, for a processing unit, a memory object, transfer data into that memory object, and transfer data back to the processor in such a way that a memory address of the data in the memory object is not returned to the processor.

Abstract: Technologies are described herein for capacity availability aware auto scaling. Capacity event auto scaling rules can be defined that specify how computing resources are to be scaled during a capacity event. The capacity event auto scaling rules can be defined to allow utilization of the computing resources to increase during a capacity event. A probability that capacity will be available for providing computing resources during a capacity event can also be computed. Standard auto scaling rules utilized by an auto scaling component can then be modified based upon the computed probability. Other types of actions might also be taken based upon the computed probability, such as reserving instances of computing resources.

Abstract: One or more embodiments of the invention display alerts provided by applications of a guest environment in a notification bar controlled by a host operating system (OS) in a host environment of a mobile device, wherein the guest environment is running in a virtual machine supported by a hypervisor running within the host environment. A hypervisor-aware service in the virtual machine registers with a guest OS to be notified when applications request presentation of alerts in a notification bar controlled by the guest OS. Upon receipt of a notification by the guest OS of an application requesting presentation of an alert in the notification bar controlled by the guest OS, the hypervisor-aware service forwards the notification to the hypervisor and the hypervisor transmits a corresponding request to a notification management component of the host OS to present the alert on the notification bar controlled by the host OS.

Abstract: Techniques are disclosed for data risk management in accessing an Infrastructure as a Service (IaaS) cloud network. More specifically, embodiments of the invention evaluate virtual machine images launched in cloud-based environments for compliance with a policy. After intercepting a virtual machine image launch request, an intermediary policy management engine determines whether the request conforms to a policy defined by a policy manager, e.g., an enterprise's information security officer. The policy may be based on user identities, virtual machine image attributes, data classifications, or other criteria. Upon determining whether the request conforms to policy, the policy management engine allows the request, blocks the request, or triggers a management approval workflow.

Abstract: Techniques for reclaiming resources from guest computing systems while those systems are waiting for responses to requests in virtualized and/or distributed computer systems are described herein. At a time after issuing a request and determining that the response will take longer than a threshold length of time, one or more computer system entities within a computer system invoke one or more computer system capabilities to at least instantiate a listener object, transfer the listener object to another system domain, suspend the guest computing system and reclaim resources from the suspended guest computing system. When the response is returned to the listener object, the guest computer system is restored and the response is forwarded to the restored guest. While the guest computing system is suspended, the reclaimed resources are made available to other computer system entities.

Abstract: Methods and apparatus to provide dynamic messaging services are disclosed. An example method of displaying information on a display screen includes determining, using a virtual machine manager, supported dimensions for display of information on the display screen; generating, using the virtual machine manager, restricted dimensions that are less than the supported dimensions; providing the restricted dimensions to an operating system of a virtual machine supported by the virtual machine manager, wherein the restricted dimensions define a boundary between a first screen portion and a second screen portion; and using the virtual machine manager to display first information in the first screen portion, the virtual machine manager enforcing the presence of the first screen portion on the display screen.

Abstract: A heterogeneous processor architecture is described. For example, a processor according to one embodiment of the invention comprises: a set of two or more small physical processor cores; at least one large physical processor core having relatively higher performance processing capabilities and relatively higher power usage relative to the small physical processor cores; virtual-to-physical (V-P) mapping logic to expose the set of two or more small physical processor cores to software through a corresponding set of virtual cores and to hide the at least one large physical processor core from the software.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for service bridges. In one aspect, a method includes a host operating system performs operations comprising: receiving, using one or more service bridges that execute in the host operating system, a plurality of requests from the one or more virtual machines, wherein each service bridge is associated with a different virtual machine of the one or more virtual machines, and wherein each request is a request to interface with one or more external services; modifying, using a respective service bridge, each request to be processed by the one or more external services; and providing each modified request from the respective service bridge to the one or more external services, where the respective service bridge communicates with the one or more external services over a network.

Abstract: Systems and methods may provide for identifying an assigned address space of a virtual machine (VM), wherein the assigned address space is associated with a graphics memory. Additionally, the assigned address space may be ballooned to disable usage by the VM of a remaining address space in the graphics memory that is not assigned to the VM. In one example, a view of the assigned address space by the VM may be identical to a view of the assigned address space by a virtual machine monitor (VMM) associated with the VM.

Abstract: The present invention relates to an apparatus and a method for validating application deployment topology in a cloud environment. There is provided an apparatus for validating application deployment topology in a cloud environment comprising: a topology skeleton generator configured to generate, based on multiple VMs and script packages running on the VMs created by a user and required to deploy an application as well as running order of script packages and data dependency between script packages set by the user, a topology skeleton that comprises at least scripts of script packages of respective VMs and running order of the script packages; and a simulator configured to simulate a runtime environment in the cloud environment at the apparatus, thereby validating the running order and data dependency with respect to the topology skeleton, wherein the simulator is installed in the apparatus by using a simulator installation package retrieved from the cloud environment.

Abstract: A task comprising at least a first subtask on a computer system is analyzed. As part of the analysis, a profiler controller transmits a first profile instruction to a first profiler instance. The profiler controller transmits a second profile instruction to a second profiler instance. In response to the first profile instruction, the first profiler instances embeds a first task identifier into a first subtask request sent by a first virtual machine. In response to the second profile instruction, the second profiler instance captures the first task identifier from the first subtask request received by a second process virtual machine. The profiler controller identifies an execution instance of the task of the computer system based on the first copy and the second copy of the first task identifier received from the first profiler instance and the second profiler instance, respectively.

Abstract: An illustrative method for validating integrity of a source server backup includes receiving, at a recovery server, data indicating a state of a data storage unit associated with a source server, creating a virtual hard drive image from the received data, and storing, in memory of the recovery server, the created virtual hard drive image. The method also includes booting a virtual machine using the stored hard drive image and mounting a second drive image to the virtual machine including tools facilitating access to an operating system running on the virtual machine by an application running on the recovery server. The tools are prevented from being installed in an operating system running on the source server.

Abstract: Embodiments relate to thread-based cache content savings for task switching in a computer processor. An aspect includes determining a cache entry in a cache of the computer processor that is owned by the first thread, wherein the determination is made based on a hardware thread identifier (ID) of the first thread matching a hardware thread ID in the cache entry. Another aspect includes determining whether the determined cache entry is eligible for prefetching. Yet another aspect includes, based on determining that the determined cache entry is eligible for prefetching, setting a marker in the cache entry to active.

Abstract: A transactional memory system determines whether to pass control of a transaction to an about-to-run-out-of-resource handler. A processor of the transactional memory system determines information about an about-to-run-out-of-resource handler for transaction execution of a code region of a hardware transaction. The processor dynamically monitors an amount of available resource for the currently running code region of the hardware transaction. The processor detects that the amount of available resource for transactional execution of the hardware transaction is below a predetermined threshold level. The processor, based on the detecting, saves speculative state information of the hardware transaction, and executes the about-to-run-out-of-resource handler, the about-to-run-out-of-resource handler determining whether the hardware transaction is to be aborted or salvaged.

Abstract: Techniques are provided for restoring thread groups in a cooperative thread array (CTA) within a processing core. Each thread group in the CTA is launched to execute a context restore routine. Each thread group, executes the context restore routine to restore from a memory a first portion of context associated with the thread group, and determines whether the thread group completed an assigned function prior to executing the context restore routine. If the thread group completed an assigned function prior to executing the context restore routine, then the thread group exits the context restore routine. If the thread group did not complete the assigned function prior to executing the context restore routine, then the thread group executes one or more operations associated with a trap handler routine. One advantage of the disclosed techniques is that the trap handling routine operates efficiently in parallel processors.

Abstract: There is disclosed a method for controlling a terminal including starting to record tasks, creating a task list by recording the tasks, when a plurality of tasks are implemented sequentially, ending the recording of the task, wherein the task list comprises an interrupt task configured to pause the task implementation and to allow the next task implemented when there is an additional input, such that the task list configured of the series of the tasks used by the user frequently may be created and the task list may be implemented automatically, only to perform the functions used frequently performed quickly.

Abstract: A backoff polling algorithm may use a minimum polling interval which represents an amount of time between repeated polls of a job step queue. When polled, the job step queue may indicate a number of job steps scheduled to execute currently. Additionally, the backoff polling algorithm may repeatedly poll the job step queue at the current polling interval and execute any job steps indicated until the step queue indicates that the number of job steps scheduled to execute currently is below a minimum threshold. While the indicated number of job steps is below the minimum threshold, the backoff polling algorithm may repeatedly increase the polling interval up to a predetermined maximum polling interval and poll at each increased interval until the indicated number of job steps is above the minimum threshold. The backoff polling algorithm may then decrease the polling interval to the minimum polling interval.

Abstract: A runtime management system is described herein that allows a hosting layer to dynamically control an underlying runtime to selectively turn on and off various subsystems of the runtime to save power and extend battery life of devices on which the system operates. The hosting layer has information about usage of the runtime that is not available within the runtime, and can do a more effective job of disabling parts of the runtime that will not be needed without negatively affecting application performance or device responsiveness. The runtime management system includes a protocol of communication between arbitrary hosts and underlying platforms to expose a set of options to allow the host to selectively turn parts of a runtime on and off depending on varying environmental pressures. Thus, the runtime management system provides more effective use of potentially scarce power resources available on mobile platforms.

Abstract: A resource management node includes a processor and a memory coupled to the processor. The memory includes computer readable program code that when executed by the processor causes the processor to perform operations. The operations can include identifying an unproductive group of guest virtual machines (VMs) that satisfy a defined rule for being unproductive on an first group of physical host machines based on infrastructure of a distributed computing system used by the first group of the physical host machines to host the guest VMs. A relocation scenario is generated for relocating the unproductive group of the guest VMs from the first group of the physical host machines to a second group of the physical host machines. An effect of the relocation scenario on infrastructure usage of the distributed computing system is estimated.

Abstract: A job execution scheduling system and associated methods are provided for accommodating a request for additional computing resources to execute a job that is currently being executed or a request for computing resources to execute a new job. The job execution scheduling system may utilize a decision function to determine one or more currently executing jobs to select for resizing. Resizing a currently executing job may include de-allocating one or more computing resources from the currently executing job and allocating the de-allocated resources to the job for which the request was received. In this manner, the request for additional computing resources is accommodated, while at the same time, the one or more jobs from which computing resources were de-allocated continue to be executed using a reduced set of computing resources.

Abstract: A technique for allocating a global resource in a distributed grid environment includes: a master resource manager (MRM) that receives from slave resource managers use and demand data associated with a global resource by each consumer in a region controlled by a respective slave resource manager. The MRM computes an allocation of the resource for each consumer and for each region by determining a total amount of the resource to allocate, estimating a need by each consumer for the resource based on the use and demand data, determining an allocation of the total amount of the resource among the consumers based on the estimated need; subdividing the allocation for each consumer among each region where the consumer utilizes the resource; and computing a total allocation of the resource for each region.

Abstract: Provided is a computing system having a hierarchical memory structure. When a data structure is allocated with respect to a task processed in the computing system, the data structure is divided and a portion of the data structure is allocated to a high speed memory of the hierarchical memory structure and a remaining data structure is allocated to a low speed memory of the hierarchical memory.

Abstract: Embodiments include methods, systems and computer program products for providing an extendable job structure for executing instructions on an accelerator. The method includes creating a number of data descriptor blocks, each memory location addresses and a pointer to a next of the number of the data descriptor block. The method further includes creating a last data descriptor block having memory location addresses and a last block indicator. Based on determining that additional memory is required for executing instructions on the accelerator, the method includes modifying the last data descriptor block to become a data extender block having a pointer to one of one or more new data descriptor blocks and creating a new last data descriptor block.

Abstract: A computer system having a plurality of processing resources, including a sub-system for scheduling and dispatching processing jobs to a plurality of hardware accelerators, the subsystem further comprising a job requestor, for requesting jobs having bounded and varying latencies to be executed on the hardware accelerators; a queue controller to manage processing job requests directed to a plurality of hardware accelerators; and multiple hardware queues for dispatching jobs to the plurality of hardware acceleration engines, each queue having a dedicated head of queue entry, dynamically sharing a pool of queue entries, having configurable queue depth limits, and means for removing one or more jobs across all queues.

Abstract: An architecture for a load-balanced groups of multi-stage manycore processors shared dynamically among a set of software applications, with capabilities for destination task defined intra-application prioritization of inter-task communications (ITC), for architecture-based ITC performance isolation between the applications, as well as for prioritizing application task instances for execution on cores of manycore processors based at least in part on which of the task instances have available for them the input data, such as ITC data, that they need for executing.

Abstract: A resource management node includes a processor and a memory coupled to the processor. The memory includes computer readable program code that when executed by the processor causes the processor to perform operations. The operations can include, for each of a plurality of guest virtual machines (VMs), determining operational resources of physical host machines available in a distributed computing system that are needed to provide the guest VM. The operations can further include determining an amount of infrastructure of a distributed computing system used by a defined placement of physical host machines in racks of the distributed computing system.

Abstract: The disclosed embodiments provide a system that prevents oscillatory load behavior for a multi-node distributed system. During operation, the system uses a load-balancing policy to distribute requests to nodes of the distributed system. The system determines operational characteristics for the nodes as they process a set of requests, and then uses these operational characteristics to compute machine queuing models that describe the machine state of each node. The system then uses this machine state for the nodes to determine whether the load-balancing policy and the distributed system are susceptible to oscillatory load behavior.

Abstract: Sending, by a node requesting information regarding a resource to one or more nodes in a distributed computing system, an active message to perform a collective operation; contributing, by each node not having a resource, a value of zero to the collective operation; contributing, by a node having the resource, the node's rank; storing the result of the collective operation in a buffer of the requesting node; and identifying, in dependence upon the result of the collective operation, the rank of the node having the resource.

Abstract: Map reduce processing is performed holistically, to yield map reduce results data, on an aggregated group of data sets, which had been generated and maintained with “splits” separating the separate date sets, rather than being performed separately on the split data sets and then aggregating (or attempting to aggregate) the map reduce processing results.

Abstract: Tools and techniques for managing virtual machines, including without limitation virtual machines running in a cloud computing environment. Certain tools provide a user interface that allows a user to browse machine images to find an image that meets the user's needs. In some aspects, these tools and techniques can provide the ability for users to customize machine images to meet their own needs and/or to share their customized machine images with other users. In other aspects, these tools and techniques can provide users with the ability to export virtual machines for use on an actual computer system.

Abstract: A storage module holds load information obtained by classifying a load on each of virtual machines into groups depending on a fluctuation characteristic. An allocation schedule creation module predicts the load on each of the virtual machines during a predetermined period based on the load information and a rule defined for each of the groups, determining, for each of the groups, an allocation amount of the physical computing resource to be allocated to at least one of the virtual machines classified into the each of the groups and a time slot for allocation based on the predicted load on each of the virtual machines, and creating a schedule including information on the allocation amount and the time slot that have been determined. A schedule execution module allocates the physical computing resource to each of the virtual machines based on the schedule.

Abstract: Exemplary method, system, and computer program product embodiments for full exploitation of parallel processors for data processing are provided. In one embodiment, by way of example only, a set of parallel processors is partitioned into disjoint subsets according to indices of the set of the parallel processors. The size of each of the disjoint subsets corresponds to a number of processors assigned to the processing of the data chunks at one of the layers. A transition function is devised from the indices of the set of the parallel processors at one time steps to the indices of the set of the parallel processors at a following time step.

Abstract: According to one embodiment system and method provides executing at least a portion of a cloud computing task on a client terminal. The system and method further includes checking whether the client terminal is recharging or not and accessing a server for executing the cloud computing task if the terminal is recharging.

Abstract: Systems and methods for operating software data structures are provided. In one embodiment, lock-free dual queues with conditional synchronization and time-outs are described. The lock-free dual queues of various embodiments of the present invention are accessible by one or more consumer threads and one or more producing threads. The consuming threads are able to access and remove elements from the queue while the producing threads are able to access and add elements to the queue. In some cases, a thread may be both a consuming thread and a producing thread. The add and remove operations of various embodiments of the present invention, generally operate by using conditional synchronization primitives which modifies a value in shared memory to a specified value if the previous value is what was expected.

Abstract: A memory access method is disclosed for computing n parallel threads that invoke one original execution module. The method includes determining a number k (n?1?k?1) of k mirror execution modules to be created based on the number of n parallel threads. The method includes determining a mapping policy F between n threads and k+1 execution modules. The k+1 execution modules refer to the original execution module and the k mirror execution modules. The method includes creating the k mirror execution modules and allocating individual private memory to each of the k mirror execution modules. The method includes executing the n parallel threads and making each thread invoke the execution module according to the mapping policy F, with each execution module only accessing its private memory pool. The method includes, after the n parallel threads are finishing executing, deleting the k mirror execution modules and releasing the resources.

Abstract: An environment manager includes a set of consolidated and integrated utilities which allow an administrator direct, remote access to information technology resources. The environment manager allows the administrator to control many aspects of the information technology environment including backup and archival of data systems, monitoring of systems, opening and closing of information technology systems, server fail-overs and virtual server environments, managing expert application, desktop management and security and system security.

Abstract: Methods and devices for detecting suspicious or performance-degrading mobile device behaviors may include performing behavior monitoring and analysis operations to intelligently, dynamically, and/or adaptively determine the mobile device behaviors that are to be observed, the number of behaviors that are to be observed, and the level of detail or granularity at which the behaviors are to be observed. Such behavior monitoring and analysis operations may be performed continuously (or near continuously) in a mobile device without consuming an excessive amount of processing, memory, or energy resources of the mobile device by identifying hot application programming interfaces (APIs) and hot action patterns that are invoked or used most frequently by software applications of the mobile device and storing information regarding these hot APIs and hot action patterns separately and more efficiently.

Abstract: Method and software architecture for providing data-change alerts corresponding to data changes in a data system to external (of the data system) applications. A computer user interface is provided to enable a user to identify user interface (UI) objects corresponding to a user interface of an application used to access the data system to provide data-change alert support for. For example, the UI objects may comprise screens, views, applets, fields, and columns. Based on the alert-enabled UI objects, data-change alert triggers are generated to monitor for data-change events (e.g., inserts, updates, and deletes) that cause changes to data in the data system corresponding to those alert-enabled UI objects. In response to data changes in the data system corresponding to alert-enabled UI objects, appropriate triggers are executed to initiate generation of data-change alerts comprising data values that have been changed. The data-change alerts are then pushed to the external application.

Abstract: A method and system are provided for concurrent message processing. The system includes: an input queue capable of receiving multiple messages in a given order; an intermediary for processing the messages; and an output queue for releasing the messages from the intermediary. Means are provided for retrieving a message from an input queue for processing at the intermediary and starting a transaction under which the message is to be processed. The intermediate logic processes the transactions in parallel and a transaction management means ensures that the messages are released to the output queue in the order of the messages in the input queue.

Abstract: Processing a request from a sending computer that is a co-member of a message group of a sysplex coupled together using a signaling service includes determining, by a receiving computer, that a signaling service message has been received from the sending computer, wherein the signaling service message relates to a data transfer between the sending computer and the receiving computer and wherein the data transfer relates to an exchange of one or more files between the sending and receiving computers using a communications channel other than the signaling service. This processing also includes decoding, by the receiving computer, the signaling service message to determine contents of the signaling service message related to the data transfer; and performing, by the receiving computer, an action related to the data transfer based on the contents of the signaling service message.

Abstract: Illustrative embodiments of methods, machine-readable media, and parallel computing systems that automatically tune a communication protocol are disclosed.

Abstract: A message processing apparatus that processes a message between processors according to an embodiment of the present invention solves a problem that occurs when a message is processed by using interrupt or polling processing by processing messages having priorities that are transmitted between transmission and receiving processors that use a shared memory by using a polling thread and a kernel module, thereby providing a priority-based message processing method without applying a load to a system.

Abstract: A semiconductor memory device includes a plurality of data input/output pads configured to transmit and receive data to and from memory cells, an alert pad configured to output data error information while the data is transmitted and received, and a monitoring device configured to output the data error information to the alert pad in a first mode and to output monitoring information to the alert pad in a second mode.

Abstract: A method is described that includes detecting that a memory access of system management mode program code is attempting to reach program code outside of a protected region of memory by comparing a target memory address of a memory access instruction of the system management program code again information that defines confines of the protection region. The method also includes raising an error signal in response to the detecting.

Abstract: A data storing method, a memory control circuit unit, and a memory storage apparatus are provided. The method includes recording a bit error count of every predetermined area of every physical erasing unit and determining whether the bit error count of one of the predetermined areas of the physical programming unit of the physical erasing unit is more than a threshold bit error count. If the bit error count of one of the predetermined areas of the physical programming unit of the physical erasing unit is more than the threshold bit error count, the method also includes storing data under a second programming mode after an erasing operation is performed on the physical easing unit. Accordingly, defective physical erasing units may be effectively employed to prolong the lifespan of the memory storage apparatus.