Abstract: Provided are a method, system, and article of manufacture. A first process creates a second process. A cipher is generated. The first process is terminated. Access is controlled to the generated cipher.

Abstract: A method of dynamically allocating a variable in a tracing framework, including allocating a dynamic memory in the tracing framework having a plurality of data chunks, placing at least one of the plurality of data chunks onto a free list, allocating the at least one of the plurality of data chunks on the free list to store the variable and removing the at least one of the plurality of data chunks from the free list, deallocating the at least one of the plurality of data chunks and placing the at least one of the plurality of data chunks on a dirty list, and cleaning the at least one of the plurality of data chunks on the dirty list using a cleaning procedure to place the one of the plurality of data chunks on the free list.

Abstract: Methods, systems, and articles of manufacture consistent with the present invention provide for managing and predicting risk for computer-based systems. Information about a computer-based system is asynchronously received. A risk level at which the computer-based system operates is calculated based on the received information.

Abstract: A method for controlling hot-plug behavior includes identifying a hot-plug event caused by a hot-plug device; generating hot-plug threads that execute a hot-plug operation; executing a finite state machine state sequence to regulate hot-plug threads involved in the hot-plug operation; and completing the hot-plug operation at the end of the finite state machine state sequence. A computer usable medium has computer readable program code embodied therein for causing a computer system to execute the method for controlling hot-plug behavior. A hot-plug control system for a computer system includes a hot-plug device; a set of hot-plug threads that regulate operations in the hot-plug device; and a finite state machine that controls execution of instructions using the set of threads.

Abstract: One embodiment of the present invention provides a system that selectively monitors store instructions to support transactional execution of a process, wherein changes made during the transactional execution are not committed to the architectural state of a processor until the transactional execution successfully completes. Upon encountering a store instruction during transactional execution of a block of instructions, the system determines whether the store instruction is a monitored store instruction or an unmonitored store instruction. If the store instruction is a monitored store instruction, the system performs the store operation, and store-marks a cache line associated with the store instruction to facilitate subsequent detection of an interfering data access to the cache line from another process. If the store instruction is an unmonitored store instruction, the system performs the store operation without store-marking the cache line.

Abstract: A computer readable medium includes executable instructions for transforming a graphical user interface by accessing a transformation mode of the graphical user interface, where the graphical user interface includes multiple graphical elements, selecting a first graphical element from the multiple graphical elements, receiving a transformation value associated with a transformation of the first graphical element, and applying the transformation to the first graphical element to obtain a transformed graphical user interface.

Abstract: A heatsink includes a heatsink base, an elastomeric base, multiple slider pins and an alignment frame coupled to the heatsink base. The elastomeric base includes multiple holes, the elastomeric base coupled to the perimeter of the heatsink base. Each of the slider pins secured in one of the holes in the elastomeric base. The alignment frame supporting and aligning the slider pins as the slider pins move in a direction substantially perpendicular to the heatsink base. A method of assembling a heat spreader is also described.

Abstract: A system and method provide testing of software in different configurations automatically. Templates may be provided for developers to create an application or for generating tests. One or more tests may be generated for testing the application. The testing scope may range between a plurality of configurations for the application in one or more environments. Tests may include test blocks corresponding to parts of the application for testing according to the execution order of the parts of the application. Tests may change input values, modules in the application, configuration settings, data types, communication parameters, and/or other application elements for testing. Such changes may be generated automatically during testing. Test code may be inserted in the application for testing. Application generation and compilation may be automated during testing. Deployment and undeployment of applications may also be automated for testing.

Abstract: A method and apparatus for dynamically allocating data buffers to a data structure is provided. According to one aspect of the invention, the amount of log data that is being stored within data buffers associated with a data structure is monitored. Based on the amount of log data that is being stored within the data buffers, a determination is made as to whether additional data buffers need to be linked into the data structure. If it is determined that additional data buffers do need to be linked to the data structure, one or more free buffers are identified and linked into the data structure.

Abstract: An invention is provided for reducing cache conflict misses via specific placement of non-split functions and data objects in main memory based on cache size. A cache size of a computer cache memory is determined, and a first data block is placed within a main computer memory. The first data block includes a first sub-block that will be frequently referenced. In addition, the first sub-block ends at a first ending address. A second data block is then placed within the main computer memory. The second data block includes a second sub-block that will be frequently referenced, and is placed such that the second sub-block will be contiguous with the first sub-block in the computer cache memory during execution.

