ACM

Communications of the ACM

Home/Magazine Archive/January 1979 (Vol. 22, No. 1)/Permutation of data blocks in a bubble memory/Abstract

Permutation of data blocks in a bubble memory

By Gian Carlo Bongiovanni, Fabrizio Luccio
Communications of the ACM, January 1979, Vol. 22 No. 1, Pages 21-25
10.1145/359046.359051
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.