This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Anticipatory Control of a Cyclically Permutable Memory
May 1973 (vol. 22 no. 5)
pp. 481-488
C.K. Wong, IBM T. J. Watson Research Center
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.
Index Terms:
Anticipatory control, bubble-domain memory, cyclically permutable memory, drum-like storage, expected access time, lookahead, Markov chain.
Citation:
C.K. Wong, P.C. Yue, "The Anticipatory Control of a Cyclically Permutable Memory," IEEE Transactions on Computers, vol. 22, no. 5, pp. 481-488, May 1973, doi:10.1109/T-C.1973.223751
Usage of this product signifies your acceptance of the Terms of Use.