Abstract: A solution is proposed for implementing a self-adapting reconciliation process. Multiple user accounts are defined on different endpoints for accessing protected resources thereof; a server centralizes the definition of the user accounts on a single point of control which is then synchronized with user account definitions on the endpoints. A dynamic reconciliator, interposed between the server and the endpoints, receives any request from the server for a reconciliation process to be completed in a predefined time-frame. The reconciliator collects the required information from the endpoints and determines an optimal time pattern for the processing of the information by the server over the time-frame according to an estimated amount of information expected to be received and an estimated workload distribution of the server in the time-frame. The reconciliator transmits the information to the server according to this time pattern.

Abstract: Mechanisms are provided for controlling a fidelity of a simulation of a system. A model of the system is received, where the model has a plurality of individual components of the system. Fidelity values are assigned to models of the individual components of the system and a simulation of the system is executed using the model of the system and the models of the individual components of the system. The simulation comprises a plurality of transactions targeting a receiver component. A history of mismatches between a fidelity value associated with the receiver component and required fidelity values of the plurality of transactions targeting the receiver component is maintained. A prediction of a fidelity value to be assigned to the receiver component based on the history of mismatches is performed. A fidelity value of the receiver component is adjusted based on results of predicting the fidelity value to be assigned to the receiver component.

Abstract: Mechanisms for memory management in a scoped memory system are provided. The scoped memory system includes a scoped memory area for the allocation of objects therein for access by one or more software threads in execution. The scoped memory area has an associated thread count for indicating that the scoped memory area is discardable. The mechanisms identify a set of root references for objects allocated in the scoped memory area and recursively traverses and marks objects that are referenced from the set of root references and that are allocated in the scoped memory area. The mechanisms further identify objects in the scoped memory area that are not so marked and discards the identified objects.

Abstract: A mechanism and functionality are provided for generating and using compiler optimized function variants. These variants may be used, for example, in situations where return values of functions called by code are not thereafter used by the code calling the functions. In particular, for a function called by computer code, at least two variants for the function may be generated. A function call, for calling the function, within original computer code may be analyzed to determine which variant of the at least two variants to use for the function call. The function call may be modified in the original computer code, to generate modified computer code, based on results of the analysis identifying which variant of the at least two variants to use for the function call.

Abstract: Mechanisms for document information acquisition and notification of duplicate document storage are provided. The mechanisms convert a physical hard copy document to an electronic form of the document and generates a first digital fingerprint of the electronic form of the document. The mechanisms further retrieve one or more second digital fingerprints for previously stored electronic forms of documents. The first digital fingerprint is compared to the one or more second digital fingerprints. Storage of the electronic form of the document is controlled based on results of comparing the first digital fingerprint to the one or more second digital fingerprints.

Abstract: A storage system in a remote copy configuration includes a redirect mechanism. The redirect mechanism determines whether to redirect read operations to a remote storage system, which is part of the remote copy configuration, based on a power management policy and a redirect policy. The redirect mechanism takes into account response time data, input/output demand, power utilization data, and input/output classes and priorities to determine whether to redirect read access requests to the remote storage system. Redirection of read operations to the remote storage system results in reduced power consumption at the local system.

Abstract: Mechanisms are provided for use with a microprocessor chip, for storing selected reliability information in an on-chip non-volatile storage device. An on-chip reliability controller coupled to one or more on-chip resources of the microprocessor chip, collects raw reliability information from the one or more on-chip resources of the microprocessor chip. The on-chip reliability controller analyzes the raw reliability information to identify selected reliability information for the one or more resources of the microprocessor chip. The on-chip reliability controller stores the selected reliability information in the on-chip non-volatile storage device. The on-chip non-volatile storage device stores the selected reliability information even in the event of an overall failure of the microprocessor chip in which the microprocessor chip loses power.

Abstract: A method for storing and retrieving blocks of data having different dimensions is disclosed. The method can include receiving a first data segment to be stored in a block storage device where the first data segment has an address. The method can also include determining if the first data segment conforms to a standard dimension and sorting the first data segment according to the destination address if it does not have a standard dimension. The method can further include placing a non-standard data segment into a unfilled block allocation and placing a second non-standard data segment into the unfilled block allocation when the second data segment has the destination identifier. Other embodiments are also disclosed.

Abstract: Methods, apparatus, and products for managing computer resources in a distributed computing system are disclosed that include registering, in a configuration management database by a discovery module in response to a modification of a resource in a resource container, the resource in association with a configuration management database identifier, the resource characterized by a resource type and a resource identification, the resource container including a manageability endpoint characterized by a manageability endpoint reference; and managing the resource by a management module in dependence upon a resource management policy and the manageability endpoint reference, the resource management policy including management actions for the resource.

Abstract: Mechanisms are provided for processing streaming data at high sustained data rates. These mechanisms receive a plurality of data elements over a plurality of non-sequential communication channels and write the plurality of data elements directly to the file system of the data processing system in an unassembled manner. The mechanisms determining whether to perform a data scrubbing operation or not based on history information indicative of whether data elements in the plurality of data elements are being received in a substantially sequential manner. The mechanisms perform a data scrubbing operation, in response to a determination to perform data scrubbing, to identify any missing data elements in the plurality of data elements written to the file system and assemble the plurality of data elements into a plurality of data streams in response to results of the data scrubbing indicating that there are no missing data elements.

