Construction and Continuous Processing of Programs with Determinate-Connected Modules

Evgeniy Bryndin

doi:doi:10.11648/j.ajece.20170101.11

| Peer-Reviewed

Construction and Continuous Processing of Programs with Determinate-Connected Modules

Evgeniy Bryndin

Published in American Journal of Electrical and Computer Engineering (Volume 1, Issue 1)

Received: 29 January 2017 Accepted: 28 February 2017 Published: 15 March 2017

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

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.

Published in	American Journal of Electrical and Computer Engineering (Volume 1, Issue 1)
DOI	10.11648/j.ajece.20170101.11
Page(s)	1-8
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2017. Published by Science Publishing Group

Keywords

Programs with the Determinate-Connected Modules, Anticipatory Switching of Memory with Processors, Anticipatory Replacement of Modules of the Program

References

[1]	E. Khant, D. Tomas. Programmist-pragmatik. M: Izdatel'skii dom: Lori. 2004. 250 s.
[2]	Kharol'd Abel'son, Dzheral'd Dzhei Sassman. Struktura i Interpretatsiya Komp'yuternykh Programm. Izdatel'stvo: Dobrosvet. 2004. 596 s.
[3]	D. Knut «Iskusstvo programmirovaniya». T. 1-4. Massachusetts: Addison-Wesley. 2001-2008.
[4]	Bryndin E. G. Teoreticheskie aspekty nepreryvnoi obrabotki na virtual'noi pamyati. Informatsionnye tekhnologii. – M., 2009. – № 9. S. 33–39.
[5]	Stiv Makkonnell. Sovershennyi kod. Izdatel'stvo: Russkaya redaktsiya. 2010. 896 s.
[6]	Dzhordzh Riz. Cloud Application Architectures. BKhV-Peterburg. 2011. 288 s.
[7]	Bryndin E. G. Teoreticheskie osnovy imitatsii myshleniya i nepreryvnoi obrabotki na virtual'noi pamyati. – Tomsk: Izd-vo TPU, 2011. – 235 s.
[8]	Evgenii Bryndin. Osnovy imitatsii myshleniya i nepreryvnoi obrabotki programm. – Germany: LAP LAMBERT Academic Publishing, 2012. – 197 s.
[9]	Bryndin E. G. Upravlenie nepreryvnoi obrabotkoi programm na virtual'noi pamyati. /SUPERKOMP''YuTERY, № 3. 2014. S. 50-52.
[10]	E. G. Bryndin. Tekhnologicheskie platformy shestogo uklada. //Reputatsiologiya № 3. –M. - 2014 – S. 56-64.
[11]	Bryndin E. G. Nepreryvnaya obrabotka programm supercomputers uprezhdayushchim upravleniem pamyat'yu. Vseros. Nauch.-prakt. konf. «Mnogoyadernye protsessory, parallel'noe programmirovanie, PLIS, sistemy obrabotki signalov (MPPOS – 2015)». Barnaul: BGU. 2015. S. 20-27.
[12]	Bryndin E. G. Reshenie problemy nepreryvnoi obrabotki programm na virtual'noi pamyati. "Vestnik PNIPU: Elektrotekhnika, Informatsionnye tekhnologii, Sistemy upravleniya", № 13. Perm': PNIPU. 2015. S. 91-107.

Cite This Article

Plain Text BibTeX RIS

APA Style

Evgeniy Bryndin. (2017). Construction and Continuous Processing of Programs with Determinate-Connected Modules. American Journal of Electrical and Computer Engineering, 1(1), 1-8. https://doi.org/10.11648/j.ajece.20170101.11

Copy | Download

ACS Style

Evgeniy Bryndin. Construction and Continuous Processing of Programs with Determinate-Connected Modules. Am. J. Electr. Comput. Eng. 2017, 1(1), 1-8. doi: 10.11648/j.ajece.20170101.11

Copy | Download

AMA Style

Evgeniy Bryndin. Construction and Continuous Processing of Programs with Determinate-Connected Modules. Am J Electr Comput Eng. 2017;1(1):1-8. doi: 10.11648/j.ajece.20170101.11

Copy | Download

@article{10.11648/j.ajece.20170101.11,
  author = {Evgeniy Bryndin},
  title = {Construction and Continuous Processing of Programs with Determinate-Connected Modules},
  journal = {American Journal of Electrical and Computer Engineering},
  volume = {1},
  number = {1},
  pages = {1-8},
  doi = {10.11648/j.ajece.20170101.11},
  url = {https://doi.org/10.11648/j.ajece.20170101.11},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajece.20170101.11},
  abstract = {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.},
 year = {2017}
}

Copy | Download

TY  - JOUR
T1  - Construction and Continuous Processing of Programs with Determinate-Connected Modules
AU  - Evgeniy Bryndin
Y1  - 2017/03/15
PY  - 2017
N1  - https://doi.org/10.11648/j.ajece.20170101.11
DO  - 10.11648/j.ajece.20170101.11
T2  - American Journal of Electrical and Computer Engineering
JF  - American Journal of Electrical and Computer Engineering
JO  - American Journal of Electrical and Computer Engineering
SP  - 1
EP  - 8
PB  - Science Publishing Group
SN  - 2640-0502
UR  - https://doi.org/10.11648/j.ajece.20170101.11
AB  - 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.
VL  - 1
IS  - 1
ER  -

Copy | Download

Author Information

Evgeniy Bryndin

Research Centre "NATURAL INFORMATIC", National Supercomputer Technological Platform, Novosibirsk, Russia

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Evgeniy Bryndin. (2017). Construction and Continuous Processing of Programs with Determinate-Connected Modules. American Journal of Electrical and Computer Engineering, 1(1), 1-8. https://doi.org/10.11648/j.ajece.20170101.11

Copy | Download

ACS Style

Evgeniy Bryndin. Construction and Continuous Processing of Programs with Determinate-Connected Modules. Am. J. Electr. Comput. Eng. 2017, 1(1), 1-8. doi: 10.11648/j.ajece.20170101.11

Copy | Download

AMA Style

Evgeniy Bryndin. Construction and Continuous Processing of Programs with Determinate-Connected Modules. Am J Electr Comput Eng. 2017;1(1):1-8. doi: 10.11648/j.ajece.20170101.11

Copy | Download

@article{10.11648/j.ajece.20170101.11,
  author = {Evgeniy Bryndin},
  title = {Construction and Continuous Processing of Programs with Determinate-Connected Modules},
  journal = {American Journal of Electrical and Computer Engineering},
  volume = {1},
  number = {1},
  pages = {1-8},
  doi = {10.11648/j.ajece.20170101.11},
  url = {https://doi.org/10.11648/j.ajece.20170101.11},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajece.20170101.11},
  abstract = {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.},
 year = {2017}
}

Copy | Download

TY  - JOUR
T1  - Construction and Continuous Processing of Programs with Determinate-Connected Modules
AU  - Evgeniy Bryndin
Y1  - 2017/03/15
PY  - 2017
N1  - https://doi.org/10.11648/j.ajece.20170101.11
DO  - 10.11648/j.ajece.20170101.11
T2  - American Journal of Electrical and Computer Engineering
JF  - American Journal of Electrical and Computer Engineering
JO  - American Journal of Electrical and Computer Engineering
SP  - 1
EP  - 8
PB  - Science Publishing Group
SN  - 2640-0502
UR  - https://doi.org/10.11648/j.ajece.20170101.11
AB  - 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.
VL  - 1
IS  - 1
ER  -

Copy | Download