About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE TC
Paper
The Anticipatory Control of a Cyclically Permutable Memory
Abstract
A control method based on anticipatory shift with lookahead is proposed for accessing files stored in a cyclically permutable memory as characterized by, for example, bubble-domain devices. The performance of this method is analyzed and is shown to yield significant reduction of access time. By using a basic simple model, an explicit formula is obtained for relating performance to the size of requests, the shift register length, and the number of control sections allowed. Several generalizations are also discussed. Copyright © 1973 by The Institute of Electrical and Electronics Engineers, Inc.