Abstract: A server blade may comprise a processor and a network interface. The network interface can be configured to be connected to a network remote to the server blade. The server blade may be configured to detect a malicious code occurrence in traffic on the network. The server blade may be further configured as a field replaceable unit. Optionally, the server blade may further comprise an enclosure which encloses the processor.

Abstract: A method and apparatus for determining the size of a keeper transistor in a dynamic circuit is provided. A first portion of a dynamic circuit, comprising the keeper transistor, is analyzed to determine keeper current data that describes what size the keeper transistor would need to be to supply a specified amount of keeper current. A second portion of the dynamic circuit is analyzed, separate from the first portion, to determine an estimated amount of leakage current that passes through the PDN when the PDN is not actively discharging the dynamic node may be determined. The size for the keeper transistor that enables the keeper transistor, when activated, to produce an amount of keeper current that is substantially equal to the estimated amount of leakage current may be determined based on the analysis performed on the first and second portion.

Abstract: In accordance with one embodiment of the present invention, there is provided a technique for dynamically pipelined data migration. According to one aspect, it is determined that a source schema-conformant source data set is to be converted to a target schema-conformant target data set. A plurality of conversion mechanisms, which can be invoked in succession to convert the source data set into the target data set, is automatically determined. The plurality of conversion mechanisms comprises (a) an initial set of one or more conversion mechanisms that can be invoked in succession to convert the source data set to a final intermediate data set, and (b) a final conversion mechanism that converts the final intermediate data set to the target data set. Each conversion mechanism in the plurality of conversion mechanisms is successively invoked, in order, to convert the set of source data set to the target data set.

Abstract: Solutions to a value recycling problem that we define herein facilitate implementations of computer programs that may execute as multithreaded computations in multiprocessor computers, as well as implementations of related shared data structures. Some exploitations of the techniques described herein allow non-blocking, shared data structures to be implemented using standard dynamic allocation mechanisms (such as malloc and free). A class of general solutions to value recycling is described in the context of an illustration we call the Repeat Offender Problem (ROP), including illustrative Application Program Interfaces (APIs) defined in terms of the ROP terminology. Furthermore, specific solutions, implementations and algorithm, including a Pass-The-Buck (PTB) implementation are also described. Solutions to the proposed value recycling problem have a variety of uses.

Abstract: A method includes determining a garbage collection list for a data storage structure of a node in a data storage system, the garbage collection list including one or more layout map identifiers (IDs) for garbage collection. A data fragment stored on the data storage structure is located at a first location and a layout map ID associated with the data fragment is determined. A determination is made whether the layout map ID associated with the data fragment matches a layout map ID for garbage collection in the garbage collection list. If the layout map ID associated with the data fragment matches a layout map ID for garbage collection in the garbage collection list, a determination is made whether the data fragment is present at a second location on the data storage system. If the data fragment is present at a second location on the data storage system, the data fragment at the first location is determined to be a garbage fragment and deleted from the data storage system.

Abstract: A method is provided for performing a component product integration sync. In the method, a component product extensible markup language (XML) schema is generated. A number of component products to be integrated together in a software system are then identified. A component product XML file is generated for each identified component product according to the generated component product XML schema. The generated component product XML files are used to verify compatibility of the identified component products when integrated together in the software system. Once compatibility of the identified component products is verified, the software system can be built with a high expectation of success.

Abstract: A method for verification of an application for zones that includes determining an execution environment of the application, obtaining a list of permissions from the execution environment, analyzing the application to identify a restricted instruction within the application, wherein the restricted instruction is zone specific, and generating a report when a required permission of the restricted instruction is not in the list of permissions.

Abstract: A system consistent with the present invention reduces the number of redundant class descriptors that are sent during remote method calls by using serialization contexts. “Serialization contexts” are dictionary objects that map a class descriptor to a corresponding integer handle. When possible, the integer handle, rather than the full class descriptor, is passed, saving processing time in RMI calls.

Abstract: A method for recovery of data objects on a data storage system includes determining a list of layout map IDs that place data objects on a node of a data storage system. For each layout map ID, a list of object IDs associated with each of the data objects assigned the layout map ID is determined. For each object ID, a list of data object fragments associated with the object ID is determined. A determination is made whether each of the data object fragments is present on the node. If a data object fragment is not present on the node, the data object fragment is reconstructed on the data storage system. The method can be automatically implemented by each of one or more operational nodes of a distributed data storage system at configured time intervals, and/or upon the operational loss of a data storage structure of a node, or a node.