Storage Technology Corporation

Other

David L Trachy

Frederick G Munro

Larry K Carmichael

Cheryl E Netter

Aaron Dailey

Marcia Reid Martin

Matthew P Wojciechowski

John S Todor, Jr

Robert W Schmidt

Randy Pierce

David Farmer

Scott Allen

Richard Defouw

James W Montgomery

Dennis F Reed

A method, computer program product, and data management appliance for scheduling mountable point-in-time views of a storage volume is disclosed. A device external to the data processing system requests indentification information regarding available virtual views made of at least one primary storage device. The identification information is received from the device. The virtual views are incorporated into native filesystem associated with the data processing system. The identification information includes an alphanumeric name, creation date and time information, filesystem type, and access privileges.

Storage backup system that creates mountable representations of past contents of storage volumes

A multimedia array (100) is formed from a plurality of compartments (102, 104) that are capable of receiving differently sized cartridges (30, 50, 70) for presentment to a robotic arm (166). The compartments each include a sidewall ramp (150) for use in centering the cartridges in the compartments, and a rearward boss (134) for positioning forward surfaces (32, 52, 72) of the respective cartridges equidistantly (at distance D) from the forwardmost surface (114) of the compartments.

Storage array for presenting tape media of differing dimensions to a

The present invention is an interprocess communications (IPC) system and method which utilizes shared memory to transfer message contents and a separate, efficient notification mechanism to perform message control functions. The present invention supports robust, asynchronous communications between potentially large number of software application processes residing on any single or tightly-coupled multiple processor arrangement supporting shared memory between the processes. The present invention is a combination of existing IPC mechanisms available in most commercially available UNIX operating systems. The IPC mechanism utilizes the presently available UNIX shared memory IPC mechanism for transferring message contents and the presently available UNIX datagram socket IPC mechanism for message control and notification. The IPC mechanism may be adapted to other operating system environments. The IPC mechanism performs a controlled shutdown of the interprocess communications associated with a user process which has ceased executing. The shared memory allocated for the IPC mechanism is periodically audited to reclaim lost shared memory blocks due to user process failures.

Interprocess communications system and method utilizing shared memory

An automated memory cartridge system prioritizes requests for tape retrieval. The requests to transfer cartridges may be assigned a priority relating to the importance of the request. The system will recognize these requests and organize them so that higher priority requests will be executed ahead of other lower priority requests. This prioritization will be accomplished in such a manner which allows even very low priority requests to eventually be carried out.

Task prioritization for a tape storage system

An automated cartridge system optimizes the time it takes to execute a series of cartridge requests. After cartridge requests are received, the library controller calculates the approximate time it will take to execute each possible sequence of pending cartridge requests. The library controller then executes the first request in the sequence of pending requests which will take the shortest elapsed time. This series of calculations and executions continues until all requests are completed. It is another object of the present invention to carry out the motion optimization in such a manner that assures that a particular cartridge request is not put off indefinitely. Each time a hand or arm is allocated to a request, all other requests waiting for these mechanisms have their calculated execution times reduced to increase the likelihood of execution.

Motion optimization for a tape storage system

A bar code conversion system and method identifies good data in the scan data array and analyzes that data to generate machine-interpretable code. A vision system optically scans bar code labels and places the resulting digital camera data into a two dimensional line scan data array of pixels. A process.sub.-- line function then searches the scan data array for three lines that intersect the initial bars and spaces of the bar code (called starting lines) and 3 lines that intersect the last bars and spaces (called ending lines). For each pair of starting and ending lines, a build.sub.-- composite generates a composite line using pixels in positions between the first pixel of a starting line and the last pixel of a corresponding ending line. A run.sub.-- length decode function is then invoked on each composite line to create a run length array of width values, each of which indicates the width (in pixels) of a bar or space of the bar code. Using statistical analysis, a convert.sub.-- bars.sub.-- and.sub.-- spaces function converts the run length array to a bar and space array of binary width values. The three resulting bar and space arrays are synthesized by a vote.sub.-- bars.sub.-- and.sub.-- spaces function. Finally, a build.sub.-- bar.sub.-- code function identifies machine-interpretable values (e.g., ASCII codes) represented by the width values in the synthesized bar and space array.

System and method for converting bar code scan line data into

A method and apparatus are described for on-the-fly cataloging of library cell contents in an automated robotic tape library. This method decouples the robotic arm motion/tape cartridge label scanning process from the image processing software/hardware. In accordance with the present invention, tape cartridge label images are captured at a library system processor priority which is higher than the priority of the image processing task. These captured images are stored in a circular buffer while image processing continues to take place in a lower priority task. Both the image processing system hardware and software are asynchronous with respect to the velocity of the robotic arm used to scan the tape cartridge cells. The scanning velocity of the robotic arm can be maximized with respect to purely mechanical, electrical, or optical camera considerations and is independent of the library system processor image processing speed. The present method provides a further advantage with respect to robotic arm position calibration. Not only can tape cartridge labels be read with maximum camera line speed, but arm calibration data can also be read on-the-fly to allow continual and rapid verification and calibration of robotic arm positioning.

Growing community of inventors

Louisville, CO, United States of America

David L Trachy