Operating Systems Theory
Dynamic Memories with Enhanced Data Access
IEEE Transactions on Computers
Traversing Binary Tree Structures with Shift-Register Memories
IEEE Transactions on Computers
Interconnection networks: a survey and assessment
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
The Generation of Permutations in Magnetic Bubble Memories
IEEE Transactions on Computers
Data organization in magnetic bubble lattice files
IBM Journal of Research and Development
| Hi-index | 14.99 |
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.