Features of distributed computing, taken into account in methods of algorithms optimization for the volume of interprocessor transmissions

The main parameters, considered in methods of algorithms optimization for the volume of interprocessor transmissions

  • Mohammed Haidar Awad Al-Mardi Saint-Petersburg Electrotechnical University, Saint Petersburg, Russia
Keywords: optimization, algorithm, information graph, node power, throughput capacity, execution time, operation, process, processor, unit of time, transmission time

Abstract

In connection with the development of new technologies and the expansion of the use of computers and networks, in particular with the advent of the Internet of things, there is an increasing need to use a combination of computing devices to solve one problem. In this case, most often these devices are geographically distributed and differ from each other by technical characteristics. This article explores the possibility of adapting the methods of parallel computations originally intended for systems with separate memory to distributed systems. The features of distributed systems, ways of representing such systems and algorithms on these systems are considered. The article proposes an approach to the representation of algorithms taking into account the features of a distributed system in the form of a projection of an information graph of the algorithm onto a interconnection graph. This approach allows us to investigate the algorithm in static mode without going through all the network and algorithm states.

Author Biography

Mohammed Haidar Awad Al-Mardi, Saint-Petersburg Electrotechnical University, Saint Petersburg, Russia

PhD student at department of Computer Science and Engineering–4, ETU «LETI»; 197376 , St. Petersburg, Russian Federation, ul. Professora Popova 5, building 2, Department of Computer Science and Engineering–4, almardi-md@mail.ru

References

Abramov O. V., Katueva Ya. Multivariant analysis and stochastic optimization using parallel processing techniques. // Management problems. 2003. № 4. P. 11–15.

Jordan H. F., Alaghband F. Fundamentals of Parallel Processing. Pearson Education, Inc., Upper Saddle River, NJ, 2003. P. 578.

Drake D. E., Hougardy S. A linear-time approximation algorithm for weighted matchings in graphs // ACM Transactions on Algorithms. 2005. № 1. P. 107–122.

Hu Chen. MPIPP: An Automatic Profileguided Parallel Process Placement Toolset for SMP Clusters and Multiclusters / Hu.Chen // Proceedings of the 20th annual international conference on Supercomputing. New York, NY, USA. 2006. P. 353–360.

Rauber N., Runger G. Parallel Programming: for Multicore and Cluster Systems. / N. Rauber, G. Runger. Chemnitz, Germany: Springer, 2010. 450 p.

Gergel V. P. Lectures of Parallel Programming: Proc. Benefit / Gergel V. P., Fursov V. A. Samara State Aerospace University Publishing House, 2009. 163 p.

Voevodin V. V., Voevodin Vl. V. Parallel computing. St. Petersburg: BHV-Petersburg, 2002. 608 p.

Шичкина Ю. А. Сокращение высоты информационного графа параллельных программ // Научно-технические ведомости СПбГПУ. 2009. № 3 (80). С. 148–152.

Шичкина Ю. А., Аль-Марди М. Х. Метод оптимизации параллельного алгоритма за счет уменьшения объема межпроцессорной передачи информации // Сборник известий СПб ГЭТУ. 2015. № 10. С. 15–23.

Published
2018-04-27
How to Cite
Al-Mardi, M. H. A. (2018). Features of distributed computing, taken into account in methods of algorithms optimization for the volume of interprocessor transmissions. Computer Tools in Education, (2), 31-38. https://doi.org/10.32603/2071-2340-2018-2-31-38
Section
Software Engineering