THE ALGORITHM OF DYNAMIC DISTRIBUTION OF TASKS FOR A CLUSTER SYSTEM

Authors

  • Valery Pavlovich Simonenko Department of Computer Engineering, National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Ukraine
  • Dmytro Serhiiovych Zhyzhko

Keywords:

claster, distribution of tasks, planning algorithms

Abstract

The article describes the principle of the algorithm for dynamic loading of cluster nodes and compares its work with existing solutions. Was analyzed it work and efficiency in various types of tasks, the ability to balance and distribute the flow of tasks between the system's kernels. A software model for testing was created. The results of the analysis are presented

References

Computer cluster [електронний ресурс]. — Режим доступу: https://en.wikipedia.org/wiki/Computer_cluster

Distributed computing [електронний ресурс]. — Режим доступу: https://en.wikipedia.org/wiki/Distributed_computing

Introduction to Parallel Computing [електронний ресурс]. — Режим доступу: https://computing.llnl.gov/tutorials/parallel_comp/

Maui Cluster Scheduler [електронний ресурс]. — Режим доступу: http://www.adaptivecomputing.com/products/maui/

Moab HPC Suite – Basic Edition [електронний ресурс]. — Режим доступу: http://www.adaptivecomputing.com/support/download-center/moab-hpcsuite-basic-edition-download/

Downloads

Published

2023-06-04

Issue

2019

Section

Global Networks, Grid and Cloud