Permutation of data blocks in a bubble memory
Communications of the ACM
The Movement and Permutation of Columns in Magnetic Bubble Lattice Files
IEEE Transactions on Computers
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
The Generation of Permutations in Magnetic Bubble Memories
IEEE Transactions on Computers
Magnetic bubble memory organization
IBM Journal of Research and Development
On the complexity of permuting records in magnetic bubble memory systems
IBM Journal of Research and Development
Storage management operations in linked uniform shift-register loops
IBM Journal of Research and Development
An On-Chip Compare/Steer Bubble Sorter
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
The Parallel Enumeration Sorting Scheme for VLSI
IEEE Transactions on Computers
The VLSI Complexity of Sorting
IEEE Transactions on Computers
IBM Journal of Research and Development
VLSI Sorting with Reduced Hardware
IEEE Transactions on Computers
| Hi-index | 15.00 |
In this paper the problem of sorting in various models of magnetic bubble memory systems is studied. Three basic parameters are of interest, namely, the number of steps to sort, the number of switches required, and the number of control states necessary for the switches. Several sorting algorithms are proposed with respective running times essentially n2, n/2, 1/2 n log2 n, 7/2 n, n log