Abstract: A logical partition (LPAR) is managed in a data processing system by performing an initial program load (IPL), commencing execution of an application on the LPAR and selecting from a plurality of unsolicited events of which the application is to receive notice. A command is transmitted to a storage controller indicating the identity of the selected unsolicited events, wherein the storage controller will store the information in a data structure. Upon the later occurrence of an unsolicited event, the storage controller will transmit to the LPAR only notices of the selected unsolicited events.

Abstract: Deleting a data volume from a storage system and freeing its storage space to make it available to be allocated to a new volume is accomplished by only zeroing associated metadata for the tracks contained in the freed storage space which is then reused in a new volume allocation and an attempt is made by the new volume to read a first record R0 of a track. A determination is made as to whether a first user record R1 of the volume is stale If the first record R0 is stale. If record R1 is stale, the metadata or track format description (TFD) is modified whereby the entire track is indicated as being uninitialized and the first record R0 is uninitialized. If record R1 is not stale, the first record R0 is regenerated and the TFD is modified whereby the entire track is indicated as being initialized.

Abstract: Methods and tooling for constructing a stair unit are provided. The methods incorporate tooling and tables to create templates (two for each tread) that, when laid along a series of hypotenuse marks on the stringer from the table, will dictate the geometry, cutting, and fitting to the treads, without using a framing square. Brackets are used to conjoin the stringer, tread material, and tread framing so that the tread width is not limited by the lack of strength of the tread material. The methods then incorporate the bracket in a tread module to provide further convenience and sequencing options for the assembly of the stair unit. An alternate method combines aspects of the template and the bracket to hold continuous support for the tread, accomplishing a cut stringer look. The result is less time and material expense with better strength, fit and finish.

Abstract: Conventional C2 coding and interleaving for multi-track data tape in LTO-3/4 do not support recording data onto a number of concurrent tracks which is not a power of two. Higher-rate longer C2 codes, which do not degrade error rate performance, are provided. An adjustable format and interleaving scheme accommodates future tape drives in which the number of concurrent tracks is not necessarily a power of two. A data set is segmented into a plurality of unencoded subdata sets and parity bytes are generated for each row and column. The parameters of the C2 code include N2 as the least common multiple of the number of possible tracks to which codeword objects are to be written. COs are formed from N2 C1 codewords, mapped onto a logical data track according to information within headers of the CO and modulation encoded into synchronized COs which are written to the tape.

Abstract: A method of optimizing mail sorting on a envelope sorting machine by eliminating the necessity to pass some of the documents through the machine twice is provided in which a postal code table is created having an order for each of a plurality of postal code ranges. An unsorted document print stream is received and a document parameter table created to store boundaries of each of a plurality of documents and a location of a postal code in each document. An index table is constructed incorporating information from the postal code table indicating the location and order of each document in the unsorted document print stream. The index table is reordered according to the order of each document and a sorted document print stream is generated, whereby the documents are arranged in order of their respective priorities. The documents are then printed from the sorted document print stream, separated into groups in accordance with their respective priorities and sorted in order of each group's respective order.

Abstract: During a read-after-write operation on magnetic tape, a first SCO is formed which includes two encoded processed user data units and is one of T SCOs in a first SCO set. The user data units are each one of T user data units in first and second user data unit sets, respectively, within the first SCO set. The first SCO set is written to the magnetic tape and is immediately read. When an error is detected in one of the user data units, a second SCO is formed to include the first user data unit and, only if an error is not detected in a user data unit in the other user data unit set, to not include the other user data unit, the second SCO being one of T SCOs in a second SCO set. Then, the second SCO set is rewritten to a later position on the tape later.

Abstract: In an automated data storage library, selective encryption for data stored or to be stored on removable media is provided. One or more encryption policies are established, each policy including a level of encryption one or more encryption keys and the identity of one or more data cartridges. The encryption policies are stored in a policy table and the encryption keys are stored in a secure key server. A host requests access to a specified data cartridge and the cartridge is transported from a storage shelf in the library to a storage drive. Based on the identity of the specified cartridge the corresponding encryption policy is selected from the table and the appropriate encryption key is obtained from the key server. The storage drive encrypts data in accordance with the key and stores the data on the media within the specified data cartridge.

Abstract: Error correction coding is provided for codeword headers in a data tape format, such as a Linear Tape-Open, Generation 4 (LTO-4) data tape format. The data tape format defines a codeword quad as having first and second codeword headers interleaved with first and second codeword pairs, each codeword header comprising N bytes ck=c0, c1, . . . , cN?2, cN?1 wherein K bytes c0-cK?1 of the first and second headers in a codeword quad differ such that if one is known the other can be inferred. Each header byte ck of a codeword quad is redefined as comprising two interleaved (m/2)-bit nibbles, ek, ok. For each header, nibbles eK-eN?1 and nibbles oK-oN?1 are generated as a function of nibbles, e0-eK?1 and o0-oK?1, respectively. A codeword is assembled with the redefined headers the codeword quad is then recorded onto a recording medium.

Abstract: A method is provided for isolating errors which occur when code supplied by independent software vendors (ISV code) interacts with code supplied by a primary vendor (host code). Code suspected of containing ISV code with host code is executed. If the results are in error, the code is scanned and then compared with a master host code. Any differences are stored in a delta file, including locations in the host code where ISV code hooks into the host code. The code is then modified to by-pass the hooks to ISV code to generate a side-executable code and both codes are executed and the results are compared. A lack of substantial difference in the results is indicative that the ISV code adversely affects the host code while a difference between the results is indicative of an error in the modified code.

