Abstract: A method, system, and computer program product are provided for identifying instructions to obtain representative traces. A phase instruction budget is calculated for each phase in a set of phases. The phase instruction budget is based on a weight associated with each phase and a global instruction budget. A starting index and an ending index are identified for instructions within a set of intervals in each phase in order to meet the phase instruction budget for that phase, thereby forming a set of interval indices. A determination is made as to whether the instructions within the set of interval indices meet the global instruction budget. Responsive to the global instruction budget being met, the set of interval indices are output as collection points for the representative traces.

Abstract: Mechanisms for modeling system level effects of soft errors are provided. Mechanisms are provided for integrating device-level and component-level soft error rate (SER) analysis mechanisms with micro-architecture level performance analysis tools during a concept phase of the IC design to thereby generate a SER analysis tool. A first SER profile for the IC design is generated by applying the SER analysis tool to the IC design. At a later phase of the IC design, detailed information about SER vulnerabilities of logic and storage elements within the IC design are obtained and the first SER profile is refined based on the detailed information about SER vulnerabilities to thereby generate a second SER profile for the IC design. Modifications to the IC design are made at one or more phases of the IC design based on one of the first SER profile or the second SER profile.

Abstract: Mechanisms for providing a floating display without moving electronics is provided. The mechanisms include a stationary array of light emitting elements and a moving reflective element. As the reflective element rotates, oscillates, or otherwise moves in a path relative to the array of light emitting elements, a controller controls the illumination, i.e. the pulsing on and off, of the light emitting elements based on a location of the reflective element so as to achieve a desired image, alphanumeric message, graphical display, animated display, or the like. The reflective element may be a reflective sphere having a reflective exterior surface. In this way, the electronics used to generate the floating display are kept stationary while the reflective element is moved along a path of motion to generate the floating image. This reduces the complexity and cost of the electronics needed to generate a floating image.

Abstract: Mechanisms for selective code generation optimization for an advanced dual-representation polyhedral loop transformation framework are provided. The mechanisms of the illustrative embodiments address the weaknesses of the known polyhedral loop transformation based approaches by providing mechanisms for performing code generation transformations on individual statement instances in an intermediate representation generated by the polyhedral loop transformation optimization of the source code. These code generation transformations have the important property that they do not change program order of the statements in the intermediate representation. This property allows the result of the code generation transformations to be provided back to the polyhedral loop transformation mechanisms in a program statement view, via a new re-entrance path of the illustrative embodiments, for additional optimization.

Abstract: Mechanisms for domain stretching for an advanced dual-representation polyhedral loop transformation framework are provided. The mechanisms of the illustrative embodiments address the weaknesses of the known polyhedral loop transformation based approaches by providing mechanisms for performing code generation transformations on individual statement instances in an intermediate representation generated by the polyhedral loop transformation optimization of the source code. These code generation transformations have the important property that they do not change program order of the statements in the intermediate representation. This property allows the result of the code generation transformations to be provided back to the polyhedral loop transformation mechanisms in a program statement view, via a new re-entrance path of the illustrative embodiments, for additional optimization.

Abstract: An example of a solution provided here comprises: collecting data from a plurality of probes, including at least one local probe and at least one remote probe; and reporting the data. For example, the reporting may comprise: reporting a first subset of the data that originated from a local probe; reporting a second subset of the data that originated from remote probes; and employing a similar reporting format for said first subset and said second subset. Thus comparison of data from a local probe and data from remote probes may be facilitated. Another example comprises: receiving data from at least one probe; comparing said data with at least one threshold value derived from a service level agreement; and outputting in a special mode any measured response time value that is greater than the corresponding threshold value.

Abstract: The present invention provides for authenticating a message, A security function is performed upon the message, The message is sent to a target. The output of the security function is sent to the target. At least one publicly known constant is sent to the target. The received message is authenticated as a function of at least a shared key, the received publicly known constants, the security function, the received message, and the output of the security function. If the output of the security function received by the target is the same as the output generated as a function of at least the received message, the received publicly known constants, the security function, and the shared key, neither the message nor the constants have been altered.

Abstract: Mechanisms for performing dynamic request routing based on broadcast depth queue information are provided. Each processor chip in the system may use a synchronized heartbeat signal it generates to provide queue depth information to each of the other processor chips in the system. The queue depth information identifies a number of requests or amount of data in each of the queues of a processor chip that originated the heartbeat signal. The queue depth information from each of the processor chips in the system may be used by the processor chips in determining optimal routing paths for data from a source processor chip to a destination processor chip. As a result, the congestion of data for processing at each of the processor chips along each possible routing path may be taken into account when selecting to which processor chip to forward data.

Abstract: A system and method for advanced polyhedral loop transformations of source code in a compiler are provided. The mechanisms of the illustrative embodiments address the weaknesses of the known polyhedral loop transformation based approaches by providing mechanisms for performing code generation transformations on individual statement instances in an intermediate representation generated by the polyhedral loop transformation optimization of the source code. These code generation transformations have the important property that they do not change program order of the statements in the intermediate representation. This property allows the result of the code generation transformations to be provided back to the polyhedral loop transformation mechanisms in a program statement view, via a new re-entrance path of the illustrative embodiments, for additional optimization.

Abstract: Mechanisms are provided for performing a failover operation of an application from a faulty node of a high availability cluster to a selected target node. The mechanisms receive a notification of an imminent failure of the faulty node. The mechanisms further receive health information from nodes of a local failover scope of a failover policy associated with the faulty node. Moreover, the mechanisms dynamically modify the failover policy based on the health information from the nodes of the local failover scope and select a node from the modified failover policy as a target node for failover of an application running on the faulty node to the target node. Additionally, the mechanisms perform failover of the application to the target node based on the selection of the node from the modified failover policy.

