Browse Prior Art Database

Dynamic Reordering Storage

IP.com Disclosure Number: IPCOM000080495D
Original Publication Date: 1973-Dec-01
Included in the Prior Art Database: 2005-Feb-27
Document File: 1 page(s) / 12K

Publishing Venue

IBM

Related People

Beaosoleil, WF: AUTHOR [+2]

Abstract

When items are stored in linear patterns for acquisition by a common retrieval mechanism, the most recently acquired item is replaced in its linear pattern at a position which represents the minimum movement by the retrieval mechanism, the relative order of the remaining items being preserved. It is found that for many cases, there is a high probability that recently acquired items will be called for in preference to the remaining items, and since, for example, electronic tracking of particular items is far quicker to effect than mechanical movement, the average acquisition time can be greatly enhanced by such a scheme.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 72% of the total text.

Page 1 of 1

Dynamic Reordering Storage

When items are stored in linear patterns for acquisition by a common retrieval mechanism, the most recently acquired item is replaced in its linear pattern at a position which represents the minimum movement by the retrieval mechanism, the relative order of the remaining items being preserved. It is found that for many cases, there is a high probability that recently acquired items will be called for in preference to the remaining items, and since, for example, electronic tracking of particular items is far quicker to effect than mechanical movement, the average acquisition time can be greatly enhanced by such a scheme.

The above appears particularly appropriate to data storage systems, in which data is stored in a bank of discrete storage media (such as tape cassettes, cards, disc packs) having a common read station and a retrieval mechanism, arranged to lift a storage medium from the bank and transfer it to the read station and to return it. The retrieval mechanism can comprise a three-dimensional address decoder and medium location memory coupled to a transfer mechanism responsive to one pair of dimension signals, and a bank row movement mechanism responsive to a different pair of dimension signals.

In response to an access instruction, the memory contents are processed to define the current coordinates of the requested medium and the row movement mechanism actuated to move the row containing the requested medium, until the requested...