Showing papers in "Cybernetics and Systems Analysis in 1975"
239 citations
37 citations
30 citations
29 citations
20 citations
19 citations
16 citations
13 citations
TL;DR: This paper considers another ‘schemata’ model for use in representing and analyzing parallelism and parallel algorithms, breaking with tradition, however, the model is not completely new and does not possess unique notation.
Abstract: We begin with the following key remarks by D. R. Slutz, quoted from the opening paragraph of one of the papers surveyed (115): “This paper considers another ‘schemata’ model for use in representing and analyzing parallelism and parallel algorithms. Breaking with tradition, however, the model is not completely new and does not possess unique notation.”
13 citations
12 citations
TL;DR: The search for ways to enhance the performance of computer equipment eventually led, in the 1950s, to the notion of parallel data processing on multiprocessor parallel computer systems, made up of a number of computing units known as processors.
Abstract: The search for ways to enhance the performance of computer equipment eventually led, in the 1950s, to the notion of parallel data processing on multiprocessor parallel computer systems. These systems are made up of a number of computing units known as processors. Each processor executes, concurrently with the others, some fragment of the computation; the result produced by one processor can be made accessible to the others for further processing. The structure and organization of a multiprocessor computer system can vary: The processors may be of the same type or have different properties; each of the processors may have its own memory and they may exchange data over permanent or dynamically assigned channels, or the processors may all access one central memory through which data are exchanged; supervisory control of the concurrent operation of and exchange of information between processors may be centralized or allocated among the processors; finally, the system may have a hierarchic structure, in which each processor may be organized as a multiprocessor system.
TL;DR: The proposed operating-system structure is directed toward isolating from the mass of modern software some foundation which could be worked out in the foreseeable future with comparatively modest resources and could be a natural base for the development of finished data-processing systems tailored for certain groups of users.
Abstract: The proposed operating-system structure is directed toward isolating from the mass of modern software some foundation which, on the one hand,could be worked out in the foreseeable future with comparatively modest resources and, on the other hand, could be a natural base for the development of finished data-processing systems tailored for certain groups of users. If BOS can be implemented in a dimension of 700 to 1000 K words, then it can be considered a realistic task to create it in approximately four years. The following people influenced the content of this paper, either by their own work or through discussions: J. Radin (IBM), M. R. Shura-Bura, E. Z. Lyubimskii, V. S. Shtarkman (IPM), B. A. Babayan, V. S. Burtsev, L. N. Korolev (ITM), R. Barton (University of Utah), J. Dennis, F. Korbato (MTI), G. I. Kozhukhin, I. V. Pottosin (Computing Center, SO AN SSSR).