The paper covers the classification and functional description of electronic buffer memories (i.e., buffers made of semiconductor store and logic). The classification is made according to the servicing policies imposed upon the input stream. Within each class various buffering schemes are examined taking into consideration the input stream characteristics, speed and buffer size requirements, types of memory and circuit technology. Application areas of the buffers, such as computer channels and information distribution systems are cited.
Get full access to this article
View all access options for this article.
References
1.
LuckS. E.‘Impact of scratchpads in design: Multifunctional scratchpad memories in the Burroughs B8500’, AFIPS: FJCC1965.
2.
WilkesM. V.‘Slave Memories and Segmentation’, IEEE Trans. on Computers (June 1971).
3.
HalmJ.‘The design of buffer memories for multichannel neutron time-of-flight analysis’, IEEE Trans. on Nucl. Sci., NS-15, 1, 157 (1968).
4.
PercivalR.‘Dynamic MOS shift registers can also simulate, stack and silo memories’, Electronics (Nov. 8, 1971).
5.
PhilokyprouG. and ZacharakopoulosA.‘The stacking register-A simultaneous input/output buffer’, Nucl. Instrum. and Methods, 65, pp. 202–204 (1968).
6.
HalmJ.ZidonA.‘The design of derandomizing buffer stores for high data rates’, IEEE Trans on Nucl. Sci., NS-16, 1, 154 (1969).
7.
HalatsisC. C.‘Hardware considerations of executive and information retrieval systems,’ Ph.D. Thesis, Univ. of Manchester (Aug. 1971).
8.
MaritsasD. G. and HartleyM. G.‘A case study of a versatile generator of repeatable non-Poisson sequences of pseudorandom pulses’, IEEE Trans. on Computers (Oct. 1970).
9.
MaritsasD. G. and HartleyM. G.‘Buffer length for Erlang input with constant removal rates’, IEEE Trans. on Computers (Sept. 1970).
10.
TzafestasS. and PhilokyprouG.‘On the design of electronic buffer memories’, Proceedings of Inter. Symp. on the Design and Appl. of Logical Syst., Brussels, pp. 1061–1075 (1969).
11.
PhilokyprouG. and TzafestasS.‘An information distribution system using an electronic buffer memory’, Presented at the ACM Intern. Computing Symp. 1970, Bonn, Germany (May 21–22).
12.
FloresI.‘A record Look-up Memory sub-system for software facilitation’, Computer Design (April 1969).
13.
ChristieJ. and SherlockJ.‘A list-processing store using large scale integration’, IEE Conf. Publication55 (1969).
14.
LiptayJ. S.‘Structural aspects of the System/360 Model 85, II. The caché’, IBM Systems J., Vol. 7, No. 1 (1968).
15.
GibsonD. H.‘Considerations in block-oriented systems design’, AFIPS, SJCC 30 (1967).
16.
GibsonD. H.“Caché” turns up a treasure', Electronics (Oct. 13, 1969).
17.
BellC. G. and CasasentD.‘Implementation of a buffer memory in mini-computers’, Computer Design (Nov. 1971).
18.
TuckerA. B. and FlynnM. J.‘Dynamic microprogramming: Processor organization and programming’, Comm. of ACM (April 1971).
19.
HatchT., ‘Hardware/software interactions on the Honeywell model 8200’, AFIPS, FJCC (1968).
20.
ErwinJ. D. and JensenE. D.‘Interrupt processing with queued content-addressable memories’, AFIPS, FJCC (1970).
21.
BatcherK. E.‘Sorting networks and their applications’, AFIPS, SJCC, 1963.
22.
StoneH. S.‘Parallel processing with the Perfect Shuffle’, IEEE Trans. on Computers (Feb. 1971).
23.
KautzW. H.‘Cellular logic-in-memory arrays’, IEEE Trans. on Computers (Aug. 1969).
24.
BradleyJ.‘Hardware Methods to replace software procedures in sorting and array calculations’, Ph.D. Thesis, University of Manchester (Feb. 1972).
