Abstract: A computer storage system includes a supervisor algorithm to detect a host computer's initiator logging in. The supervisor algorithm identifies data storage devices associated with the newly logged-on initiator and tags logical unit number control blocks (“LUNCBs”) as having priority in an initiation process. The supervisor algorithm assigns a task control block to each of the identified data storage devices and invokes a logical unit number (“LUN”) initialization algorithm. If the supervisor algorithm was invoked during an initial microcode load (“IML”) event, the LUN initialization algorithm initializes each of the identified data storage devices. However, if the supervisor algorithm was invoked during a warmstart procedure, the LUN initialization algorithm first checks to make sure the LUNCB was not mistakenly written too. If not, the LUN initialization algorithm terminates without initializing the associated data storage device.

Abstract: A method of transmitting information from a primary storage control unit to a secondary storage control unit in an asynchronous data copying system. The method includes building multiple descriptor blocks for transmission from the primary storage control unit, and encrypting multiple payloads according to one of n encryption methods. In addition, the n encryption methods are associated with the primary storage control unit and n decryption keys relating to the n encryption methods are associated with the secondary storage control unit. An index to the n encryption keys is associated with the multiple descriptor blocks. The method further includes encrypting each of the payloads according to one of the n encryption methods and indicating, in the index associated with a selected descriptor block, which decryption key relates to the encryption method used for any payload associated with a select descriptor block.

Abstract: Provided is a method, system and program for synchronizing sequential subtasks of a task, so that the subtasks can be dispatched to generate operations in a particular sequence. In one embodiment, a subtask which has been prepared for dispatching is queued in a queue until the queued subtask is the next subtask in sequence for dispatching. In one embodiment, the subtasks may be sorted in the queue by task and by subtask sequence.