Abstract: Memory devices and systems with post-packaging master die selection, and associated methods, are disclosed herein. In one embodiment, a memory device includes a plurality of memory dies. Each memory die of the plurality includes a command/address decoder. The command/address decoders are configured to receive command and address signals from external contacts of the memory device. The command/address decoders are also configured, when enabled, to decode the command and address signals and transmit the decoded command and address signals to every other memory die of the plurality. Each memory die further includes circuitry configured to enable, or disable, or both individual command/address decoders of the plurality of memory dies. In some embodiments, the circuitry can enable a command/address decoder of a memory die of the plurality after the plurality of memory dies are packaged into a memory device.

Abstract: A multiple processing architecture and a method of managing a work queue of that processing architecture. The multiple processing architecture comprises a plurality of distributed computer systems and a coupling facility. These systems are all connected to the coupling facility by a plurality of links The coupling facility holds and manages a work queue for the applications servers; and the processing system further includes queue managing means to separate the work queue into at least a plurality of separate zones, and to associate each of a plurality of subsets of the computer systems with a respective one of said zones whereby, for each of said subsets of computer systems, all of the computer systems in the subset can place work requests on, and retrieve work requests from, the zone associated with said subset.

Abstract: A queue management system and a method of managing a queue. The queue management system includes primary and secondary queues for storing messages, and a processor for determining on which queue to place received messages. This processor means includes (i) means for receiving messages, and (ii) means for determining, for each received message, whether the message is logically related, according to a predefined relationship, to one of the messages stored on the primary queue. If the received message is logically related to one of the messages stored on the primary queue, then placing the received message on the secondary queue; and if the received message is not logically related to one of the messages stored on the primary queue, then placing the received message on the primary queue.

Abstract: A multiple processing architecture and a method of managing a work queue of that processing architecture. The multiple processing architecture comprises a plurality of distributed computer systems and a coupling facility. Each of the computer systems has an operating system instance resident thereon and providing at least one application server; and these systems are all connected to the coupling facility by a plurality of links that transmit data between the computer systems and the coupling facility.

Abstract: A method for creating a duplicate copy of a tape in which a first tape having a first data set name and a second tape having a second data set name are allocated. Data is written to the first and second tapes so that block for block, the data is located at the same position on each of the tapes. After data is written to one of the tapes, a check is made to verify that the data was written correctly. If an error is detected in writing the second tape, an error flag is set that indicates a copy of the first tape needs to be made. At various stages of the process, checks are made to determine if error flag is on. If the error flag is detected, writing the second tape is suspended.

Abstract: A procedure for the optimal processing of variable-cost actions such as encountered in the storage reclamation procedures for a multivolume data library. The procedure introduces a temporary processing queue to minimize idle processing capacity during the scanning and sorting of a large plurality of variable-cost actions such as the recycling of a plurality of data storage volumes each having a variable recycle processing cost related to the action of valid data remaining on the volume. Volumes (actions) are selected for the immediate queue according to a dynamically-adjusted threshold test for the processing cost. This processing cost threshold is dynamically adjusted to optimize the immediate queue in relation to the available processing capacity. After scanning and sorting all volumes according to recycle processing cost, the temporary (immediate) queue is updated to a final recycle processing queue by appending a sorted deferred queue to the remainder of the immediate queue.