Abstract: An method of, apparatus for, or storage device medium having instructions for publishing a first notification within a data processing system where the data processing system comprises a first source generating the first notification, a first destination device, and a second destination device. The source may be a storage unit, a printer, a processing unit, or any other device which is a component of the data processing system. The destination device is typically a monitor, a workstation, a computer, a PC, or other input/output type workstation. The method comprises of having the first destination device subscribe to receive notifications from the first source. In addition, the second destination device subscribes to receive the notifications serially republished from the first destination device. Upon the publication of a notification from the first source to the first destination device, the first destination device will publish the notification to the second destination device.

Abstract: A virtual tape server (VTS) and a method for managing shared first level storage, such as a disk cache, among multiple virtual tape servers are provided. Such a system and method manage first level storage to accommodate two or more host processing systems by maintaining adequate free space in the cache for each host and by preventing one host, such as a mainframe, from taking over free space from another host, such as a Linux system.

Abstract: A 16-State adaptive NPML detector is provided for a tape drive which addresses weaknesses of a conventional fixed, 8-state EPR4 detector. Rather than having a fixed target channel, the detector is programmable to allow a range of target channels and can support “classical” partial response channels such as PR4 or EPR4 by programming predictor or whitening filter coefficients. In one embodiment, two filter coefficients may be set via XREG inputs or dynamically determined through the use of an LMS algorithm allowing the detector to adapt the predictor coefficients as data is being read. Another embodiment provides a detector for an EPR4 target in which the whitening filter has one coefficient. Components of the detection system include the detector itself, an LMS engine, a coefficient engine and a noise predictive or whitening filter. Coefficients from the LMS engine may be loaded or stored dynamically based upon conditions in the tape drive.

Abstract: In a data processing system having multiple input/output adapters, a DMA memory block is assigned to each adapter. The DMA memory block has a data area and a generic common control area. All adapters have the same translation control entry for the control area. The control area includes a mapped page assigned to each adapter request and an unmapped buffer space interposed between the mapped pages. By mapping the generic DMA memory, memory space which is not required by an adapter is not mapped unnecessarily. Because the generic DMA memory space is part of each adapter's DMA memory space, adapters are unable to write to partitions to which they do not belong and the possibility of cross-partition memory writes is reduced. Moreover, runaway writes to dedicated DMA memory space may be caught as soon as they occur.

Abstract: A system, backup components and computer program product are provided to improve the efficiency of the transmission of consistency groups across multiple storage components by ensuring that volume transactions are evenly allocated among backup components. Each volume is initially assigned to a specified backup component. Once a color period begins, volume transactions are transmitted to the assigned backup component. Each backup component accumulates data transfer information for its assigned volumes throughout at least a portion of the color period and calculates a new volume assignment for the next color period. Before the start of the next color period, a captain storage controller transmits any new assignments to the backup components. During a next color period, the process is repeated using the new assignments.

Abstract: A urinary anti-backflow device is provided which prevents urine from flowing back into the patient's bladder from a urine collection bag. The device comprises a flow tube having an upstream section connectable to an external urinary device secured to a patient and a downstream section connectable to a urine collection bag, a rod within the flow tube, and a stopper which moves along the rod between the downstream and upstream ends of the flow tube. When the upstream section of the flow tube is elevated relative to the downstream section, urine from the patient is free to flow through the flow tube. When the downstream section of the flow tube is elevated relative to the upstream section, urine forces the stopper against the upstream section to prevent backflow.

Abstract: A weighted combining scheme exploits information from two servo channels operating in parallel. A timing-based servo module comprises two synchronous servo channels coupled respectively to receive two digital servo signals read from a data tape. Both channels have outputs for an unweighted parameter estimate and for a measure of the channel reliability. A weight computation module provides first and second weight signals using the measures of channel reliability from the servo channels. An offset computation module provides first and second offset terms which are summed with the unweighted parameter estimates. Multiplying nodes receive the unweighted parameter estimates and the weight signals and outputs offset weighted parameter estimates. A summing node receives the offset weighted parameter estimates and outputs a combined offset weighted parameter estimate to a servomechanism.

Abstract: A weighted combining scheme exploits information from two servo channels operating in parallel. A timing-based servo module comprises two synchronous servo channels coupled respectively to receive two digital servo signals read from a data tape. Both channels have outputs for an unweighted parameter estimate and for a measure of the channel reliability. A weight computation module provides first and second weight signals using the measures of channel reliability from the servo channels. An offset computation module provides first and second offset terms which are summed with the unweighted parameter estimates. Multiplying nodes receive the unweighted parameter estimates and the weight signals and outputs offset weighted parameter estimates. A summing node receives the offset weighted parameter estimates and outputs a combined offset weighted parameter estimate to a servomechanism.

Abstract: A weighted combining scheme exploits information from two servo channels operating in parallel. A timing-based servo module servo module comprises two servo channels coupled respectively to receive two digital servo signals read from a data tape. Both channels have outputs for an unweighted metric and for a measure of the channel reliability. A weight computation module provides first and second weight signals using the measures of channel reliability from the servo channels. A first multiplying node receives a first unweighted metric and a first weight signal and is operable to output a first weighted metric. A second multiplying node receives a second unweighted metric and a second weight signal and outputs a second weighted metric. A summing node receives the first and second weighted metrics and outputs a combined weighted metric to an LPOS word decoder.

Abstract: Methods, logic, apparatus and computer program product write data, comprising less than a full Data Set, to magnetic tape. Data is received from a host, a do-not-interleave command is issued and C1 and C2 ECC are computed. Codeword Quad (CQ) sets are then formed. At least one CQ set of the Data Set is written to a magnetic tape in a non-interleaved manner and a Data Set Information Table (DSIT) is written to the magnetic tape immediately following the at least one written CQ set. An address transformation may be used to cancel interleaving. Writing a CQ set may include writing a plurality of contiguous instances of the CQ set to the magnetic tape to maintain the effectiveness of ECC capability.