Efficient sorting with CCD's and magnetic bubble memories

Authors:
Oharma P. Agrawal;Krishna K. Agarwal
Affiliations:
Department of Electrical and Computer Engineering, Wayne State University, Detroit, MI;Department of Computer Science, Wayne State University. Detroit, MI
Venue:
IEEE Transactions on Computers
Year:
1981

Citing 7
Cited 0

An introduction to data structures with applications (2nd ed.)

An introduction to data structures with applications (2nd ed.)
Optimal shift strategy for a block-transfer CCD memory

Communications of the ACM
Intelligent magnetic bubble memories

ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
The Movement and Permutation of Columns in Magnetic Bubble Lattice Files

IEEE Transactions on Computers
On the Generation of Permutations in Magnetic Bubble Memories

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

Quantified Score

Hi-index	14.98

Visualization

Abstract

The use of sorting in various computer-related applications such as database management, is well established. Normally, sorting is implemented by employing a combination of hardware and software techniques. In this correspondence we examine the utility of serial-shifting nature of the chargecoupled device (CCD) and the magnetic bubble memories for achieving low-cost sorting within the secondary storage. The radix-sort method has been found to be very suitable for this purpose. Five different memory organizations implementing radix sort have been described in detail and their relative merits are also outlined.