Loading [MathJax]/extensions/MathMenu.js

Oleg G. Monakhov - IEEE Xplore Author Profile

Scheduled Maintenance on Monday 1/13/2025

Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.

IEEE.org
IEEE Xplore
IEEE SA
IEEE Spectrum
More Sites

- Donate
- Personal Sign In

Institutional Sign In

Institutional Sign In

ADVANCED SEARCH

Author details

Oleg G. Monakhov

Also published under: O. Monakhov, Oleg Monakhov, O. G. Monakhov

Publications

13

Citations

30

Publications by Year

19972023

Co-Authors:

O. J. ChunikhinE. LezhnevEmilia MonakhovaMillie PantAleksandr Y. Romanov

Show All Co-Authors (8)

Oleg G. Monakhov

Also published under: O. Monakhov, Oleg Monakhov, O. G. Monakhov

Affiliation

Siberian Branch of the Russian Academy of Sciences

Institute of Computational Mathematics and Mathematical Geophysics

Novosibirsk, Russia

Publication Topics

Destination Node,
Routing Algorithm,
Shortest Path,
Analysis Algorithm,
Average Minimum Distance,
Minimum Diameter,
Rhombus,
Source Node,
Vertices,
Coordinate Vector,
Dijkstra’s Algorithm,
Example Of Graph

Biography

Oleg G. Monakhov received the M.S. degree in system analysis from Novosibirsk Electrotechnical Institute, Novosibirsk, Russia, in 1974, and the Ph.D. degree in computer science from Taganrog State Radio Technical University, Taganrog, Russia, in 1987. From 2000 to 2002, he was a Visiting Professor with the University of Aizu, Aizu-Wakamatsu, Japan. He is currently a Leading Scientific Researcher with the System Modeling and Optimization Laboratory, Institute of Computational Mathematics and Mathematical Geophysics of SB RAS, Novosibirsk. He is the author of two books and 120 articles. His research interests include parallel computer architecture, network topologies, routing algorithms, evolutionary computation, genetic programming, and meta...

Publications

13

Citations

30

Publications by Year

19972023

Co-Authors:

O. J. Chunikhin
E. Lezhnev
Emilia Monakhova
Millie Pant
Aleksandr Y. Romanov

Show All Co-Authors (8)

Author's Published Works

Search History

Showing 1-13 of 13 results

Conferences (11)

Journals (2)

Sort

Filter Results

Show

Open Access Only

Range
Single Year
Oleg Monakhov(5)
Emilia Monakhova(4)
O.G. Monakhov(3)
Oleg G. Monakhov(3)
O. Monakhov(2)
Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk, Russia(7)
HSE University, Moscow, Russia(2)
Institute of Computational Mathematics and Mathematical Geophysics SD RAS, Novosibirsk, Russia(1)
Institute of Computational Mathematics and Mathematical Geophysics SB RAS (ICMMG), Novosibirsk, Russia(1)
Siberian Branch of the Russian Academy of Sciences, Institute of Computational Mathematics and Mathematical Geophysics, Novosibirsk, Russia(1)
2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT)(1)
2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)(1)
2018 XIV International Scientific-Technical Conference on Actual Problems of Electronics Instrument Engineering (APEIE)(1)
2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)(1)
2020 Moscow Workshop on Electronic and Networking Technologies (MWENT)(1)
IEEE(13)
Novosibirsk, Russia(3)
Chennai, India(1)
Dallas, TX, USA(1)
Honolulu, HI, USA(1)
Maldives, Maldives(1)
Shortest Path(6)
Routing Algorithm(5)
Vertex Degree(5)
Analysis Algorithm(4)
Destination Node(4)

Select All on Page

Sort By

Results

Routing Algorithms in Optimal Degree Four Circulant Networks Based on Relative Addressing: Comparative Analysis for Networks-on-Chip

Emilia A. Monakhova;Oleg G. Monakhov;Aleksandr Y. Romanov

IEEE Transactions on Network Science and Engineering

Year: 2023 | Volume: 10, Issue: 1 | Journal Article |

Cited by: Papers (8)

HTML

The solution of the problem of organizing optimal communications in circulant networks of degree four is considered. For a family of optimal circulant networks with the minimum diameter and average distance for any number of nodes in a graph, we propose an optimal pair routing algorithm of constant complexity based on using the relative addressing of nodes in a network. The new algorithm is an ana...Show More

Routing Algorithms in Optimal Degree Four Circulant Networks Based on Relative Addressing: Comparative Analysis for Networks-on-Chip

Emilia A. Monakhova;Oleg G. Monakhov;Aleksandr Y. Romanov

IEEE Transactions on Network Science and Engineering

Year: 2023 | Volume: 10, Issue: 1 | Journal Article |

Parallel genetic algorithm for synthesis of optimal circulant networks on Kunpeng processors

Oleg Monakhov;Emilia Monakhova

2022 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)

Year: 2022 | Conference Paper |

Cited by: Papers (1)

HTML

Parallel versions of the genetic algorithm based on the MPI model are implemented to optimize circulant networks, which are of practical interest in the design of systems on a chip and supercomputer systems. The problem of finding the optimal circulant networks with minimal average distance for the given number of nodes and given degree is investigated. An analysis of the effectiveness of parallel...Show More

Parallel genetic algorithm for synthesis of optimal circulant networks on Kunpeng processors

Oleg Monakhov;Emilia Monakhova

2022 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)

Year: 2022 | Conference Paper |

Optimal Routing Algorithm in Dense Gaussian Networks-on-Chip

E. Monakhova;O. Monakhov;E. Lezhnev;A. Romanov

2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME)

Year: 2022 | Conference Paper |

HTML

The article considers a family of dense Gaussian networks. Theese graphs are optimal circulant degree four graphs of the form $\boldsymbol{C}(\boldsymbol{D}^{2}+(\boldsymbol{D}+1)^{2},\ \boldsymbol{D},\ \boldsymbol{D}+1)$. For this family, as a topology of networks-on-chip, an $\boldsymbol{O}(1)$ algorithm for finding the shortest paths between vertices of a graph is developed. The proposed routin...Show More

Optimal Routing Algorithm in Dense Gaussian Networks-on-Chip

E. Monakhova;O. Monakhov;E. Lezhnev;A. Romanov

2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME)

Year: 2022 | Conference Paper |

Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies

Oleg G. Monakhov;Emilia A. Monakhova;Aleksandr Yu. Romanov;Andrej M. Sukhov;Evgenii V. Lezhnev

Year: 2021 | Volume: 9 | Journal Article |

Cited by: Papers (11)

HTML

A new pair routing algorithm for transmitting messages in multiprocessor systems and networks-on-chip based on circulant networks of arbitrary dimension is proposed. It allows using all reserve shortest paths in the presence of destructive factors (deadlocks, livelocks, starvation, failures) at the nodes and channels of the communication network. A distinctive feature of the proposed algorithm is ...Show More

Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies

Oleg G. Monakhov;Emilia A. Monakhova;Aleksandr Yu. Romanov;Andrej M. Sukhov;Evgenii V. Lezhnev

Year: 2021 | Volume: 9 | Journal Article |

A Generalized Routing Algorithm for a Family of Optimal 2D Circulant Networks Based on Relative Addressing

Emilia Monakhova;Oleg Monakhov

2021 17th International Asian School-Seminar "Optimization Problems of Complex Systems (OPCS)

Year: 2021 | Conference Paper |

Cited by: Papers (2)

HTML

The problem of the organization of optimal communications in circulant networks is considered. For a family of optimal two-dimensional circulant networks with the minimum diameter and average distance, the relative addressing of nodes of a network is introduced as shortest paths vectors from a fixed node. On its basis, a constant complexity pair routing algorithm using a set of shortest paths is p...Show More

A Generalized Routing Algorithm for a Family of Optimal 2D Circulant Networks Based on Relative Addressing

Emilia Monakhova;Oleg Monakhov

2021 17th International Asian School-Seminar "Optimization Problems of Complex Systems (OPCS)

Year: 2021 | Conference Paper |

Analytical Routing Algorithm for Networks-on-Chip with the Three-dimensional Circulant Topology

E.A. Monakhova;O.G. Monakhov;A.Yu. Romanov;E.V. Lezhnev

2020 Moscow Workshop on Electronic and Networking Technologies (MWENT)

Year: 2020 | Conference Paper |

Cited by: Papers (3)

HTML

For analytically defined families of three-dimensional circulant networks with a parametric description, an analytical algorithm for finding shortest paths which has a common scheme for all networks of the family based on a given generating function was developed. A comparative analysis of three routing algorithms (analytical Two-terminal routing algorithm, Coefficients search on graph generators,...Show More

Analytical Routing Algorithm for Networks-on-Chip with the Three-dimensional Circulant Topology

E.A. Monakhova;O.G. Monakhov;A.Yu. Romanov;E.V. Lezhnev

2020 Moscow Workshop on Electronic and Networking Technologies (MWENT)

Year: 2020 | Conference Paper |

A Comparative Analysis of Bioinspired Algorithms for Solving the Problem of Optimization of Circulant and Hypercirculant Networks

Oleg Monakhov;Emilia Monakhova

2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)

Year: 2019 | Conference Paper |

Cited by: Papers (4)

HTML

The solution of the optimization problem of constructing regular networks (graphs) that are optimal over the average diameter is investigated. Two classes of parametrically described regular networks are investigated - circulant and hypercirculant networks. An approach using bioinspired algorithms for the automatic synthesis of parametric descriptions of optimal circulant and hypercirculant networ...Show More

A Comparative Analysis of Bioinspired Algorithms for Solving the Problem of Optimization of Circulant and Hypercirculant Networks

Oleg Monakhov;Emilia Monakhova

2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)

Year: 2019 | Conference Paper |

