Abstract
In this paper we study the problem of permuting records in various simple models of magnetic bubble memories. Previous studies usually assumed the memory system either had one switch or n independently controlled switches, where n is the number of records to be permuted. In the former case, the time complexity to permute a set of n records is O(n2), while in the latter case, the time complexity is O(n). In this paper, we propose several simple models of bubble memory systems with their numbers of switches ranging between 1 and n and analyze the respective time complexities and respective numbers of control states for some permutation algorithms designed especially for them. Specifically, four models are studied: They have essentially log2n, 2√n, (log2n - log2log2 n)2, and k switches; their respective time complexities are essentially (3/2)n log2n, (5/2)n, (7/2)n and 2-1/k kn1+(1/k); and their respective numbers of control states are essentially 4 log2n, 2√n+1, 2n/log2n, and 4k.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
