By Topic

On the Complexity of Permuting Records in Magnetic Bubble Memory Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
K. M. Chung ; Wang Laboratories, One Industrial Avenue, Lowell, Massachusetts 01851, USA ; F. Luccio ; C. K. Wong

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 log2 n, 2√n, (log2 n - log2 log2 n)2, and k switches; their respective time complexities are essentially (3/2)n log2 n, (5/2)n, (7/2)n, and 2−1/kkn1+(1/k); and their respective numbers of control states are essentially 4 log2 n, 2√n+1, 2n/log2 n, and 4k.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:24 ,  Issue: 1 )