Permutation of data blocks in a bubble memory

Authors:
Gian Carlo Bongiovanni;Fabrizio Luccio
Affiliations:
Univ. of Pisa, Pisa, Italy;Univ. of Pisa, Pisa, Italy
Venue:
Communications of the ACM
Year:
1979

Citing 1
Cited 4

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching

On the Complexity of Sorting in Magnetic Bubble Memory Systems

IEEE Transactions on Computers
Maintaining Sorted Files in a Magnetic Bubble Memory

IEEE Transactions on Computers
A Tree Storage Scheme for Magnetic Bubble Memories

IEEE Transactions on Computers
On the complexity of permuting records in magnetic bubble memory systems

IBM Journal of Research and Development

Quantified Score

Hi-index	48.23

Visualization

Abstract

A common internal organization of bubble memories consists of a set of (minor) loops, connected through another (major) loop. The problem of obtaining any given permutation of the minor loop contents in minimum time is studied in this paper. A lower bound to the number of steps required by a permutation algorithm is derived, and the class of optimum algorithms is identified.