Abstract: Mechanisms for dynamically sharing performance information among multiple computing nodes are provided. One implementation involves dynamically obtaining performance information from deployments of an information technology (IT) product/solution at the computing nodes, and transmitting the obtained performance information to a server over a communication network for storing the obtained performance information in a knowledge database. The server operates to dynamically determine new configuration information based on the information in the database, store the new configuration in the database, and provide the new configuration information to the deployments by transmitting the new configuration information over the network.

Abstract: Mechanisms for stable transitions in the presence of conditionals for an advanced dual-representation polyhedral loop transformation framework are provided. The mechanisms of the illustrative embodiments address the weaknesses of the known polyhedral loop transformation based approaches by providing mechanisms for performing code generation transformations on individual statement instances in an intermediate representation generated by the polyhedral loop transformation optimization of the source code. These code generation transformations have the important property that they do not change program order of the statements in the intermediate representation. This property allows the result of the code generation transformations to be provided back to the polyhedral loop transformation mechanisms in a program statement view, via a new re-entrance path of the illustrative embodiments, for additional optimization.

Abstract: A method for automatic user authentication is described. In response to a coupling of a separate hardware security device to a data processing system, credential information for each of a plurality of applications that the user uses is received from the separate hardware security device into an authentication credential container associated with the user. A plurality of applications accessible by a user are identified by examining authentication credential container of the user. A view of the plurality of applications accessible by the user is generated. The view is a consolidated user directory that contains user authentication information across the plurality of applications. The view may then be displayed to an administrator.

Abstract: Embodiments that dynamically manage physical and virtual multipath I/O are contemplated. Various embodiments comprise one or more computing devices, such as one or more servers, having at least two HBAs. At least one of the HBAs may be associated with a virtual I/O server that employs the HBA to transfer data between a plurality of virtual clients and one or more storage devices of a storage area network. The embodiments may monitor the availability of the HBAs, such as monitoring the HBAs for a failure of the HBA or a device coupled to the HBA. Upon detecting the unavailability of one of the HBAs, the embodiments may switch, dynamically, from the I/O path associated with the unavailable HBA to the alternate HBA.

Abstract: A method for distributed computing utilizing virtual memory is disclosed. The method can include identifying a first node to process an application, identifying paging space accessible to the first node, identifying a second node to share paged data with the first node, and transacting the paged data between the first node and the identified paging space. Thus, application processing results from the first node can be stored in paging space and a second node can retrieve the first result from the paging space such that the paging space can be shared between nodes. Other embodiments are also disclosed.

Abstract: Mechanisms operable to configure, monitor and manage network devices without regard for device type and/or manufacturer are disclosed. One implementation includes a network manager unit disposed between the network administrator and the network devices. The network manager unit allows the administrator to holistically view, configure and manage an entire network without regard to device type and/or manufacturer. The administrator can implement this holistic approach with the use of a central repository for all configuration information and/or a central posting location for all network events. A device-specific command template database may be provided for providing device-specific command templates for various device types and/or manufacturers.

Abstract: An information handling system includes a processor that may perform issue queue virtual load/store instruction operations. The issue queue maintains load and store instructions with a real/virtual dependency flag. The issue queue provides storage resources for real and virtual load/store instructions. Real load/store instructions execute in a load store unit LSU. Virtual load/store instructions are pending execution in the LSU. The LSU may keep track of each virtual load/store instruction within the issue queue by thread, type, and pointer data. Provided that all dependencies are clear for a pending virtual load/store instruction, the LSU marks the pending virtual load/store instruction as real. The pending virtual load/store instruction may then issue to the LSU as a real load/store instruction.

Abstract: Mechanisms for developing Diameter applications are provided. The mechanisms extend the application server servlet model to support Diameter applications. A “base protocol” servlet is provided that handles the basic Diameter protocol functionality. Base application servlets are provided for each Diameter interface (for example, an “Sh” base servlet for the IMS “Sh” interface). These servlets are base classes for application code. The base application servlets implement additional semantics on top of the base protocol servlet to support additional attribute-value pair semantics. With the system and method, Diameter servlets share the same ServletContext as HTTP and SIP servlets. This mechanism facilitates communication between the various application entities and facilitates generation of converged applications.

Abstract: A controller of a memory system is configured to reduce power requirements during memory backup transition. When transitioning to backup mode, the memory system controller performs a number of power saving techniques. The controller may change a number of configuration settings in the volatile memory system, such as reducing output driver strength, increasing differential impedance, increasing on-die termination, disabling receiver input circuitry, and disconnecting the termination voltage network. The controller may also assert a hard reset to the storage controller system to significantly reduce the load and allow the voltage regulator to continue to provide power to the memory system for a longer period of time.

Abstract: Mechanisms for dynamically modifying a sequence of slides in a slideshow set during a presentation of the slideshow are provided. Tag metadata may be provided for each slide of a slideshow set such that this tag metadata may be used to establish logical subsets of slides within the slideshow set. Options may be provided for a user to select an interface item to obtain slides, from the current slideshow set or another slideshow set, that are associated with a currently displayed slide in the slideshow set. User interface items may be provided through which the user may temporarily redirect the sequence of the original slideshow set to incorporate one or more of these related slides and, upon termination of this “detour”, may return to the point at which the sequence diverted.