main| new issue| archive| editorial board| for the authors| publishing house|
Πσρρκθι
Main page
New issue
Archive of articles
Editorial board
For the authors
Publishing house

 

 


ABSTRACTS OF ARTICLES OF THE JOURNAL "INFORMATION TECHNOLOGIES".
No. 1. Vol. 29. 2023

DOI: 10.17587/it.29.3-11

O. V. Nepomnyashchiy, Cand. Tech. Sc., Assistant Professor,
Siberian Federal University, Krasnoyarsk, 660041, Russian Federation

On the Correctness of Equivalent Transformations in the Process of Functional-Flow, High-Level VLSI Synthesis

The original method and route of functional-flow synthesis of ultra-large integrated circuits is considered. A way of reducing the degree of parallelism and the original algorithms is presented. When transferring the algorithm to the target platform, the imposed restrictions are taken into account. It is proposed to use the developed methods of formal verification to confirm the adequacy of the results of the transformation We mean to the transformation from the algorithms descried in the functional-flow parallel programming language to the hardware description languages.

Keywords: parallel programming, digital integrated circuit, high-level synthesis, formal verification, proof

P. 3–11

References

  1. Jack Dongarra. PaRSEC: A programming paradigm exploiting heterogeneity for enhancing scalability, IEEE Computing in Science and Engineering, 2013, vol. 15, no. 6, pp. 36—45
  2. Jack Dongarra. PTG: An Abstraction for Unhindered Parallelism, Proceedings of the Fourth International Workshop on Domain-Specific Languages and High-level Frameworks for High Performance Computing, 2014, pp. 21—30.
  3. Nepomnyashchiy O., Legalov A., Typkin V., Ryzhenko I., Shaydurov V. Methods and alghoritms for a High-Level synthesis of the very-large-scale integratuion, WSEAS Transactions on Computers, 2016, no. 15, pp. 239—247.
  4. Ryzhenko I. N., Nepomnyashchiy O. V. High-level synthesis method and software tools for describing algorithms of VLSI operation, Programmnaya ingeneria, 2020, vol. 11, no. 1, pp. 35—39 (in Russian).
  5. Ryzhenko I. N., Nepomnyashchiy O. V., Legalov A. I. Method of architecture-independent high-level synthesis, Izvestiya YFU. Tehnicheskiye nauki, 2018, no. 8, pp. 36—47 (in Russian).
  6. Legalov A. I. Functional language for creating architecture-independent parallel programs, Vychislitelnye tehnologii FIZ IVT, 2005, no. 1 (10), pp. 71—89 (in Russian).
  7. Ryzhenko I. N., Nepomnyashchiy O. V., Legalov A. I., Shaydurov V. V. Parallelism transformation methods in the process of high-level VLSI synthesis, Modelirovanie i analiz informacionnyh sistem, 2022, vol. 29, no. 1, pp. 31—42 (in Russian).
  8. Nazeih M. Botros. HDL Programming Fundamentals: VHDL and Verilog (DaVinci Engineering), Career & Professional Group, 2006, pp. 506.
  9. Nepomnyashchiy O. V., Ryzhenko I. N., Legalov A. I. Method of architecture-independent high-level synthesis of VLSI, Izvestiya YFU. Tehnicheskiye nauki, 2018, no. 8 (202), pp. 38—47 (in Russian).
  10. Kropacheva (Ushakova) M. S., Legalov A. I. Formal Verification of Programs Written in a Functional Flow Parallel Programming Language, Modelirovanie i analiz informacionnyh sistem, 2012, vol. 19, no. 5, pp. 81—99 (in Russian).
  11. Kropacheva (Ushakova) M. S., Legalov A. I. Formal Verication of Programs in the Pifagor Language, Parallel Computing Technologies (PaCT-2013) 12th International Conference, September 30 — October 4, 2013. Saint-Petersburg, Russia. LNCS, 2013, vol. 7979, pp. 80—89.
  12. Ushakova M. S., Legalov A. I. Verification of programs with mutual recursion in the Pifagor language, Modelirovanie i analiz informacionnyh sistem, 2018, vol. 25, no. 4, pp. 358—381 (in Russian).
  13. Ushakova M. S., Legalov A. I. Automation of Formal Verication of Programs in the Pifagor Language, Modeling and Analysis of Information Systems, 2015, vol. 22, no. 4, pp. 578—589.
  14. Nepomnyashchiy O. V. Resource Estimation Method in the Process of Functional Flow High-Level Synthesis of VLSI, Prikladnaya informatika, 2022, vol. 17, no. 3, pp. 34—44 (in Russian).

To the contents