Abstract: Mechanisms for enforcing reproduction rights for hard copies of physical hard copy articles are provided. The mechanisms electronically scan a surface of the physical hard copy article using a scanning mechanism to generate scanned data. A reproduction control identifier is extracted from the scanned data and output of a copy of the article is controlled based on the reproduction control identifier that was extracted from the scanned data. The physical hard copy article has a plurality of reproduction control identifiers present in multiple locations on the surface of the physical hard copy article such that content of portions of the physical hard copy article provided on the surface cannot be electronically scanned by the scanning mechanism without detecting a reproduction control identifier.

Abstract: Mechanisms for reducing the idle time of a computing device due to delays in transmitting/receiving acknowledgement packets are provided. A first data amount corresponding to a window size for a communication connection is determined. A second data amount, in excess of the first data amount, which may be transmitted with the first data amount, is calculated. The first and second data amounts are then transmitted from the sender to the receiver. The first data amount is provided to the receiver in a receive buffer of the receiver. The second data amount is maintained in a switch port buffer of a switch port without being provided to the receive buffer. The second data amount is transmitted from the switch port buffer to the receive buffer in response to the switch port detecting an acknowledgement packet from the receiver.

Abstract: Mechanisms are provided for mapping objects and object-relationships in an object-oriented programming language to a nested relational database. Entity metadata constructs for an object relational mapping framework are obtained, the entity metadata constructs mapping fields in entities of an object model to fields in a data table of the nested relational database and identifying relationships between entities in the object model. A nested relational data model of the nested relational database is obtained, the nested relational data model specifying tables and sub-tables of the nested relational database. Tables and sub-tables of the nested relational database are mapped to a plurality of separate entities of the object model. Data in the nested relational database is accessed using the plurality of separate entities. The mapping is performed without normalizing the data of the tables and sub-tables of the nested relational database to a non-nested representation.

Abstract: In one embodiment, a data structure stores information about the number of client virtual I/O adapters, the number of possible destination VIOS hosts and the number of available slots on those hosts. The information is used to iteratively assign adapters to available slots of the VIOS hosts of the destination server to which a client partition is to be migrated. A method comprises testing the data structure to determine whether conditions exist that make allocation of the adapter to a VIOS host unquestionable.

Abstract: Virus notifications based on social groups are provided. When an anti-virus program is updated, the anti-virus program informs its peers within the social group of the update. When a particular peer computing device is infected, it notifies the other anti-virus programs in the social group. The notification to the other anti-virus programs may identify which particular patches/updates are required for that particular peer computing device's anti-virus program based on the data structure that maintains the update status of the anti-virus software on each of the peer computing devices. The anti-virus programs in the social group, based on the notification of the infection from the infected computing device, may automatically perform operations for downloading any required patches and performing a scan of the peer computing device in order to isolate and remove the virus if the peer computing device has become infected.

Abstract: Mechanisms for optimizing scalar code executed on a single instruction multiple data (SIMD) engine are provided. Placement of vector operation-splat operations may be determined based on an identification of scalar and SIMD operations in an original code representation. The original code representation may be modified to insert the vector operation-splat operations based on the determined placement of vector operation-splat operations to generate a first modified code representation. Placement of separate splat operations may be determined based on identification of scalar and SIMD operations in the first modified code representation. The first modified code representation may be modified to insert or delete separate splat operations based on the determined placement of the separate splat operations to generate a second modified code representation. SIMD code may be output based on the second modified code representation for execution by the SIMD engine.

Abstract: A method (300) of editing program code is proposed. The program code consists of main instructions written in a high-level language. Typically, the program code further includes one or more sets of service instructions, which are not directly connected to a desired algorithm (such as tracing instructions for debugging purposes, performance measuring instructions, and the like). In the solution of the invention, each set of service instructions is enclosed (321-322) between a pair of predefined comments defining a starting tag and an ending tag. An editor of the program code is provided with commands for automatically disabling (341) the service instructions (converting them into corresponding comments); at the same time, the disabled instructions are condensed (340) on the monitor. Additional commands are available for automatically enabling (368) and restoring (367) the service instructions.

Abstract: Mechanisms for performing predicated atomic commits based on consistency of watches is provided. These mechanisms include executing, by a thread executing on a processor of the data processing system, an atomic release instruction. A determination is made as to whether a speculative store has been lost, due to an eviction of a memory block to which the speculative store is performed, since a previous atomic release instruction was processed. In response to the speculative store having been lost, invalidating, by the processor, speculative stores that have been performed since the previous atomic release instruction was processed. In addition, the method comprises, in response to the speculative store not having been lost, committing, by the processor, speculative stores that have been performed since the previous atomic release instruction was processed.

Abstract: Systems, methods and media for transitioning detecting content change in a streaming image system are disclosed. One embodiment provides a method for detecting a content change between image frames in a streaming image system. Embodiments may include selecting a change detection algorithm from a plurality of change detection algorithms and comparing a first image frame of m image stream with a second image frame of the image stream using the selected change detection algorithm. Embodiments may also include, in the event of detecting a content change between the first image frame and the second image frame, generating an indication of the content change. Further embodiments may include selecting the change detection algorithm based on a user's selection or system capabilities. Other further embodiments may include transmitting the indication of the content change.

Abstract: Mechanisms are provided for inhibiting precharging of memory cells of a dynamic random access memory (DRAM) structure. The mechanisms receive a command for accessing memory cells of the DRAM structure. The mechanisms further determine, based on the command, if precharging the memory cells following accessing the memory cells is to be inhibited. Moreover, the mechanisms send, in response to the determination indicating that precharging the memory cells is to be inhibited, a command to blocking logic of the DRAM structure to block precharging of the memory cells following accessing the memory cells.