Answers are grounded in this paper and cite their sources.
Continuous processing of large volumes of information on virtual computer memory was considered as technically not realized. This problem is not technical, but algorithmic. In article the solution of this problem is considered: creation of programs with the determinate-connected modules; structure of the supercomputer for continuous processing of programs with the determinate-connected modules; management of the continuous automated processing of programs with the determinate-connected modules on virtual memory without delay of obtaining results because of exchanges of information between random access and external memory. Also block structure of segments of random access memory with anticipatory switching of blocks of random access memory with processors for optimum processing of programs with the determinate-connected modules is considered. The formalism of operator schemes with natural interpretation is developed for reduction of programs with nondeterministic communications of modules to programs with the determined tactics and the strategy of behavior. This formalism is used for the proof of resolvability of a problem of creation of programs with the determinate-connected modules. In the offered theory of operator schemes the problem of creation of programs with determinate appeals to modules is solvable. Continuous processing of programs with the determinate-connected modules on virtual memory of the universal supercomputer with anticipatory management of memory reduces waiting time of result exponential when processing on virtual memory of the target computer in comparison with the existing supercomputers with casual management of memory.
No takes yet. Share an insight, caveat, or question.
Evgeniy Bryndin (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: