Abstract: An operating system manages virtualized instances of hardware resources and migration enabled applications partitioned into one of multiple partitions with a separate operating system kernel running in each of the partitions. A migration event controller of the operating system manages the checkpoint and restart process during migration of a virtualized instance of at least one migration enabled application from a departure partition to an arrival partition. The migration event controller supports migration enabled applications to separately specify at least one application specific checkpoint script and restart script to be triggered by checkpoint and restart events by the migration event controller so the at least one migration enabled application can participate in performing the checkpoint and restart process for additional state information during migration of the virtualized instance from the departure partition to the arrival partition.

Abstract: A method, data processing system, and computer program product for managing data. A processor unit copies a data structure within a hierarchy of data structures to form a copy of the data structure. The data structure belongs to a level within a plurality of levels in the hierarchy of data structures. The processor unit associates an identifier with the data structure within the hierarchy of data structures. The processor unit increments a portion of the identifier for the data structure in response to copying the data structure to form the copy of the data structure and associating the identifier with the data structure within the hierarchy of data structures. The portion of the identifier that is incremented is based on the level within the plurality of levels in which the data structure is located.

Abstract: A method, system, and program are provided for managing a response to an email by a hidden email recipient. A hidden recipient manager detects a request to respond to an electronic communication by a hidden recipient of that electronic communication from among a plurality of recipients of the electronic communication. The hidden recipient detects whether the request to respond is addressed to at least one recipient other than a sender of the electronic communication. If the request to respond is addressed to at least one recipient other than a sender of the electronic communication, then the hidden recipient manager warns the hidden recipient that the request to respond is addressed to at least one recipient who is unaware of the recipient of the electronic communication by the hidden recipient.

Abstract: A system for balancing multiple memory buffer sizes includes a memory partitioned into a plurality of subgroups, each subgroup containing similarly sized buffers. The system further includes a memory manager which manages requests for buffer space by storing and accessing buffer steal history records in a buffer steal history queue.

Abstract: In one embodiment, an operating system manages virtualized instances of hardware resources and migration enabled applications partitioned into one of multiple partitions with a separate operating system kernel running in each of the partitions. A migration event controller of the operating system manages the checkpoint and restart process during migration of a virtualized instance of at least one migration enabled application from a departure partition to an arrival partition. The migration event controller supports migration enabled applications to separately specify at least one application specific checkpoint script and restart script to be triggered by checkpoint and restart events by the migration event controller so the at least one migration enabled application can participate in performing the checkpoint and restart process for additional state information during migration of the virtualized instance from the departure partition to the arrival partition.

Abstract: The present invention provides for authentication of code, such as boot code. A memory addressing engine is employable to select a portion of a memory, as a function of a step value, as a first input hash value. The step value allows for the non-commutative cumulative hashing of a plurality of memory portions with a second input hash value, such as a previous hash value that has been rotated left. An authenticator circuit is employable to perform a hash upon the portion of memory and the second input hash value. A comparison circuit is then employable to compare an output of the authenticator circuit to an expected value.

Abstract: A method, system, and program are provided for managing a response to an email by a hidden email recipient. A hidden recipient manager detects a request to respond to an electronic communication by a hidden recipient of that electronic communication from among a plurality of recipients of the electronic communication. The hidden recipient detects whether the request to respond is addressed to at least one recipient other than a sender of the electronic communication. If the request to respond is addressed to at least one recipient other than a sender of the electronic communication, then the hidden recipient manager warns the hidden recipient that the request to respond is addressed to at least one recipient who is unaware of the recipient of the electronic communication by the hidden recipient.

Abstract: A system for balancing multiple memory buffer sizes includes a memory partitioned into a plurality of subgroups, each subgroup containing similarly sized buffers. The system further includes a memory manager which manages requests for buffer space by storing and accessing buffer steal history records in a buffer steal history queue.

Abstract: A dual stage data lossless compressor for optimally compressing bit mapped imaged data. The first stage run length compresses data bits representing pixel positions along a scan line of a video image to data units of fixed length. The units alternate to represent runs of alternate video image data values. The run length compressed data units are subject to second stage compression using a sliding window Lempel-Ziv compressor. The output from the Lempel-Ziv compressor includes raw tokens of fixed length and compressed tokens of varying lengths. The combination of a run length precompressor and a sliding window Lempel-Ziv post compressor, in which the run length compressor output is a succession of data units of fixed length, provides an optimum match between the capabilities and idiosyncracies of the two compressors, and related decompressors, when processing business form data images.

Abstract: Systems and methods for compressing data. Lempel-Ziv data compression is applied in the context of an exhaustive sliding window implementation using a large character history bit pattern memory. Shifted updating of the character history bit pattern memory is accomplished through a pointer system. Linear patterns of bits, derived by COPY function from the character history bit pattern memory or by bit wise AND logic combination of selected bit patterns, are circularly shifted in synchronism with new data characters using a toroidal bit shift register. The relatively long bit strings subject to shifting are converted to a matrix format, shifted with fewer affected bits and returned to a linear format. The systems and methods materially improve the speed of exhaustive sliding window data compression as accomplished by general purpose processors.

Abstract: A system for compressing digital data at one byte-per-cycle throughput by removing redundancy before storage or transmission. The system includes an improved Ziv-Lempel LZ1 process that uses a history buffer to save the most recent source string symbols for use in encoding the source symbols as "match-length" and "match-offset" tokens. The match-length code symbols are selected from two groups of buckets that are assigned variable-length prefixes for the shorter, more probable match-lengths and a fixed-length prefix code for the longer, less probable match-lengths. This exploits a transition from Laplacian match-length probability distribution to Uniform match-length probability distribution for longer match-lengths. The offset code field length is reduced during start-up to improve start-up compression efficiency during filling of the history buffer. The match-length code book is limited to a maximum value T<256 to limit latency and simplify the process.

Abstract: An apparatus for managing operations of a circuit, including apparatus for computing a cumulative thermal load caused by instructions to be executed by the circuit, apparatus for determining whether the cumulative thermal load exceeds a thermal range of the circuit, and apparatus, coupled to the apparatus for determining, for reducing the cumulative thermal load of the circuit prior to execution of the instructions determined to cause the thermal range to be exceeded. In addition, a method for managing operations of a circuit, including the steps of computing a cumulative thermal load caused by instructions to be executed by the circuit, determining whether the cumulative thermal load exceeds a thermal range of the circuit, and reducing, subsequent to the step of determining, the cumulative thermal load of the circuit prior to execution of the instructions determined to cause the thermal range to be exceeded.