PERMUTATION OF DATA BLOCKS IN A BUBBLE MEMORY

被引：5

作者：

BONGIOVANNI, GC

LUCCIO, F

机构：

[1] Istituto di Scienze dell' Informazione, University of Pisa, 56100 Pisa

来源：

COMMUNICATIONS OF THE ACM | 1979年 / 22卷 / 01期

关键词：

bubble memory; data block shift; memory loops; permutation algorithm;

D O I：

10.1145/359046.359051

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. © 1979, ACM. All rights reserved.

引用

页码：21 / 25

页数：5

共 8 条

[1] MAGNETIC BUBBLE MEMORY ORGANIZATION [J].

BEAUSOLEIL, WF ;

BROWN, DT ;

PHELPS, BE .

IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1972, 16 (06) :587-+

[2]

BONGIOVANNI G, 1978, S788 U PIS I SCI INF

[3] DYNAMIC DATA REALLOCATION IN BUBBLE MEMORIES [J].

BONYHARD, PI ;

NELSON, TJ .

BELL SYSTEM TECHNICAL JOURNAL, 1973, 52 (03) :307-317

[4]

CHANG H, 1972, IEEE T MAGN, VMAG8, P564, DOI 10.1109/TMAG.1972.1067453

[5]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[6] BUBBLE LADDER FOR INFORMATION-PROCESSING [J].

TUNG, C ;

CHEN, TC ;

CHANG, H .

IEEE TRANSACTIONS ON MAGNETICS, 1975, 11 (05) :1163-1165

[7] GENERATION OF PERMUTATIONS IN MAGNETIC-BUBBLE MEMORIES [J].

WONG, CK ;

COPPERSMITH, D .

IEEE TRANSACTIONS ON COMPUTERS, 1976, 25 (03) :254-262

[8]

WONG CK, 1977, SEP P ALL C

← 1 →