Differential Evolution for Multi-Variant Evolutionary Synthesis of Nonlinear Models

Oleg G. Monakhov

2018 XIV International Scientific-Technical Conference on Actual Problems of Electronics Instrument Engineering (APEIE)

Year: 2018 | Conference Paper |

HTML

We propose a new multi-variant evolutionary algorithm based on differential evolution for solving the problem of construction of nonlinear models (mathematical expressions, functions, algorithms, and programs) using the given experimental data, sets of variables, basic functions and operations. We compare the proposed algorithm with the standard genetic programming algorithm (GP) and the Cartesian...Show More

Differential Evolution for Multi-Variant Evolutionary Synthesis of Nonlinear Models

Oleg G. Monakhov

2018 XIV International Scientific-Technical Conference on Actual Problems of Electronics Instrument Engineering (APEIE)

Year: 2018 | Conference Paper |

Models and algorithms of evolutionary synthesis for optimization of engineering networks

Guljigit Toktoshov;Oleg Monakhov

2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)

Year: 2017 | Conference Paper |

HTML

This paper devoted to solving problem of the optimization of engineering networks. The modified differential evolution algorithm applied to hypernetwork theory model is presented. The method, in comparison with the classical methods of optimization, allows to take into account parameters interdependence placement areas and design networks is proposed. The results of the numerical experiments on lo...Show More

Models and algorithms of evolutionary synthesis for optimization of engineering networks

Guljigit Toktoshov;Oleg Monakhov

2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)

Year: 2017 | Conference Paper |

A simple and efficient co-operative approach for solving multi-modal problems

Hira Zaheer;Millie Pant;Oleg Monakhov;Emilia Monakhova

2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT)

Year: 2016 | Conference Paper |

HTML

In the present study a simple and efficient approach is proposed to enhance the performance of Differential Evolution algorithm, while maintaining its basic structure, for solving continuous global optimization problems. The proposed variant named cooperative DE or CDE is based on utilizing all the individuals of the population. The proposed variant is tested on a set of 15 unconstrained benchmark...Show More

A simple and efficient co-operative approach for solving multi-modal problems

Hira Zaheer;Millie Pant;Oleg Monakhov;Emilia Monakhova

2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT)

Year: 2016 | Conference Paper |

Using evolutionary algorithm for generation of dense families of circulant networks

O. Monakhov;E. Monakhova

Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)

Year: 2002 | Conference Paper |

Cited by: Papers (1)

HTML

In this paper we consider the combinatorial optimization problem of the search for dense families of circulant networks with a good ratio between the order and diameter for a given degree. In particular, we distinguish the optimal families having the minimum possible diameter for a given degree and order of a graph. This work describes a new way of generation of analytical parametric descriptions ...Show More

Using evolutionary algorithm for generation of dense families of circulant networks

O. Monakhov;E. Monakhova

Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)

Year: 2002 | Volume: 2 | Conference Paper |

Parametrically described regular semigroup interconnection networks for large-scale multicomputers

O.G. Monakhov;E.A. Monakhova

Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000

Year: 2000 | Conference Paper |

We propose a new topology for multicomputer networks: parametrically described, regular, and based on semigroups (PRS) networks (or R/sub s/(N, v, g) graphs with the order N, the degree v, the girth g, and the number of equivalence classes s). Many classes of networks such as hypercubes, circulants, cube-connected cycles, etc. are shown to be special cases of the proposed network. We explore the b...Show More

Parametrically described regular semigroup interconnection networks for large-scale multicomputers

O.G. Monakhov;E.A. Monakhova

Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000

Year: 2000 | Conference Paper |

WWW-oriented system for visualization, animation and investigation of mapping algorithms

O.G. Monakhov;O.J. Chunikhin

Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97)

Year: 1997 | Conference Paper |

The article presents TOPAS, a programming environment for visualization, animation and investigation of algorithms for mapping graphs of parallel programs into graphs of parallel computing systems implemented in Java and accessible on the WWW.Show More

WWW-oriented system for visualization, animation and investigation of mapping algorithms

O.G. Monakhov;O.J. Chunikhin

Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97)

Year: 1997 | Conference Paper |

IEEE Personal Account

Change username/password

Purchase Details

Payment Options
View Purchased Documents

Profile Information

Communications Preferences
Profession and Education
Technical interests

Need Help?

US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support

Follow

About IEEE Xplore | Contact Us | Help | Accessibility | Terms of Use | Nondiscrimination Policy | IEEE Ethics Reporting | Sitemap | IEEE Privacy Policy

A public charity, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.

© Copyright 2025 IEEE - All rights reserved, including rights for text and data mining and training of artificial intelligence and similar technologies.

IEEE Account

Change Username/Password
Update Address

Purchase Details

Payment Options
Order History
View Purchased Documents

Profile Information

Communications Preferences
Profession and Education
Technical Interests

Need Help?

US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support

About IEEE Xplore
Contact Us
Help
Accessibility
Terms of Use
Nondiscrimination Policy
Sitemap
Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

Test Whats new message.