Abstract: An apparatus and method provides the capability of mirroring storage from a primary system to a mirrored system in a way that uses parallelism in the mirrored system to maximize the efficiency of writing data to the mirrored storage for operations that do not conflict while serializing operations that do conflict. The mirroring of the present invention is “logical mirroring”, which does not require identical disk drives, and which supports mirroring between geographically remote locations to protect against catastrophic site failure. Parallelism is achieved in the mirrored system by dividing the virtual address space into multiple ranges, and by assigning a group of tasks to each range. When an operation is received on the mirrored system, the virtual address range that the operation affects is determined, and the operation is then delegated to the task group that corresponds to the affected virtual address range. By dividing the virtual address space into ranges, tasks in different ranges (i.e.

Abstract: A task synchronization mechanism operates on a global lock that is shared between processors an on local locks that are not shared between processors. The local locks are processor-specific locks. Each processor-specific lock is dedicated to a particular processor in the system. When shared access to a resource is required, a processor updates its processor-specific lock to indicate the processor is sharing the resource. Because each processor-specific lock is dedicated to a particular processor, this eliminates a significant portion of the memory bus traffic associated with all processors reading and updating the same lock. When exclusive access to a resource is required, the requesting processor waits until the count of all processor-specific locks indicate that none of these processors have a lock on the resource. Once no processor has a lock on the resource, exclusive access to the resource may be granted.

Abstract: An apparatus and method includes a database journal that records journal entries. Each journal entry includes a validation value that is computed from the data and metadata for the record before it is changed. In this manner, journal entries may be applied with confidence to a record in a database. This is especially useful when minimized data journal entries are used. If the validation value of the journal entry matches the validation value computed from the data and metadata of the record that the journal entry is to be applied to, then the record before applying the journal entry is identical to the record in the original database, and the journal data may be applied to the database record. If the validation value of the journal entry does not match the validation value computed from the data and metadata of the record that the journal entry is to be applied to, the record is not the same as in the original database when the journal entry was generated.

Abstract: A radio receiver includes a voice-only detection mechanism that detects when the current radio station is transmitting mostly voice, and that changes the function of the receiver depending on whether or not the current radio station is transmitting mostly voice. In a first embodiment, the radio receiver mutes its audio output when the voice-only detection mechanism detects a voice broadcast, or mutes its audio output when the voice-only detection mechanism detects a music broadcast. In a second embodiment, the radio receiver changes to a different radio station when a voice-only signal is detected, or when a music signal is detected. The second embodiment preferably includes a spectrum analyzer that can store a frequency spectrum “signature” of a radio signal, and a second tuner that scans the available radio stations for a signal that matches the stored signature.

Abstract: A database manager selectively caches journal entries for certain database changes based on dynamic selection criteria. Preferably, a journal disk drive is provided for storing changes to the database. Database change entries are sequentially cached in a main memory journal buffer, awaiting journal write. When a buffer is filled, its buffer contents are written to the journal disk. However, certain change operations will cause the contents of the buffer to be written to the journal disk immediately, before filling the buffer. Certain database change entries selectively cause the buffer to be written, depending on dynamic selection criteria. Preferably, these selection criteria take into account both the estimated time to recover in the event of a system crash and the current level of activity on the system. Generally, the busier the system, the more data will be cached, and vice versa.

Abstract: Disclosed is an enhanced database journaling mechanism that results in reduced secondary storage consumption. The memory management mechanism of the present invention reduces journal size, and accordingly, secondary storage utilization by monitoring the effects to the journal by certain transactions and by making one or more adjustments to reduce those effects.

Abstract: A flux indicator is utilized as a low-overhead consistency check for a shared resource such as a data structure, and provides a mechanism for determining both whether a data structure has or is currently in the process of being modified. In connection with attempts to modify the data structure, the flux indicator is updated from a first state to a second state prior to modifying the data structure, and thereafter updated to a third state after modifying the data structure, Copies of the flux indicator are then obtained both before and after attempting to obtain a copy of data from the data structure. The validity of the copy of the data is ensured when the first copy of the flux indicator does not indicate that the data structure is in the progress of being modified and the first and second copies of the flux indicator have the same state.

Abstract: A protection utility for compiled data in a computer system having dynamically configurable logical partitions determines the time for rebuilding compiled data, and selectively stores data in a form not requiring rebuild to meet a pre-specified recovery time limit. If the configuration changes, the protection strategy is automatically migrated to adapt to the new configuration. Preferably, the compiled data is multiple database indexes, which are selectively logged to reduce recovery time. Logging is selectively discontinued or extended responsive to changes in partition configuration, allowing a gradual migration to the target recovery time using the new set of configured resources.

Abstract: Methods, systems, and articles of manufacture for replacement of a failing processor of a multi-processor system running at least one operating system are provided. In contrast to the prior art, the replacement may be performed by system firmware without intervention by the operating system (i.e., the replacement may be transparent to the operating system). For some embodiments, the multi-processor system may be logically partitioned and the methods may be utilized to replace one or more shared or dedicated processors assigned to a logical partition, transparent to an operating system running on the partition.

Abstract: A task synchronization mechanism operates on a global lock that is shared between processors an on local locks that are not shared between processors. The local locks are processor-specific locks. Each processor-specific lock is dedicated to a particular processor in the system. When shared access to a resource is required, a processor updates its processor-specific lock to indicate the processor is sharing the resource. Because each processor-specific lock is dedicated to a particular processor, this eliminates a significant portion of the memory bus traffic associated with all processors reading and updating the same lock. When exclusive access to a resource is required, the requesting processor waits until the count of all processor-specific locks indicate that none of these processors have a lock on the resource. Once no processor has a lock on the resource, exclusive access to the resource may be granted.

Abstract: A relatively long, narrow defect in a digital image is repaired by identifying an elongated area to be repaired, and by automatically calculating pixel color/shade values within the area to be repaired from pixel values in the vicinity of the perimeter of the elongated area. Preferably, a user identifies an elongated rectangular area to be repaired on an interactive display. The computer automatically generates the pixel coordinates of a pair of parallel lines constituting the opposite long sides of the rectangle, and a set of line segments running between the long sides. The interior pixels of the rectangle are then filled by interpolating color values along each line segment. Since this method is not guaranteed to fill all pixels, the system optionally maintains a map of pixels filled and not filled while performing this method, and after completion, performs an additional step of assigning to any unfilled pixels a value based on the average of all adjacent pixels.

Abstract: A database manager selectively caches journal entries for certain database changes based on dynamic selection criteria. Preferably, a journal disk drive is provided for storing changes to the database. Database change entries are sequentially cached in a main memory journal buffer, a waiting journal write. When a buffer is filled, its buffer contents are written to the journal disk. However, certain change operations will cause the contents of the buffer to be written to the journal disk immediately, before filling the buffer. Certain database change entries selectively cause the buffer to be written, depending on dynamic selection criteria. Preferably, these selection criteria take into account both the estimated time to recover in the event of a system crash and the current level of activity on the system. Generally, the busier the system, the more data will be cached, and vice versa.

Abstract: An apparatus and method includes a database journal that records journal entries. Each journal entry includes a validation value that is computed from the data and metadata for the record before it is changed. In this manner, journal entries may be applied with confidence to a record in a database. This is especially useful when minimized data journal entries are used. If the validation value of the journal entry matches the validation value computed from the data and metadata of the record that the journal entry is to be applied to, then the record before applying the journal entry is identical to the record in the original database, and the journal data may be applied to the database record. If the validation value of the journal entry does not match the validation value computed from the data and metadata of the record that the journal entry is to be applied to, the record is not the same as in the original database when the journal entry was generated.

Abstract: Disclosed is an enhanced database journaling mechanism that results in reduced secondary storage consumption. The memory management mechanism of the present invention reduces journal size, and accordingly, secondary storage utilization by monitoring the effects to the journal by certain transactions and by making one or more adjustments to reduce those effects.

Abstract: A protection utility for compiled data in a computer system having dynamically configurable logical partitions determines the time for rebuilding compiled data, and selectively stores data in a form not requiring rebuild to meet a pre-specified recovery time limit. If the configuration changes, the protection strategy is automatically migrated to adapt to the new configuration. Preferably, the compiled data is multiple database indexes, which are selectively logged to reduce recovery time. Logging is selectively discontinued or extended responsive to changes in partition configuration, allowing a gradual migration to the target recovery time using the new set of configured resources.

Abstract: The browser of the present invention presents the user with a small window, called a thumbnail, in addition to the user's normal window, or in the case of a small screen device, as a small window on the user's screen. A retrieved page image presented by the browser is logically divided into segments through use of the thumbnail. The size of each segment is based upon the size of the user's window or screen and upon the size of the page image. The thumbnail window contains a scaled-down version of the page image. The thumbnail image is divided into cells, one cell for each page image segment. When taken together, the cells form an image grid. Each cell is encoded with hotspot information to form a mapping between it and the associated page image segment. When the user selects a cell on the thumbnail, the browser of the present invention presents the associated segment of the page image to the user via the user's window or screen.

Abstract: A radio receiver includes a voice-only detection mechanism that detects when the current radio station is transmitting mostly voice, and that changes the function of the receiver depending on whether or not the current radio station is transmitting mostly voice. In a first embodiment, the radio receiver mutes its audio output when the voice-only detection mechanism detects a voice broadcast. The audio output can be enabled once again when the voice-only detection mechanism detects a non-voice signal. The first embodiment thus allows commercials and disk jockey talk to be automatically muted, with the volume returned to its previous level when music resumes. In a variation of the first embodiment, the radio receiver mutes its audio output when the voice-only detection mechanism detects a non-voice broadcast, and enables the audio output when the voice-only detection mechanism detects a voice signal, thereby allowing a listener to listen to talk radio while muting musical commercials.

Abstract: An apparatus and method to significantly improve performance of SQL function processing through the use of an encoded vector index (EVI). An EVI provides the data necessary to count the number of records in a database that match criteria provided by a SQL function. The resulting count can then be used to determine, from among two or more candidate approaches, an approach to use in processing an SQL function. By processing the EVI symbol table in lieu of more traditional database indexes, and/or in lieu of the database table itself, statistics for SQL functions are generated significantly faster.

Abstract: A method, memory system, and computer program product are provided for implementing lock based delayed space recycle control. The memory space recycle method is used with a memory in a computer system. A data element lock is obtained for a data record in a data block. Then an update on the data record is performed. A waiting to be recycled index for the data block is maintained. The waiting to be recycled index includes a record number, an address of the large object block (LOB) and the length of the LOB space. When the last lock on a data element is about to be released the waiting to be recycled areas associated with that data element are freed.

Abstract: A journal mechanism for a database allows simultaneous deposits on multiple journal arms. According to a first embodiment, a journaling system maintains the time-order of interdependent deposits on the journal, but does not necessarily maintain the time-order of deposits that are independent of each other, thereby providing multiple simultaneous deposit points on the journal. The first embodiment provides excellent scaling of journal functions as processors are added to a database computer system. According to a second embodiment, a journaling system maintains the time-order of deposits on the journal, but allows a group of deposits known as a “bundle” to span multiple journal arms, thereby providing multiple simultaneous deposit points on the journal. The second embodiment provides good scaling while providing compatibility with known database systems. The present invention thus relieves contention for the journal that exists as the number of processors increases in a database system.