Merlan Telmanov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Merlan Telmanov has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Amandyk Kartbayev
Kazakh-British Technical University
2 shared publications - Zukhra Abdiakhmetova
Al-Farabi Kazakh National University
2 shared publications Alexander Brodskiy
D.V. Sokolsky Institute of Fuel, Catalysis and Electrochemistry
1 shared publicationAlexander Sass
D.V. Sokolsky Institute of Fuel, Catalysis and Electrochemistry
1 shared publicationAtabek Khussain
D.V. Sokolsky Institute of Fuel, Catalysis and Electrochemistry
1 shared publication- B. Khusain
D.V. Sokolsky Institute of Fuel, Catalysis and Electrochemistry, Kazakhstan
1 shared publication
Latest Publications
- Open Access
- 5 August 2026
- Published by Taylor & Francis in International Journal of Sustainable Engineering
- Vol. 19 (1)
A virtual–physical hybrid digital twin of an integrated catalytic purification and CO 2 capture system
1. 1.1. Rapid industrialization and urbanization have led to a sustained increase in anthropogenic CO₂ emissions, making industrial decarbonization one of the central challenges of sustainable engi...
- 5 August 2026
- Published by Taylor & Francis in International Journal of Sustainable Engineering
- Vol. 19 (1)
Open AccessA virtual–physical hybrid digital twin of an integrated catalytic purification and CO 2 capture system
1. 1.1. Rapid industrialization and urbanization have led to a sustained increase in anthropogenic CO₂ emissions, making industrial decarbonization one of the central challenges of sustainable engi...
- Open Access
- 1 April 2025
- Published by Institute of Advanced Engineering and Science in Bulletin of Electrical Engineering and Informatics
- Vol. 14 (2) , 1371-1380
Strategic processor task allocation through game-theoretic modeling in distributed computing environments
This paper explores a game-theoretic model for task allocation in distributed systems, where processors with varying speeds and external load factors are considered strategic players. The goal is to understand the impact of processors' strategic behaviors on workload management and overall system efficiency, focusing on the attainment of a pure strategy Nash Equilibrium (NE). The research rigorously develops a formal mathematical model and validates it through extensive simulations, highlighting how NE ensures stability but may not always yield optimal system performance. The adaptive algorithms for dynamic task allocation are proposed to enhance efficiency in real-time processing environments. Results demonstrate that while NE provides stability, the adoption of optimal cooperative strategies significantly improves operational efficiency and reduces transaction costs. The findings contribute valuable insights into the strategic interactions within computational frameworks, offering guidelines for developing more efficient systems. This study not only advances the theoretical understanding of strategic task allocation but also has practical implications for system design and policy-making in areas such as cloud computing and traffic management.
- 1 April 2025
- Published by Institute of Advanced Engineering and Science in Bulletin of Electrical Engineering and Informatics
- Vol. 14 (2) , 1371-1380
Open AccessStrategic processor task allocation through game-theoretic modeling in distributed computing environments
This paper explores a game-theoretic model for task allocation in distributed systems, where processors with varying speeds and external load factors are considered strategic players. The goal is to understand the impact of processors' strategic behaviors on workload management and overall system efficiency, focusing on the attainment of a pure strategy Nash Equilibrium (NE). The research rigorously develops a formal mathematical model and validates it through extensive simulations, highlighting how NE ensures stability but may not always yield optimal system performance. The adaptive algorithms for dynamic task allocation are proposed to enhance efficiency in real-time processing environments. Results demonstrate that while NE provides stability, the adoption of optimal cooperative strategies significantly improves operational efficiency and reduces transaction costs. The findings contribute valuable insights into the strategic interactions within computational frameworks, offering guidelines for developing more efficient systems. This study not only advances the theoretical understanding of strategic task allocation but also has practical implications for system design and policy-making in areas such as cloud computing and traffic management.
- Open Access
- 30 September 2024
- Published by Astana IT University in Scientific Journal of Astana IT University
- p. 150-162
OPTIMIZING PROCESSOR WORKLOADS AND SYSTEM EFFICIENCY THROUGH GAME-THEORETIC MODELS IN DISTRIBUTED SYSTEMS
The primary goal of this research is to examine how different strategic behaviors adopted by processors affect the workload management and overall efficiency of the system. Specifically, the study focuses on the attainment of a pure strategy Nash Equilibrium and explores its implications on system performance. In this context, Nash Equilibrium is considered as a state where no player has anything to gain by changing only their own strategy unilaterally, suggesting a stable, yet not necessarily optimal, configuration under strategic interactions. The paper rigorously develops a formal mathematical model and employs extensive simulations to validate the theoretical findings, thus ensuring the reliability of the proposed model. Additionally, adaptive algorithms for dynamic task allocation are proposed, aimed at enhancing system flexibility and efficiency in real-time processing environments. Key results from this study highlight that while Nash Equilibrium fosters stability within the system, the adoption of optimal cooperative strategies significantly improves operational efficiency and minimizes transaction costs. These findings are illustrated through detailed 3D plots and tabulated results, which provide a detailed examination of how strategic decisions influence system performance under varying conditions, such as fluctuating system loads and migration costs. The analysis also examines the balance between individual processor job satisfaction and overall system performance, highlighting the effect of rigid task reallocation frameworks. Through this study, the paper not only improves our understanding of strategic interactions within computational systems but also provides key ideas that could guide the development of more efficient computational frameworks for various applications.
- 30 September 2024
- Published by Astana IT University in Scientific Journal of Astana IT University
- p. 150-162
Open AccessOPTIMIZING PROCESSOR WORKLOADS AND SYSTEM EFFICIENCY THROUGH GAME-THEORETIC MODELS IN DISTRIBUTED SYSTEMS
The primary goal of this research is to examine how different strategic behaviors adopted by processors affect the workload management and overall efficiency of the system. Specifically, the study focuses on the attainment of a pure strategy Nash Equilibrium and explores its implications on system performance. In this context, Nash Equilibrium is considered as a state where no player has anything to gain by changing only their own strategy unilaterally, suggesting a stable, yet not necessarily optimal, configuration under strategic interactions. The paper rigorously develops a formal mathematical model and employs extensive simulations to validate the theoretical findings, thus ensuring the reliability of the proposed model. Additionally, adaptive algorithms for dynamic task allocation are proposed, aimed at enhancing system flexibility and efficiency in real-time processing environments. Key results from this study highlight that while Nash Equilibrium fosters stability within the system, the adoption of optimal cooperative strategies significantly improves operational efficiency and minimizes transaction costs. These findings are illustrated through detailed 3D plots and tabulated results, which provide a detailed examination of how strategic decisions influence system performance under varying conditions, such as fluctuating system loads and migration costs. The analysis also examines the balance between individual processor job satisfaction and overall system performance, highlighting the effect of rigid task reallocation frameworks. Through this study, the paper not only improves our understanding of strategic interactions within computational systems but also provides key ideas that could guide the development of more efficient computational frameworks for various applications.