Detail publikace

Testing of Python Models of Parallelized Genetic Algorithms

ŠKORPIL, V. OUJEZSKÝ, V. TULEJA, M.

Originální název

Testing of Python Models of Parallelized Genetic Algorithms

Anglický název

Testing of Python Models of Parallelized Genetic Algorithms

Jazyk

en

Originální abstrakt

The paper describes the testing of three models (master slave, fine-grained, and coarse grained) of parallelized genetic algorithms and the comparison of their computational time with each other and with the basic serial model. The analysis of the number of iterations, the load of the main memory and the central processing unit is the subject of other contributions. Corresponding Python modules have been implemented for these models. A test scenario and a test environment were prepared. Testing was realized on a Linux server with the Ubuntu operating system. A RabbitMQ server creating processes by the SCOOP module on the selected workstation was used. Models have been tested by a single-workstation and multi-workstation scenarios. The tested models bring time savings and efficiency improvement compared to the serial model; the fastest was the fine-grained model.

Anglický abstrakt

The paper describes the testing of three models (master slave, fine-grained, and coarse grained) of parallelized genetic algorithms and the comparison of their computational time with each other and with the basic serial model. The analysis of the number of iterations, the load of the main memory and the central processing unit is the subject of other contributions. Corresponding Python modules have been implemented for these models. A test scenario and a test environment were prepared. Testing was realized on a Linux server with the Ubuntu operating system. A RabbitMQ server creating processes by the SCOOP module on the selected workstation was used. Models have been tested by a single-workstation and multi-workstation scenarios. The tested models bring time savings and efficiency improvement compared to the serial model; the fastest was the fine-grained model.

Dokumenty

BibTex


@inproceedings{BUT167257,
  author="Vladislav {Škorpil} and Václav {Oujezský} and Martin {Tuleja}",
  title="Testing of Python Models of Parallelized Genetic Algorithms",
  annote="The paper describes the testing of three models (master slave, fine-grained, and coarse grained) of parallelized genetic algorithms and the comparison of their computational time with each other and with the basic serial model. The analysis of the number of iterations, the load of the main memory and the central processing unit is the subject of other contributions. Corresponding Python modules have been implemented for these models. A test scenario and a test environment were prepared. Testing was realized on a Linux server with the Ubuntu operating system. A RabbitMQ server creating processes by the SCOOP module on the selected workstation was used. Models have been tested by a single-workstation and multi-workstation scenarios. The tested models bring time savings and efficiency improvement compared to the serial model; the fastest was the fine-grained model.",
  address="IEEE",
  booktitle="Proceedings of the 43 rd International Conference on Telecommunications and Signal Processing",
  chapter="167257",
  doi="10.1109/TSP49548.2020.9163475",
  howpublished="online",
  institution="IEEE",
  year="2020",
  month="july",
  pages="235--238",
  publisher="IEEE",
  type="conference paper"
}