Abstract
Important problems, arising both in the design of new, and the use of series-produced, special-purpose digital computers (SPDC) are those of the algorithmization and programming of tasks. More rigid constraints are imposed on programs destined for SPDC than on those written to solve problems on general-purpose digital computers. The explanation for this is that the basic engineering characteristics of SPDC (volumes of the various types of memory devices, energy requirements, speed) are, to a significant degree, determined by the structure of the programs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Literature Cited
V. M. Glushkov, Synthesis of Digital Automata, Fizmatgiz (1962).
V. G. Lazarev and E. I. Piil’, “Methods of unifying algorithms,” in: Sb. Tr. Nauchn.-Issled, Inst. Telefon. Svyazi, No. 10 (1962).
V. F. D’yachenko, “Transformations of logical schemes of algorithms,” in: Principles of Constructing Control Networks and Systems, Izd. “Nauka” (1964).
N. V. Bukhgol’ts, V. F. D’yachenko, V. G. Lazarev, K. K. Chernyshev, and V. A. Sharov, “On the question of economizing digital computer operational memory,” in: Computing Systems, Vol. 18, Novosibirsk (1965).
N. A. Krinitskii, G. A. Mironov, and G. D. Frolov, Programming, Fizmatgiz (1963).
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1969 Consultants Bureau, New York
About this chapter
Cite this chapter
Chernyshev, K.K. (1969). Economizing Program Memory of Special-Purpose Digital Computers. In: Lazarev, V.G., Zakrevskii, A.V. (eds) Synthesis of Digital Automata / Problemy Sinteza Tsifrovykh Avtomatov / Проƃлемы Синтеза Цифровых Автоматов. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-9033-6_13
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9033-6_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-9035-0
Online ISBN: 978-1-4684-9033-6
eBook Packages: Springer Book Archive