Abstract: This disclosure is directed to using cascading algorithms to automatically identify items placed in a tote or other receptacle utilized by users in material handling facilities as the users move around the facilities. A tote may store a database or “gallery” of item representations for all of the items that are stored in the facility that a user may place in their totes. The tote may use multiple algorithms in a cascading manner to analyze the gallery of item representations in order to iteratively narrow the search space of item representations in the gallery to determine which of the items was placed in the tote by a user. Upon identifying the item placed in the tote, the tote may add an item identifier for the item to a virtual listing of item identifiers representing items previously placed in the tote.

Abstract: A cache control system is disclosed for use with data storage apparatus having a movably mounted storage element, such as a magnetic or optical disk and solid-state cache memory, in which the storage element is not at operating speed when data access has not occurred during a predetermined time period, comprising means arranged to access data stored on the storage element if a read or write request cannot be satisfied via access to the cache memory and a cache replacement mechanism for transferring data between the cache memory and the storage element to maintain consistency of data therebetween. The system is characterized in that the cache replacement mechanism performs data transfers between the cache memory and the storage element only while the storage element is at operating speed after a read or write request has given rise to an access to the storage element.

Abstract: A log-structured array (LSA) includes a relatively large, non-volatile cache memory as well as a memory segment write buffer. The LSA cache memory contains both updated logical tracks received from the host system and also clean logical tracks read from direct access storage devices of the array. When the fraction of updated tracks in the cache memory exceeds a threshold value, updated tracks are moved from the LSA cache memory to the memory segment. With each modified track to be moved, adjacent modified tracks also are moved. The updated tracks are moved regardless of their location in the updated LRU list. Clean tracks in the LSA cache memory are moved into the memory segment as well, when additional clean tracks are needed in the cache memory. The clean tracks are selected from the bottom of the LSA cache clean track LRU list. Checking for adjacency also can occur at garbage collection time, performed in a background mode.

Abstract: A data storage disk device for a RAID disk array is disclosed, comprising a rotatably mounted disk having a data storage surface; a first head for reading data from and writing data to the data storage surface; with a second head for reading data from the data storage surface; and control means for executing a write operation to a sector, said write operation including reading the contents of the sector via the second head for subsequent processing and writing new data to the sector via the first head, the first and second heads being arranged with respect to the data storage surface so that the new data can be written to the sector on the same revolution of the disk as the reading operation. The addition of a second head to the disk storage device improves performance of the disk device for RAID applications.

Abstract: A method and apparatus for improving storage controller throughput and reducing unit control block contention when selecting a Utility Volume for servicing non-specific read requests. Throughput is increased by enabling the storage controller to service non-specific read requests issued against a Utility Volume which is not the same as the device associated with the data that the non-specific read is requesting. The Utility Volume is dynamically selected by considering the current loads on the available devices for both specific and non-specific processing. A Penalty Index is assigned to each volume, wherein the Penalty Index is a weighted average of the specific and non-specific processing. The device having the lowest Penalty Index is selected as the Utility Volume for a session. A Penalty Index evaluation is made at a Reference Point which is further enabled by a random clock to ensure that sessions do not likely pick the same Utility Volume.

Abstract: A backup method for a computer database system comprising maintaining a mirrored copy of the database at a remote location is characterized in that updates to the remote database data are delayed for a delay time greater than or equal to the upper limit on the data communication delay between the local location and the remote location and updates to a remote log for the database are executed after corresponding updates to a local log without said delay. In this way a consistent copy of the database may be recovered from the mirrored copy of the database and the remote log after destruction of the database system.

Abstract: A method and apparatus for improving storage controller throughput when servicing non-specific read requests. Throughput is increased by enabling the storage controller to service non-specific read requests issued against a device address which is not the same as the device address associated with the data that the non-specific read is requesting. The device address associated with the data is thus free to be used for another I/O operation. When the device address used by the non-specific read is a non-busy type (that is, the device and/or data is not locked) then the throughput improvement is obtained by increasing the number of data requests that may be concurrently handled by the storage controller.

Abstract: A computer implemented method for speeding up the recursive most significant digit radix sorting of a set of record keys in which the keys are scanned for a shared or common prefix, coded according to the point in the key where they differ and the value of the differing digit, and processed such that during each dispersion phase the code words are used to speed processing by avoiding comparison matching of the prefixes, the recursive dispersion and collection phases continuing until singletons are reached. In the absence of shared prefixes the keys are normally recursively radix sorted.

Abstract: A data backup copying session on a data processing system is secured responsive to initiation of the data backup session by an application executing on a processing unit by generating a unique identifier for the data backup session. Thereafter, all member paths of a group of paths designated by the processing unit for communication between itself and the first storage subsystem are identified and associated with the data backup session. Access to the session is thereafter allowed only along a member path of the group of paths associated with the data backup session. The system and method of the invention further provide for fault recovery and protection against excessive demand on storage control unit memory.

Abstract: A method and system for efficiently accessing desired datasets among multiple datasets which are stored at specific data addresses within multiple storage subsystems which are coupled to a host system via a storage subsystem controller and a data channel. A data request is transmitted from the host system to the storage subsystems via the data channel. The data request specifies non-address attributes for desired datasets, such as boundary addresses for large data extents including many datasets or a request for all datasets modified since the occurrence of a specified event. The data request is then processed at the storage subsystem controller to determine a data address for each dataset within the storage subsystem which possess the desired attributes. Thereafter, the desired datasets are transmitted via the data channel to the host system in association with a specific address for each dataset.

Abstract: A method and system are disclosed for permitting high concurrency of access during backup copying of designated data stored within a storage subsystem which includes multiple storage devices coupled to the data processing system via a storage subsystem control unit having subsystem memory therein. Data within each storage device is accessed utilizing a Unique Control Block (UCB), which identifies a selected storage device, and an associated data retrieval command sequence which identifies the data to be accessed. Portions of the data copied to subsystem memory within the subsystem storage control unit as sidefiles from a first storage device may be accessed utilizing a Unique Control Block (UCB) associated with an alternate storage device by associating a selected data retrieval command sequence therewith which identifies the data as stored within the subsystem memory.

Abstract: A method and system are disclosed for enhanced efficiency of backup copying of designated datasets stored within a plurality of storage devices coupled to the data processing system via a storage subsystem control unit having subsystem memory therein. Application execution within the data processing system is temporarily suspended long enough to form a dataset logical-to-physical system address concordance to be utilized to administer copying of the designated dataset. Thereafter, application initiated updates to uncopied portions of the designated datasets are temporarily deferred until sidefiles of the affected portions of the designated datasets are written to subsystem memory. The updates are then written to the storage subsystem. Portions of the designated datasets are then accessed and copied from the storage subsystem on a scheduled or opportunistic basis utilizing selected data retrieval command sequences.

Abstract: A method and system are disclosed for enhanced efficiency of backup copying of designated datasets stored within a plurality of storage devices coupled to the data processing system via a storage subsystem control unit having subsystem memory therein. Application execution within the data processing system is temporarily suspended long enough to form a dataset logical-to-physical system address concordance to be utilized to administer copying of the designated dataset. Thereafter, application initiated updates to uncopied portions of the designated datasets are temporarily deferred until sidefiles of the affected portions of the designated datasets are written to subsystem memory. The updates are then written to the storage subsystem. Portions of the designated datasets are then accessed and copied from the storage subsystem on a scheduled or opportunistic basis utilizing selected data retrieval command sequences.