doi: 10.17586/2226-1494-2018-18-6-1023-1033


OPEN DATAFLOW-SYSTEMS WITH NETWORK STRUCTURE

R. A. Lantsov


Read the full article  ';
Article in Russian

For citation:
Lantsov R.A. Open dataflow-systems with network structure. Scientific and Technical Journal of Information Technologies, Mechanics and Optics , 2018, vol. 18, no. 6, pp. 1023–1033 (in Russian). doi: 10.17586/2226-1494-2018-18-6-1023-1033.


Abstract
The paper considers open computing systems, which provide the necessary growth of performance and memory by mechanical addition of new units without affecting the existing software environment. Such computing systems are based on the application of a special functionally complete element base (planner, functor, communicator) that implements parallel processing using dataflow control flows when necessary program fragments are transferred along with the data. Aimed at this, when a certain procedure is found ready for starting  (the planner is ready for all the data it needs), the corresponding part of the program is opened in the planner – the operator, which is then transferred along with the data to the free execution device – the functor. The result is always returned along the same route by which the procedure was activated. The layouts of the open systems using two units of design are considered: cells on the reduced element base, and servers assembled from these cells. A two-level distributed switching environment is used. At the cell level, it is provided by the transit properties of the planners and functors, and at the server level – by communicators that are part of the cells. Three types of cells are identified, which enable the growth of computing system functions: cells for increasing the number of gateways used to exchange with the external environment, cells for increasing control and working memory, cells for increasing performance. The recession of the concentrated switching environment allowed for these types of computing systems extensions to be performed independently and without any restrictions on their size. A three-dimensional structure of open systems is described, which can be used to build supercomputers.

Keywords: open systems, dataflow-architecture, operator control level, planner, functor, communicator

References
  1. Lantsov R.A. Level dataflow-architecture for processing of large signal flows. Proc. Innovative Implementations in Technical Sciences. Moscow, 2018, pp. 7–12. (in Russian)
  2. Peterson J.L. Petri Net Theory and the Modeling of Systems. Prentice-Hall, 1981, 257 p.
  3. Dennis J.B., Misunas D.P. A preliminary architecture for a basic data flow processor. ACM SIGARCH Computer
    Architecture News, 1974, vol. 3, no. 4, pp. 126–132. doi: 10.1145/641675.642111
  4. Lantsov R.A. Dataflow-architecture for processing signals today and in perspective. Vestnik KGTU im. A.N. Tupoleva, 2016, no. 3, pp. 141–149. (in Russian)
  5. Strel'tsov N.V. Organization of multicellular processing. Proc. 4th Int. Conf. on Parallel Computing and Control Problems. Moscow, 2008. (in Russian)
  6. Young S.D., Wills R.W.Performance Analysis of a Large-Grain Dataflow Scheduling Paradigm. NASA Langley, Virginia, 1993, 8 p.
  7. Klimov A., Okunev A., Stepanov A. Study of the possibilities of managing the computations distribution by computational modules. Available at: ipmce.ru/about/press/articles/issled_rasvich (accessed: 03.10.2018).
  8. Klimov A., Okunev A., Stepanov A. Problems of development of dataflow computing model and features of its architectural implementation. Available at: ipmce.ru/about/press/articles/ problem_dataflow(accessed: 03.10.2018).
  9. Dmitrienko N.N., Kalyaev I.A. et al.System of multiprocessor computing systems with a dynamically tunable structure. Available at: fpga.parallel.ru/papers/dmitrenko.pdf (accessed: 03.10.2018).
  10. Voigt S., Baesler M., Teufel T. Dynamically reconfigurable dataflow architecture for high-performance digital signal processing. Journal of Systems Architecture, 2010, vol. 56, no. 11, pp. 561–576. doi: 10.1016/j.sysarc.2010.07.010
  11. Lantsov A.L., Lantsov R.A. Use PF-networks for speed mathematical calculation. Vestnik KGTU im. A.N. Tupoleva, 2016, no. 4, pp. 125–135. (in Russian)
  12. Lantsov R.A. Basis of parallel control in PF-networks. Vestnik KGTU im. A.N. Tupoleva, 2017, no. 1, pp. 96–105. (in Russian)
  13. Lantsov A.L., Lantsov R.A. Implementation of FFT in PF-network. Vestnik KGTU im. A.N. Tupoleva, 2017, no. 1, pp. 106–115.(in Russian)
  14. Demichev A.P., Il'in V.A., Kryukov A.P. Introduction to Grid Technology. Preprint NIINP MSU-2007-11/832. (in Russian)


Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
Copyright 2001-2024 ©
Scientific and Technical Journal
of Information Technologies, Mechanics and Optics.
All rights reserved.

Яндекс.Метрика